# US 2021/0241143 A1 · Systems and methods for optimizing annealing parameters

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

- Number: US 2021/0241143 A1
- Document ID: US20210241143A1
- Status: Published application
- Kind: A1
- Application number: 17/154,210
- Filed: 2021-01-21
- Published: 2021-08-05
- Earliest claimed: 2020-02-05
- Assignees: D-Wave Systems Inc.
- Applicants: D-Wave Systems Inc.
- Inventors: Mohammad H. Amin
- Web page: https://patentgrep.com/patent/US20210241143A1

## CPC

- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N 5/04: Inference or reasoning models
- G06N 3/0895: Weakly supervised learning, e.g. semi-supervised or self-supervised learning
- G06N 3/09: Supervised learning
- G06N 3/092: Reinforcement learning
- G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- G06N 20/00: Machine learning
- G06N 3/006: based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
- G06N 3/045: Combinations of networks
- G06N 3/047: Probabilistic or stochastic networks
- G06N 7/01: Probabilistic graphical models, e.g. probabilistic networks
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A quantum annealing schedule for a computational problem can be adjusted by methods and systems involving one or more processors. The one or more processors proceed by receiving a representation of the computation problem, the representation including a plurality of problem values. These problem values are transformed based on a plurality of trained parameters of a machine learning model to generate at least a portion of an annealing schedule including at least one annealing parameter. Instructions are transmitted to the quantum processor to cause the quantum processor to evolve from an initial state to a final state based on the computational problem and the at least a portion of an annealing schedule, the final state producing a result for the computational problem.

## Claims

### Claim 1

A method of adjusting a quantum annealing schedule for a computational problem, the method being performed by one or more processors, the method comprising:
receiving a representation of the computational problem, the representation comprising a plurality of problem values;
transforming the plurality of problem values based on a plurality of trained parameters of a machine learning model to generate at least a portion of an annealing schedule comprising at least one annealing parameter; and
transmitting instructions to a quantum processor to cause the quantum processor to evolve from an initial state to a final state based on the computational problem and the at least a portion of an annealing schedule, wherein the final state provides a result for the computational problem.

### Claim 2 (depends on 1)

The method of claim 1, wherein transforming the plurality of problem values based on a plurality of trained parameters of a machine learning model to generate at least a portion of an annealing schedule comprising at least one annealing parameter comprises generating one or more of: annealing offsets, annealing speed, and timing and duration of annealing pauses.

### Claim 3 (depends on 1)

The method of claim 1, wherein transforming the plurality of problem values based on a plurality of trained parameters of a machine learning model to generate at least a portion of an annealing schedule comprising at least one annealing parameter comprises generating multiple annealing parameters to form an annealing schedule.

### Claim 4 (depends on 1)

The method of claim 1, wherein receiving a representation of the computational problem, the representation comprising a plurality of problem values, comprises receiving problem values comprising qubit and coupler parameters corresponding to the computational problem.

### Claim 5 (depends on 4)

The method of claim 4, wherein transforming the plurality of problem values based on a plurality of trained parameters of a machine learning model to generate at least a portion of an annealing schedule comprising at least one annealing parameter comprises generating an annealing parameter that determines the annealing schedule for at least one qubit.

### Claim 6 (depends on 1)

The method of claim 1, wherein receiving a representation of the computational problem comprises receiving a representation of a computational problem comprising a problem Hamiltonian and wherein transmitting instructions to the quantum processor to cause the quantum processor to evolve from an initial state to a final state based on the computational problem and the at least a portion of an annealing schedule further comprises transmitting instructions to the quantum processor to cause the quantum processor to evolve from a problem Hamiltonian state to a result Hamiltonian state.

### Claim 7 (depends on 1)

The method of claim 1, further comprising receiving a default annealing schedule, and wherein transforming the plurality of problem values based on a plurality of trained parameters of a machine learning model to generate at least a portion of an annealing schedule comprising at least one annealing parameter comprises modifying the default annealing schedule based on the at least one annealing parameter to generate the at least a portion of an annealing schedule.

### Claim 8 (depends on 7)

The method of claim 7, wherein receiving a default annealing schedule comprises receiving one or more default annealing parameters comprising one or more of: default annealing offsets, default annealing speed, and default timing and duration of annealing pauses.

