# US 2021/0342289 A1 · Analog processor comprising quantum devices

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

- Number: US 2021/0342289 A1
- Document ID: US20210342289A1
- Status: Published application
- Kind: A1
- Application number: 17/355,458
- Filed: 2021-06-23
- Published: 2021-11-04
- Earliest claimed: 2004-12-23
- Assignees: D-Wave Systems Inc.
- Applicants: D-Wave Systems Inc.
- Inventors: Alexander Maassen van den Brink; Peter Love; Mohammad H.S. Amin; Geordie Rose; David Grant; Miles F.H. Steininger; Paul I. Bunyk; Andrew J. Berkley
- Web page: https://patentgrep.com/patent/US20210342289A1

## CPC

- G06F 15/80: comprising an array of processing units with common control, e.g. single instruction multiple data processors (G06F15/82 takes precedence {; for correlation function computation G06F17/15})
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06F 15/76: Architectures of general purpose stored program computers (with program plugboard G06F15/08; multicomputers G06F15/16)
- G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
- H03K 3/38: by the use, as active elements, of superconductive devices
- H04L 67/12: specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
- B82Y 10/00: Nanotechnology for information processing, storage or transmission, e.g. quantum computing or single electron logic
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- H03K: PULSE TECHNIQUE (measuring pulse characteristics G01R; modulating sinusoidal oscillations with pulses H03C; transmission of digital information H04L; discriminator circuits detecting phase difference between two signals by counting or integrating cycles of oscillation H03D3/04; automatic control, starting, synchronisation or stabilisation of generators of electronic oscillations or pulses where the type of generator is irrelevant or unspecified H03L; coding, decoding or code conversion, in general H03M)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- B82Y: SPECIFIC USES OR APPLICATIONS OF NANOSTRUCTURES; MEASUREMENT OR ANALYSIS OF NANOSTRUCTURES; MANUFACTURE OR TREATMENT OF NANOSTRUCTURES

## Abstract

Analog processors for solving various computational problems are provided. Such analog processors comprise a plurality of quantum devices, arranged in a lattice, together with a plurality of coupling devices. The analog processors further comprise bias control systems each configured to apply a local effective bias on a corresponding quantum device. A set of coupling devices in the plurality of coupling devices is configured to couple nearest-neighbor quantum devices in the lattice. Another set of coupling devices is configured to couple next-nearest neighbor quantum devices. The analog processors further comprise a plurality of coupling control systems each configured to tune the coupling value of a corresponding coupling device in the plurality of coupling devices to a coupling. Such quantum processors further comprise a set of readout devices each configured to measure the information from a corresponding quantum device in the plurality of quantum devices.

## Claims

### Claim at position 1

-79. (canceled)

### Claim 80

A quantum processor, comprising:
a plurality of quantum devices; and
a plurality of coupling devices wherein each coupling device in the plurality of coupling devices couples a pair of quantum device wherein a non-planar graph is embedded into the plurality of quantum devices and a set of quantum devices in the plurality of quantum devices are nodes of the non-planar graph.

### Claim 81 (depends on 80)

The quantum processor of claim 80 wherein a quantum device in the plurality of quantum devices comprises a loop of superconducting material interrupted by at least one Josephson junction.

### Claim 82 (depends on 81)

The quantum processor of claim 81 wherein at least one of the Josephson junctions in the quantum device is a compound Josephson junction.

### Claim 83 (depends on 80)

The quantum processor of claim 80 wherein the plurality of quantum devices is arranged in a two-dimensional array, wherein the two-dimensional array has a width defined by a first plurality of nodes n, and a length defined by a second plurality of nodes m, and wherein the two-dimensional array comprises an interior and a perimeter.

### Claim 84 (depends on 80)

The quantum processor of claim 80 wherein a quantum device in the plurality of quantum devices has a gradiometric configuration.

### Claim 85 (depends on 80)

The quantum processor of claim 80 wherein at least one coupling device in the plurality of coupling devices comprises a loop of superconducting material interrupted by at least one Josephson junction.

### Claim 86 (depends on 80)

The quantum processor of claim 80 wherein at least one coupling device in the plurality of coupling devices comprises a loop of superconducting material interrupted by at least one compound Josephson junction.

