IP Library Granted Patent US 11,574,030
Granted Patent B1
US 11,574,030 · App. 16/663,848 · Granted Feb 7, 2023

Solving optimization problems using a hybrid computer system

Inventors: Matthew P. Harrigan (Emeryville, CA); Erik Joseph Davis (Berkeley, CA)
Assignee: Rigetti & Co, LLC
G06F17/11G06F17/16G06F17/175G06N10/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,574,030
App. No.
16/663,848
Granted
Feb 7, 2023
Kind
B1
Abstract

In a general aspect, an optimization problem is solved using a hybrid computing system. A classical processor unit receives a first data structure that represents the optimization problem. The classical processor unit executes a branch-and-bound process on the first data structure to generate values for a first subset of elements of a solution to the optimization problem. A second data structure is generated based on the first data structure and the first subset of elements. The second data structure represents a reduced version of the optimization problem. A quantum processor unit and a classical processor unit are used to execute a quantum approximate optimization algorithm (QAOA) on the second data structure to generate values for a second subset of the elements of the solution to the optimization problem. The first subset and second subset are combined to obtain the solution to the optimization problem.

Claims (53)

1. A method of operating a hybrid computer system, the hybrid computer system comprising a quantum processor unit and one or more classical processor units, the quantum processor unit comprising:

a quantum processor cell configured to process quantum information by applying control signals to qubits in the quantum processor cell, wherein the quantum processor cell comprises a superconducting circuit comprising qubit devices that define the qubits,

a controller configured to generate control information, and

signal hardware configured to:

generate the control signals based on the control information, and

deliver the control signals to the quantum processor cell,

the method comprising:

by operation of at least one of the one or more classical processor units:

identifying a number of qubits defined by the qubit devices in the superconducting circuit in the quantum processor unit;

receiving a first data structure that represents an optimization problem;

executing a branch-and-bound process that is operable to generate a solution to the optimization problem, wherein the branch-and-bound process is executed on the first data structure to generate values for a first subset of elements of the solution to the optimization problem;

stopping the execution of the branch-and-bound process when a number of elements in the first subset of elements is equal to or greater than a threshold that is based on the number of qubits defined by the qubit devices in the superconducting circuit in the quantum processor unit;

generating a second data structure based on the first data structure and the first subset of elements, the second data structure representing a reduced version of the optimization problem;

executing, by operation of the quantum processor unit and at least one of the one or more classical processor units, a quantum approximate optimization algorithm (QAOA) on the second data structure to generate values for a second subset of elements of the solution to the optimization problem, wherein executing the QAOA comprises an iterative process, and each iteration of the iterative process comprises:

by operation of the at least one of the one or more classical processor units:

adjusting parameters of the QAOA, and

constructing quantum program instructions according to the adjusted parameters;

by operation of the controller, generating a hardware-specific control sequence configured to execute the operations proscribed by the quantum program instructions; and

by operation of the controller, the signal hardware and the quantum processor cell, executing the hardware-specific control sequence; and

combining, by operation of at least one of the one or more classical processor units, the values of the first and second subsets of elements to obtain the solution to the optimization problem.

2. The method of claim 1 , comprising mapping the reduced version of the optimization problem to connectivity of the qubit devices in the quantum processor unit.

3. The method of claim 2 , wherein the mapping comprises translating problem variables to the qubit devices in a connected lattice in the quantum processor unit.

4. The method of claim 1 ,

wherein the first data structure comprises an n×n matrix (A) and the first and second subsets of elements comprises a vector (x) of length n; and

wherein the solution to the optimization problem minimizes a scalar represented by x T Ax.

5. The method of claim 1 , wherein the optimization problem is a combinatorial optimization problem (COP).

6. The method of claim 1 , wherein the QAOA is executed by the quantum processor unit and at least one of the one or more classical processor units.

7. A hybrid computer system comprising a quantum processor unit (QPU) and one or more classical processor units, the quantum processor unit comprising:

a quantum processor cell configured to process quantum information by applying control signals to qubits in the quantum processor cell, wherein the quantum processor cell comprises a superconducting circuit comprising qubit devices that define the qubits,

a controller configured to generate control information, and

signal hardware configured to:

