Home Patent Forecast® Sectors Log In   Contact  
How it works Patent Forecast® Sectors Insights
Menu
Enjoy your FREE PREVIEW which shows only 2022 data and 25 documents. Contact Patent Forecast for full access.        

Quantum Computing

Search All Applications in Quantum Computing


Application US20200160204


Published 2020-05-21

Hybrid Quantum-classical Computer For Packing Bits Into Qubits For Quantum Optimization Algorithms

A hybrid quantum classical (HQC) computer, which includes both a classical computer component and a quantum computer component, implements improvements to the quantum approximate optimization algorithm (QAOA) which enable QAOA to be applied to valuable problem instances (e.g., those including several thousand or more qubits) using near-term quantum computers.



Much More than Average Length Specification


View the Patent Matrix® Diagram to Explore the Claim Relationships

USPTO Full Text Publication >

2 Independent Claims

  • 1. A method for reducing the number of qubits with which an operator is represented on a quantum computer, the method comprising: (1) receiving, as input, at a classical computer, an N-qubit operator; (2) decomposing, at the classical computer, the N-qubit operator as a linear combination of products of Majorana operators on 2N Majorana modes; (3) forming, at the classical computer, a second operator, representable on M qubits, based on a linear transformation of the Majorana operators of the N-qubit operator, wherein the linear transformation is from R{circumflex over ( )}(2N) to R{circumflex over ( )}(2M), wherein M<N.

  • 18. A system comprising: a classical computer including a processor, a non-transitory computer-readable medium, and computer program instructions stored in the non-transitory computer-readable medium; a quantum computer comprising a plurality of qubits; wherein the computer program instructions, when executed by the processor, perform a method for reducing the number of qubits with which an operator is represented on the quantum computer, the method comprising: (1) receiving, as input, at a classical computer, an N-qubit operator; (2) decomposing, at the classical computer, the N-qubit operator as a linear combination of products of Majorana operators on 2N Majorana modes; (3) forming, at the classical computer, a second operator, representable on M qubits, based on a linear transformation of the Majorana operators of the N-qubit operator, wherein the linear transformation is from R{circumflex over ( )}(2N) to R{circumflex over ( )}(2M), wherein M<N.