# US 2021/0279631 A1 · Quantum computing for combinatorial optimization problems using programmable atom arrays

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

- Number: US 2021/0279631 A1
- Document ID: US20210279631A1
- Status: Published application
- Kind: A1
- Application number: 17/270,741
- Filed: 2019-08-30
- Published: 2021-09-09
- Earliest claimed: 2018-08-31
- Assignees: President and Fellows of Harvard College
- Applicants: President and Fellows of Harvard College
- Inventors: Hannes Pichler; Shengtao Wang; Leo Xiangyu Zhou; Soonwon Choi; Mikhail D. Lukin
- Web page: https://patentgrep.com/patent/US20210279631A1

## CPC

- B82Y 10/00: Nanotechnology for information processing, storage or transmission, e.g. quantum computing or single electron logic
- G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- G06E 1/00: Devices for processing exclusively digital data
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N 10/00: Quantum computing, i.e. information processing based on quantum-mechanical phenomena
- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
- G06N 10/70: Quantum error correction, detection or prevention, e.g. surface codes or magic state distillation
- H10D 48/3835: {Semiconductor qubit devices comprising a plurality of quantum mechanically interacting semiconductor quantum dots, e.g. Loss-DiVincenzo spin qubits}
- B82Y: SPECIFIC USES OR APPLICATIONS OF NANOSTRUCTURES; MEASUREMENT OR ANALYSIS OF NANOSTRUCTURES; MANUFACTURE OR TREATMENT OF NANOSTRUCTURES
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06E: OPTICAL COMPUTING DEVICES (digital storage using optical elements G11C13/04)
- H10D: INORGANIC ELECTRIC SEMICONDUCTOR DEVICES

## Abstract

Systems and methods relate to selectively arranging a plurality of qubits into a spatial structure to encode a quantum computing problem. Exemplary arrangement techniques can be applied to encode various quantum computing problems. The plurality of qubits can be driven according to various driving techniques into a final state. The final state can be measured to identify an exact or approximate solution to the quantum computing problem.

## Claims

### Claim 1

A method comprising:
selectively arranging a plurality of qubits into a spatial structure to encode a quantum computing problem, wherein each qubit corresponds to a vertex in the quantum computing problem, and wherein spatial proximity of the qubits represents edges in the quantum computing problem;
initializing the plurality of qubits into an initial state;
driving the plurality of qubits into a final state by applying a sequence of resonant light pulses with a variable duration and a variable optical phase to at least some of the plurality of qubits, wherein the final state comprises a solution to the quantum computing problem; and
measuring at least some of the plurality of qubits in the final state.

### Claim 2 (depends on 1)

The method of claim 1, wherein the spatial structure comprises a one-dimensional, two-dimensional or three-dimensional array of qubits.

### Claim 3 (depends on 1)

The method of claim 1, wherein the encoded quantum computing problem comprises one or more of an unweighted maximum independent set problem, a maximum-weight independent set problem, a maximum clique problem, and a minimum vertex cover problem.

### Claim 4 (depends on 3)

The method of claim 3, wherein weights in the maximum-weight independent set problem are encoded by applying light shifts to at least some of the plurality of qubits.

### Claim 5 (depends on 3)

The method of claim 3, wherein the final state of the plurality of qubits comprises one or more of a solution to the encoded unweighted maximum independent set problem, a solution to the encoded maximum-weight independent set problem, a solution to the encoded maximum clique problem, and a solution to the encoded minimum vertex cover problem.

### Claim 6 (depends on 1)

The method of claim 1, wherein the solution to the quantum computing problem comprises an approximate solution to the quantum computing problem.

### Claim 7

