# US 2008/0313430 A1 · Method and system for increasing quantum computer processing speed using digital co-processor

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

- Number: US 2008/0313430 A1
- Document ID: US20080313430A1
- Status: Published application
- Kind: A1
- Application number: 12/138,292
- Filed: 2008-06-12
- Published: 2008-12-18
- Earliest claimed: 2007-06-12
- Inventors: Paul I. Bunyk
- Web page: https://patentgrep.com/patent/US20080313430A1

## CPC

- G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
- B82Y 10/00: Nanotechnology for information processing, storage or transmission, e.g. quantum computing or single electron logic
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- B82Y: SPECIFIC USES OR APPLICATIONS OF NANOSTRUCTURES; MEASUREMENT OR ANALYSIS OF NANOSTRUCTURES; MANUFACTURE OR TREATMENT OF NANOSTRUCTURES

## Abstract

A computer system includes a quantum computer, a classical co-processor and an interface that transmits at least part of at least one problem between the quantum computer and the classical co-processor. A digital computer may be coupled to the quantum computer and classical co-processor. Problems may be decomposed for solution by the quantum computer and co-processor based on computational efficiency.

## Claims

### Claim 1

A method of solving problems with a quantum computer, the method comprising:
receiving a problem on the quantum computer;
decomposing the problem into at least a first subproblem and a second subproblem;
determining a first subsolution to the first subproblem on the quantum computer;
transmitting the second subproblem to a classical co-processor;
determining a second subsolution to the second subproblem; and
determining a solution to the problem wherein at least the first subsolution and the second subsolution are used to determine the solution.

### Claim 2 (depends on 1)

The method of claim 1 wherein receiving the problem includes receiving the problem through a user interface.

### Claim 3 (depends on 1)

The method of claim 1 wherein decomposing the problem includes decomposing the problem by a pre-processing manager.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
creating a third subproblem;
transmitting the third subproblem to the classical co-processor; and
determining a third subsolution to the third subproblem.

### Claim 5 (depends on 4)

The method of claim 4 wherein the third subsolution is used to determine the solution.

### Claim 6 (depends on 4)

The method of claim 4 wherein the first subsolution and the second subsolution are combined to create the third subproblem.

### Claim 7 (depends on 4)

The method of claim 4 wherein the third subproblem is a subproblem of the problem.

### Claim 8 (depends on 4)

The method of claim 4, further comprising:
creating a fourth subproblem; and
determining a fourth subsolution to the fourth subproblem.

### Claim 9 (depends on 8)

The method of claim 8 wherein the fourth subsolution is used to determine the solution.

### Claim 10 (depends on 6)

The method of claim 6 wherein the first subsolution and the second subsolution are combined to create the third subproblem.

### Claim 11 (depends on 6)

The method of claim 6 wherein the third subproblem is a subproblem of the problem.

### Claim 12 (depends on 1)

The method of claim 1 wherein determining a first subsolution includes determining the first subsolution using a quantum co-processor.

### Claim 13 (depends on 1)

The method of claim 1 wherein determining a second subsolution includes determining the second subsolution using a classical co-processor.

### Claim 14 (depends on 1)

The method of claim 1, further comprising:
transmitting the second subsolution to the quantum computer.

### Claim 15 (depends on 14)

The method of claim 14 wherein determining a first subsolution occurs after transmitting the second subsolution to the quantum computer.

### Claim 16 (depends on 14)

The method of claim 14 wherein transmitting the second subsolution to the quantum computer includes transmitting the second subsolution to the quantum computer from the classical co-processor.

### Claim 17 (depends on 14)

The method of claim 14 wherein transmitting the second subsolution to the quantum computer includes transmitting the second subsolution to a digital computer communicatively coupled to the quantum computer and communicatively coupled to the classical co-processor and transmitting the second subsolution to the quantum computer from the digital computer.

### Claim 18

A computer system, comprising:
a quantum computer;
a classical co-processor; and
an interface between the quantum computer and the digital co-processor, wherein at least part of at least one problem is transmitted between the quantum computer and the classical co-processor through the interface.

### Claim 19 (depends on 18)

The computer system of claim 18, further comprising:
a digital computer communicatively coupled to at least one of the quantum computer and the classical co-processor.

### Claim 20 (depends on 19)

The computer system of claim 19 wherein the digital computer transmits a first problem to the quantum computer, and wherein the digital computer receives a first solution to the first problem from the classical co-processor.

### Claim 21 (depends on 20)

The computer system of claim 20 wherein the at least part of at least one problem is a subproblem of the first problem, and wherein the subproblem is transmitted between the quantum computer and the classical co-processor to reduce the time needed to find the first solution.

### Claim 22 (depends on 20)

The computer system of claim 20 wherein the digital computer transmits a second problem to the quantum computer, and wherein the digital computer receives a second solution to the second problem from the quantum computer.

### Claim 23 (depends on 22)

The computer system of claim 22 wherein the at least part of at least one problem is a subproblem of the second problem, and wherein the subproblem is transmitted between the quantum computer and the classical co-processor to reduce the time needed to find the first solution.

### Claim 24 (depends on 18)

The computer system of claim 18 wherein the at least part of at least one problem is transmitted from the quantum computer to the classical co-processor.

### Claim 25 (depends on 24)

The computer system of claim 24 wherein a solution to the at least part of at least one problem is transmitted from the classical co-processor to the quantum computer.

### Claim 26 (depends on 24)

The computer system of claim 24 wherein a solution of the at least part of at least one problem is transmitted from the classical co-processor to a digital computer communicatively coupled to the classical co-processor.

### Claim 27 (depends on 24)

The computer system of claim 24 wherein the at least part of at least one problem is a plurality of possible solutions, and wherein the classical co-processor determines which of the possible solutions is the solution to the at least part of at least one problem.

### Claim 28 (depends on 24)

The computer system of claim 24 wherein the at least part of at least one problem is efficiently solved as a Boolean logic problem.

### Claim 29 (depends on 18)

The computer system of claim 18 wherein the quantum computer is a computing system comprising:
a plurality of qubits; and
a plurality of couplers, wherein each coupler couples one of the qubits to another one of the qubits.

### Claim 30 (depends on 29)

The computer system of claim 29 wherein each of the qubits is a superconducting qubit and the quantum computer is a superconducting quantum computer.

### Claim 31 (depends on 18)

The computer system of claim 18 wherein the classical co-processor comprises a plurality of digital co-processors.