### Claim 87 (depends on 80)

The quantum processor of claim 80 wherein at least one coupling device in the plurality of coupling devices is selected from the group consisting of an rf-SQUID and a dc-SQUID.

### Claim 88 (depends on 80)

The quantum processor of claim 80, further comprising:
a readout device that is configured to readout a state of at least one quantum device in the plurality of quantum devices.

### Claim 89 (depends on 88)

The quantum processor of claim 88 wherein the readout device is selected from the group consisting of a dc-SQUID and a magnetometer.

### Claim 90 (depends on 80)

The quantum processor of claim 80 wherein the plurality of quantum devices is arranged in a lattice.

### Claim 91

A computer system for determining a result of a computational problem, the computer system comprising:
a central processing unit; and
a non-transitory computer-readable storage medium coupled to the central processing unit and which stores instructions that cause the computer system to:
present a user interface that enables a user to provide a definition of a computational problem;
receive the definition of the computational problem;
generate a mapping of the computational problem;
transmit the mapping to an analog processor, the analog processor comprising a plurality of quantum devices and a plurality of coupling devices, the mapping including initialization values for at least one of the quantum devices in the plurality of quantum devices and initialization values for at least one of the coupling devices in the plurality of coupling devices, wherein a coupling device in the plurality of coupling devices couples a corresponding respective quantum device in the plurality of quantum devices to at least one of a nearest neighbor of the respective quantum device and a next-nearest neighbor of the respective quantum device; and
receive a result, responsive to the mapping, from the analog processor.

### Claim 92 (depends on 91)

The computer system of claim 91, wherein the computational problem is selected from the group consisting of a problem having a complexity of P, a problem having a complexity of NP, a problem having a complexity of NP-Hard and a problem having a complexity of NP-Complete.

### Claim 93 (depends on 91)

The computer system of claim 91, wherein the computational problem is selected from the group consisting of an Ising Spin Glass problem, a Maximum Independent Set problem, a Max Clique problem, a Max Cut problem, a traveling salesperson problem, a k-SAT problem and an integer linear programming problem.

### Claim 94 (depends on 91)

The computer system of claim 91, wherein the user interface enables the user to define at least one run-time control parameter.

### Claim 95 (depends on 91)

The computer system of claim 91, wherein the instructions to generate a mapping of the computational problem comprise instructions to map an NP problem into an equivalent representation in an Ising model.

### Claim 96 (depends on 91)

The computer system of claim 91, wherein the user provided definition of the computational problem comprises an input graph representation of the computational problem and wherein the instructions to generate a mapping of the computational problem cause the computer system to map the computational problem from the input graph representation to an equivalent graph representation that maps to a configuration of the analog processor.

### Claim 97

A method of determining a result for a computational problem using a quantum processor, the quantum processor comprising at least two quantum devices and at least one coupling device and each coupling device couples a pair of quantum devices, the method comprising:
initializing the quantum processor to an initial state, wherein each quantum device in the quantum processor is a node in a lattice of nodes;
mapping a graph representing the computational problem onto at least a portion of the lattice of nodes;
evolving the quantum processor after mapping the graph onto at least a portion of the lattice;
determining a value of at least one node in the lattice of nodes after evolving the quantum processor; and
generating a carrier wave embodying a data signal comprising a result for the computational problem, wherein result for the computational problem comprises the value of the at least one node in the lattice of nodes.

### Claim 98 (depends on 97)

The method of claim 97, further comprising configuring the graph of the computational problem to be solved so that it can be mapped to the lattice of the quantum processor, the graph of the computational problem to be solved comprising a plurality of nodes and, for each respective node in the plurality of nodes, an initial value for the respective node and a corresponding coupling constant between the respective node and another node in the plurality of nodes.

### Claim 99 (depends on 97)

The method of claim 97, further comprising converting the computational problem to be solved to a graph comprising a plurality of nodes prior to mapping the graph onto the at least a portion of the lattice of nodes of the quantum processor, the converted problem comprising, for each respective node in the plurality of nodes, an initial value for the respective node and a corresponding coupling constant between the respective node and another node in the plurality of nodes.
