# US 2012/0254586 A1 · Quantum and digital processor hybrid systems and methods to solve problems

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0254586 A1
- Document ID: US20120254586A1
- Status: Published application
- Kind: A1
- Application number: 13/439,685
- Filed: 2012-04-04
- Published: 2012-10-04
- Earliest claimed: 2008-06-10
- Assignees: D-Wave Systems Inc.
- Inventors: Mohammad Amin; Michael D. Coury
- Web page: https://patentgrep.com/patent/US20120254586A1

## CPC

- G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- G06F 9/44: Arrangements for executing specific programs
- G06F 15/16: Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs {(coordinating program control therefor G06F9/52; in regulating and control system G05B)}
- G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
- Y10S 977/933: Spintronics or quantum computing
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## Abstract

Quantum processors and classical computers are employed together to solve computational problems. The classical computer may include a parameter learning module that produces a set of parameters. The quantum processor may be configured with the set of parameters to define a problem Hamiltonian and operated to perform adiabatic quantum computation and/or quantum annealing on the problem Hamiltonian to return a first solution to the problem. The parameter learning module of the classical computer may then be used to revise the set of parameters by performing a classical optimization, such as a classical heuristic optimization. The quantum processor may then be programmed with the revised set of parameters to return a revised solution to the problem. The quantum processor may include a superconducting quantum processor implementing superconducting flux qubits.

## Claims

### Claim 1

A quantum processor and classical computer based method of using both a quantum processor and a classical computer to solve a problem, wherein the quantum processor and the classical computer are communicatively coupled to one another, the method comprising:
generating an initial set of parameters for the quantum processor via the classical computer;
providing the initial set of parameters from the classical computer to the quantum processor via a communicative coupling between the classical computer and the quantum processor;
determining a first solution to the problem via a quantum computation performed by the quantum processor using the initial set of parameters;
varying at least one parameter of the initial set of parameters via the classical computer to generate a revised set of parameters for the quantum processor, wherein varying at least one parameter of the initial set of parameters includes performing a classical optimization via the classical computer;
providing the revised set of parameters from the classical computer to the quantum processor via the communicative coupling between the classical computer and the quantum processor; and
determining a revised solution to the problem via a quantum computation performed by the quantum processor using the revised set of parameters.

### Claim 2 (depends on 1)

The method of claim 1 wherein determining a first solution to the problem via a quantum computation performed by the quantum processor using the initial set of parameters includes determining a first solution to the problem via an adiabatic quantum computation performed by the quantum processor using the initial set of parameters, and wherein determining a revised solution to the problem via a quantum computation performed by the quantum processor using the revised set of parameters includes determining a revised solution to the problem via an adiabatic quantum computation performed by the quantum processor using the revised set of parameters.

### Claim 3 (depends on 1)

The method of claim 1 wherein determining a first solution to the problem via a quantum computation performed by the quantum processor using the initial set of parameters includes determining a first solution to the problem via an implementation of quantum annealing performed by the quantum processor using the initial set of parameters, and wherein determining a revised solution to the problem via a quantum computation performed by the quantum processor using the revised set of parameters includes determining a revised solution to the problem via an implementation of quantum annealing performed by the quantum processor using the revised set of parameters.

### Claim 4 (depends on 1)

The method of claim 1 wherein performing a classical optimization via the classical computer includes performing a classical heuristic optimization via the classical computer.

### Claim 5 (depends on 4)

The method of claim 4 wherein performing a classical heuristic optimization via the classical computer includes refining the first solution to the problem via a classical heuristic optimization algorithm performed by the classical computer.

### Claim 6 (depends on 4)

The method of claim 4 wherein the classical heuristic optimization algorithm includes at least one of: local search, tabu search, a genetic algorithm, or simulated annealing.

### Claim 7 (depends on 1)

The method of claim 1 wherein the first solution to the problem is an approximate solution and determining a revised solution to the problem includes determining a second solution to the problem that is at least as good as the first solution to the problem.

### Claim 8 (depends on 1)

The method of claim 1 wherein the quantum processor includes a plurality of qubits and a plurality of coupling devices, and wherein the set of initial parameters includes parameters that control the plurality of qubits and parameters that control the plurality of coupling devices.

### Claim 9 (depends on 8)

The method of claim 8 wherein a Hamiltonian of the quantum processor is given by:
H
=
∑
i
=
1
n


h
i

σ
i
z
+
∑
i
,
j
=
1
n


J
ij

σ
i
z

σ
j
z
and wherein generating an initial set of parameters for the quantum processor via the classical computer includes generating initial values for the hi terms and the Jij terms in the Hamiltonian of the quantum processor.

### Claim 10 (depends on 9)

The method of claim 9 wherein varying at least one parameter of the initial set of parameters includes varying at least one of: an hi term in the Hamiltonian of the quantum processor or a Jij term in the Hamiltonian of the quantum processor.

### Claim 11 (depends on 1)

The method of claim 1, further comprising:
comparing the revised solution to the first solution via the classical computer.

### Claim 12 (depends on 1)

The method of claim 1 wherein the classical computer includes a system memory storing a parameter learning module and wherein varying at least one parameter of the initial set of parameters via the classical computer includes varying at least one parameter of the initial set of parameters via the parameter learning module of the classical computer.

### Claim 13 (depends on 12)

The method of claim 12, further comprising:
comparing the revised solution to the first solution via the classical computer;
determining, via the parameter learning module, that varying a first parameter in a first direction leads to an improved revised solution compared to the first solution; and
varying the first parameter in the first direction via the parameter learning module.

### Claim 14

A computing system operable to solve problems, the computing system comprising:
a quantum processor;
a classical computing subsystem communicatively coupled to the quantum processor, the classical computing subsystem including a classical processor and a system memory storing a parameter learning module, wherein the parameter learning module is configured to generate a set of parameters for the quantum processor and to revise the set of parameters for the quantum processor to produce a revised set of parameters by varying at least one parameter of the set of parameters, wherein varying at least one parameter of the set of parameters includes performing a classical optimization.

### Claim 15 (depends on 14)

The system of claim 14 wherein a Hamiltonian of the quantum processor is given by:
H
=
∑
i
=
1
n


h
i

σ
i
z
+
∑
i
,
j
=
1
n


J
ij

σ
i
z

σ
j
z
and wherein the parameter learning module is configured to generate values for the hi terms and the Jij terms in the Hamiltonian of the quantum processor.

### Claim 16 (depends on 14)

The system of claim 14 wherein the quantum processor is operable to perform at least one of: adiabatic quantum computation or quantum annealing.

### Claim 17 (depends on 14)

The system of claim 14, further comprising a solver module stored in the system memory of the classical computing subsystem, the solver module configured to:
receive the set of parameters from the parameter learning system and employ the set of parameters to control the quantum processor and cause the quantum processor to provide a first solution to a problem; and
receive the revised set of parameters from the parameter learning system and employ the revised set of parameters to control the quantum processor and cause the quantum processor to provide a revised solution to the problem.

### Claim 18 (depends on 14)

The system of claim 14 wherein the parameter learning module is configured to vary at least one parameter of the set of parameters by performing a classical heuristic optimization.

### Claim 19 (depends on 18)

The system of claim 18 wherein the parameter learning module is configured to vary at least one parameter of the set of parameters by performing at least one of: local search, tabu search, a genetic algorithm, or simulated annealing.

### Claim 20 (depends on 14)

The system of claim 14 wherein the quantum processor comprises a superconducting quantum processor implementing superconducting flux qubits.