generate the control signals based on the control information, and

deliver the control signals to the quantum processor cell,

at least one of the one or more classical processor units configured to perform operations comprising:

identifying a number of qubits defined by the qubit devices in the superconducting circuit in the quantum processor unit;

receiving a first data structure that represents an optimization problem;

executing a branch-and-bound process that is operable to generate a solution to the optimization problem, wherein the branch-and-bound process is executed on the first data structure to generate values for a first subset of elements of the solution to the optimization problem;

stopping the execution of the branch-and-bound process when a number of elements in the first subset of elements is equal to or greater than a threshold that is based on the number of qubits defined by the qubit devices in the superconducting circuit in the quantum processor unit;

generating a second data structure based on the first data structure and the first subset of elements, the second data structure representing a reduced version of the optimization problem; and

combining the values of the first subset of elements and values of a second subset of elements to obtain the solution to the optimization problem;

the quantum processor unit and at least one of the one or more classical processor units configured to execute a quantum approximate optimization algorithm (QAOA) based on the second data structure to generate the values for the second subset of elements of the solution to the optimization problem, wherein executing the QAOA comprises an iterative process, and each iteration of the iterative process comprises:

by operation of the at least one of the one or more classical processor units:

adjusting parameters of the QAOA, and

constructing quantum program instructions according to the adjusted parameters:

by operation of the controller, generating a hardware-specific control sequence configured to execute the operations proscribed by the quantum program instructions; and

by operation of the controller, the signal hardware and the quantum processor cell, executing the hardware-specific control sequence.

8. The hybrid computer system of claim 7 , the operations comprising mapping the reduced version of the optimization problem to connectivity of the qubit devices in the quantum processor unit.

9. The hybrid computer system of claim 8 , wherein the mapping comprises translating problem variables to the qubit devices in a connected lattice in the quantum processor unit.

10. The hybrid computer system of claim 7 ,

wherein the first data structure comprises an n×n matrix (A) and the first and second subsets of elements comprises a vector (x) of length n; and

wherein the solution to the optimization problem minimizes a scalar represented by x T Ax.

11. The hybrid computer system of claim 7 , wherein the optimization problem is a combinatorial optimization problem (COP).

12. The hybrid computer system of claim 7 , wherein the QAOA is executed by the quantum processor unit and at least one of the one or more classical processor units.

Assignments (7)
RELEASE OF SECURITY INTEREST Recorded Dec 12, 2024
From: TRINITY CAPITAL INC.
To: RIGETTI & CO, LLC; RIGETTI INTERMEDIATE LLC; RIGETTI COMPUTING, INC.
Reel/Frame 069603/0831 →
RELEASE OF SECURITY INTEREST Recorded Dec 12, 2024
From: TRINITY CAPITAL INC.
To: RIGETTI & CO, LLC
Reel/Frame 069603/0771 →
AMENDED AND RESTATED INTELLECTUAL PROPERTY SECURITY AGREEMENT Recorded Jul 8, 2024
From: RIGETTI & CO, LLC; RIGETTI INTERMEDIATE LLC; RIGETTI COMPUTING, INC.
To: TRINITY CAPITAL INC.
Reel/Frame 068146/0416 →
CHANGE OF NAME Recorded Apr 12, 2023
From: RIGETTI & CO, INC.
To: RIGETTI & CO, LLC
Reel/Frame 063308/0804 →
CHANGE OF NAME Recorded Mar 23, 2022
From: RIGETTI & CO, INC.
To: RIGETTI & CO, LLC
Reel/Frame 059772/0484 →
INTELLECTUAL PROPERTY SECURITY AGREEMENT Recorded Mar 10, 2021
From: RIGETTI & CO, INC.
To: TRINITY CAPITAL INC.
Reel/Frame 055557/0057 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 29, 2020
From: HARRIGAN, MATTHEW P.; DAVIS, ERIK JOSEPH
To: RIGETTI & CO, INC.
Reel/Frame 051659/0974 →
Continuity (1)
Provisional Application 62752195 · Oct 29, 2018
Cited By (8)
US 12,265,853 US 12,277,510 US 12,367,089 US 12,412,106 US 12,437,216 US 12,437,220 US 12,456,066 US 12,614,101