A method comprising:
selectively arranging a plurality of qubits into a spatial structure comprising a plurality of vertex qubits and a plurality of ancillary qubits to encode a quantum computing problem using spatial proximity of the plurality of qubits, wherein each vertex qubit corresponds to a vertex in the quantum computing problem and wherein subsets of the ancillary qubits correspond to edges in the quantum computing problem;
initializing the plurality of qubits into an initial state;
driving the plurality of qubits into a final state, wherein the final state comprises a solution to the quantum computing problem; and
measuring at least some of the plurality of qubits in the final state.

### Claim 8 (depends on 7)

The method of claim 7, wherein the driving the plurality of qubits into the final state comprises applying light pulses with a constant or variable Rabi frequency Ω and a constant or variable detuning Δ to at least some of the plurality of qubits.

### Claim 9 (depends on 8)

The method of claim 8, wherein the applying light pulses to the at least some of the plurality of qubits further comprises:
applying at least one light pulse with a detuning Δ0 to a vertex qubit comprising a corner vertex or a junction vertex; and
applying at least one light pulse with a detuning Δi to each of i ancillary qubits adjacent to the vertex qubit on an edge connected to the vertex qubit.

### Claim 10 (depends on 9)

The method of claim 9, wherein the applying the light pulses to the at least some of the plurality of qubits further comprises applying light shifts to selected qubits of the at least some of the plurality of qubits.

### Claim 11 (depends on 7)

The quantum computing method of claim 7, wherein the driving the plurality of qubits into the final state comprises applying a sequence of resonant light pulses with a variable duration and a variable optical phase to at least some of the plurality of qubits.

### Claim 12 (depends on 7)

The method of claim 7, wherein the arranging the plurality of qubits into the plurality of vertex qubits and the plurality of ancillary qubits comprises arranging the plurality of qubits onto a grid.

### Claim 13 (depends on 7)

The method of claim 7, wherein the encoded quantum computing problem comprises one or more of an unweighted maximum independent set problem, a maximum-weight independent set problem, a maximum clique problem, and a minimum vertex cover problem.

### Claim 14 (depends on 13)

The method of claim 13, wherein weights in the maximum-weight independent set problem are encoded by applying light shifts to a plurality of qubits.

### Claim 15 (depends on 13)

The method of claim 13, wherein the final state of the plurality of qubits comprises one or more of a solution to the encoded unweighted maximum independent set problem, a solution to the encoded maximum-weight independent set problem, a solution to the encoded maximum clique problem, and a solution to the encoded minimum vertex cover problem.

### Claim 16 (depends on 7)

The method of claim 7, further comprising renumbering at least two vertices in the quantum computing problem prior to the encoding the quantum computing problem.

### Claim 17 (depends on 7)

The method of claim 7, wherein the solution to the quantum computing problem comprises an approximate solution to the quantum computing problem.

### Claim 18

A method comprising:
selectively arranging a plurality of qubits into a spatial structure to encode a quantum computing problem, wherein each qubit corresponds to a vertex in the quantum computing problem;
initializing the plurality of qubits into an initial state;
stroboscopically driving the plurality of qubits into a final state, wherein the final state comprises a solution to the quantum computing problem; and
measuring at least some of the plurality of qubits in the final state.

### Claim 19 (depends on 18)

The method of claim 18, wherein stroboscopically driving the plurality of qubits into a final state comprises applying light pulses sequentially and selectively in an order to subsets of the plurality of qubits, the order of light pulses corresponding to the graph structure of the quantum computing problem.

### Claim 20 (depends on 18)

The method of claim 18, wherein the driving the plurality of qubits into the final state comprises applying light pulses with a constant or variable Rabi frequency Ω and a constant or variable detuning Δ to at least some of the plurality of qubits.

### Claim 21 (depends on 18)

The method of claim 18, wherein the driving the plurality of qubits into the final state comprises applying a sequence of resonant light pulses with a variable duration and a variable optical phase to at least some of the plurality of qubits.

### Claim 22 (depends on 18)

The method of claim 18, wherein the encoded quantum computing problem comprises one or more of an unweighted maximum independent set problem, a maximum-weight independent set problem, a maximum clique problem, and a minimum vertex cover problem.