### Claim 9 (depends on 7)

The method of claim 7, further comprising receiving result data generated by causing the quantum processor to evolve from an initial state to a final state based on the computational problem and the default annealing schedule, and wherein transforming the plurality of problem values based on a plurality of trained parameters of a machine learning model to generate at least a portion of an annealing schedule comprising at least one annealing parameter comprises transforming the plurality of problem values and the result data to generate at least a portion of an annealing schedule comprising at least one annealing parameter.

### Claim 10 (depends on 1)

The method of claim 1, wherein transforming the plurality of problem values based on a plurality of trained parameters of a machine learning model to generate at least a portion of an annealing schedule comprising at least one annealing parameter further comprises generating at least a portion of an annealing schedule comprising at least one annealing offset parameter and at least one annealing offset compensation coefficient, and wherein transmitting instructions to the quantum processor further comprises transmitting the at least one annealing offset compensation coefficient, to thereby cause the quantum processor to update the computational problem with the at least one annealing offset compensation coefficient to generate an updated computational problem, and to thereby cause the quantum processor to evolve from an initial state to a final state based on the updated computational problem and the at least a portion of an annealing schedule.

### Claim 11

A system for use in quantum processing, comprising:
at least one non-transitory processor-readable medium that stores at least one of processor executable instructions and data; and
at least one processor communicatively coupled to the least one non-transitory processor-readable medium and a quantum processor, and which, in response to execution of the at least one of processor executable instructions and data:
receives a representation of a computational problem, the representation comprising a plurality of problem values;
transforms the plurality of problem values based on a plurality of trained parameters of a machine learning model to generate at least a portion of an annealing schedule comprising at least one annealing parameter; and
transmits instructions to the quantum processor that cause the quantum processor to evolve from an initial state to a final state based on the computational problem and the at least a portion of an annealing schedule, wherein the final state provides a result for the computational problem.

### Claim 12 (depends on 11)

The system of claim 11, wherein the at least one annealing parameter comprises one or more of: annealing offsets, annealing speed, and timing and duration of annealing pauses.

### Claim 13 (depends on 11)

The system of claim 11, wherein the machine learning model is trained to generate multiple annealing parameters to form an annealing schedule.

### Claim 14 (depends on 11)

The system of claim 11, wherein the plurality of problem values comprises qubit and coupler parameters corresponding to the computational problem.

### Claim 15 (depends on 14)

The system of claim 14, wherein the at least one annealing parameter comprises an annealing parameter that determines the annealing schedule for at least one qubit.

### Claim 16 (depends on 11)

The system of claim 11, wherein the representation of a computational problem comprises a representation of a problem Hamiltonian and the result for the computational problem comprises a result Hamiltonian.

### Claim 17 (depends on 11)

The system of claim 11, wherein, in response to execution of the at least one of processor executable instructions and data, the at least one processor receives a default annealing schedule, and transmits instructions to the quantum processor to modify the default annealing schedule based on the at least one annealing parameter to generate the at least a portion of an annealing schedule.

### Claim 18 (depends on 17)

The system of claim 17, wherein the default annealing schedule comprises one or more default annealing parameters comprising one or more of: default annealing offsets, default annealing speed, and default timing and duration of annealing pauses.

### Claim 19 (depends on 17)

The system of claim 17, wherein, in response to execution of the at least one of processor executable instructions and data, the at least one processor receives result data generated by the quantum processor evolving from an initial state to a final state based on the computational problem and the default annealing schedule, and wherein the processor transforms the plurality of problem values and the result data to generate the at least a portion of an annealing schedule comprising the at least one annealing parameter.

### Claim 20 (depends on 11)

The system of claim 11, wherein the at least a portion of an annealing schedule comprises at least one annealing offset parameter and at least one annealing offset compensation coefficient and wherein, in response to execution of the at least one of processor executable instructions and data, the processor transmits instructions to the quantum processor to update the computational problem with the annealing offset compensation coefficients to generate an updated computational problem, which instructions cause the quantum processor to evolve from an initial state to a final state based on the updated computational problem and the at least a portion of an annealing schedule to produce the result for the computational problem.