### Claim 23 (depends on 22)

The method of claim 22, wherein weights in the maximum-weight independent set problem are encoded by applying light shifts to a plurality of qubits.

### Claim 24 (depends on 22)

The method of claim 22, wherein the final state of the plurality of qubits comprises one or more of a solution to the encoded unweighted maximum independent set problem, a solution to the encoded maximum-weight independent set problem, a solution to the encoded maximum clique problem, and a solution to the encoded minimum vertex cover.

### Claim 25 (depends on 18)

The method of claim 18, further comprising renumbering at least two vertices in the quantum computing problem prior to the encoding the quantum computing problem.

### Claim 26 (depends on 18)

The method of claim 18, wherein the solution to the quantum computing problem comprises an approximate solution to the quantum computing problem.

### Claim 27

A method comprising:
arranging a plurality of qubits to encode a quantum computing problem;
applying a sequence of q levels of light pulses to the plurality of qubits, wherein the q levels of light pulses comprises at least a first set of q variational parameters and a second set of q variational parameters;
measuring the state of one or more of the plurality of qubits;
optimizing, based on the measured state of at least some of the one or more of the plurality of qubits, the first set of q variational parameters and the second set of q variational parameters of the q levels of light pulses;
optimizing, based at least on the first set of q optimized variational parameters and the second set of q optimized variational parameters of q levels of light pulses, a first set of p variational parameters and a second set of p variational parameters of p levels of light pulses, wherein q p; and
measuring at least some of the plurality of qubits in a final state.

### Claim 28 (depends on 27)

The method of claim 27, wherein optimizing the first set of p variational parameters and the second set of p variational parameters of p levels of light pulses further comprises computing a first set of p variational parameter starting values and a second set of p variational parameter starting values of the p levels of light pulses.

### Claim 29 (depends on 28)

The method of claim 28, wherein computing of the first set of p variational parameter starting values of the p levels of light pulses, wherein p>1, comprises:
performing a Fourier transform on the first set of q variational parameters of the q levels of light pulses, into a plurality of k frequency components, each of the k frequency components having an amplitude uk; and
computing the first set of p variational parameter starting values of the p levels of light pulses based on the amplitudes uk;

### Claim 30 (depends on 28)

The method of claim 28, wherein computing of the second set of p variational parameter starting values of the p levels of light pulses, wherein p>1, comprises:
performing a Fourier transform on the second set of q variational parameters of the q levels of light pulses, into a plurality of k frequency components, each of the k frequency components having an amplitude vk; and
computing the second set of p variational parameter starting values of the p levels of light pulses based on the amplitudes vk.

### Claim 31 (depends on 28)

The method of claim 28, wherein computing of the first set of p variational parameter starting values and computing of the second set of p variational parameter starting values of the p levels of light pulses, comprises:
extrapolating the first set of p variational parameter starting values of the p levels of light pulses based on the first set of q variational parameters of the q levels of light pulses; and
extrapolating the second set of p variational parameter starting values of the p levels of light pulses based on the second set of q variational parameters of the q levels of light pulses.

### Claim 32 (depends on 27)

The method of claim 27, further comprising applying a sequence of p levels of light pulses to the plurality of qubits with a first set of p optimized variational parameters and a second set of p optimized variational parameters, wherein the measuring the at least some of the plurality of qubits in the final state comprises measuring the at least some of the plurality of qubits after the applying the sequence of p levels of light pulses to the plurality of qubits.

### Claim 33 (depends on 27)

The method of claim 27, wherein the encoded quantum computing problem comprises a MaxCut problem, and wherein the final state of the plurality of qubits comprises a solution to the MaxCut problem.

### Claim 34 (depends on 27)

The method of claim 27, wherein the encoded quantum computing problem comprises a maximum independent set problem, and wherein the final state of the plurality of qubits comprises a solution to the maximum independent set problem.
