# US 12,008,434 B2 · Adiabatic progression with intermediate re-optimization to solve hard variational quantum problems in quantum computing > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,008,434 B2 - Document ID: US12008434B2 - Status: Granted - Kind: B2 - Application number: 17/729,766 - Filed: 2022-04-26 - Published: 2022-12-29 - Granted: 2024-06-11 - Earliest claimed: 2019-05-30 - Assignees: International Business Machines Corporation - Applicants: International Business Machines Corporation - Inventors: Don Greenberg; Marco Pistoia; Richard Chen; Giacomo Nannicini - Web page: https://patentgrep.com/patent/US12008434B2 ## CPC - G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers - B82Y 10/00: Nanotechnology for information processing, storage or transmission, e.g. quantum computing or single electron logic - G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound - G06N 5/02: Knowledge representation; Symbolic representation - G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms - G06N 10/80: Quantum programming, e.g. interfaces, languages or software-development kits for creating or handling programs capable of running on quantum computers; Platforms for simulating or accessing quantum computers, e.g. cloud-based quantum computing - 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 hybrid classical-quantum computing device to execute a quantum circuit corresponding to a variational problem, is configured. The configuring further comprises causing the hybrid classical-quantum computing device to execute the quantum circuit by performing an adiabatic progression operation, wherein the adiabatic progression operation comprises increasing the difficulty of the variational problem from a simplified version of the problem to the variational problem. ## Claims ### Claim 1 A computer-implemented method comprising: generating a first set of increases from a current state of a continuous parameter, wherein the current state of the continuous parameter corresponds to a first difficulty level of a parametrized optimization problem; generating a set of variational parameters corresponding to each of the first set of increases, each set of variational parameters specifying an executable configuration of a quantum circuit in a first set of configurations of the quantum circuit; causing a hybrid classical-quantum computing device to execute each configuration in the first set of configurations and produce a corresponding first set of outputs; concluding, from the first set of outputs, that a largest increase in the first set of increases is keeping the continuous parameter at or below a goal state; and causing, responsive to the concluding, the hybrid classical-quantum computing device to execute a second set of configurations of the quantum circuit, each configuration in the second set of configurations of the quantum circuit specified by a second set of variational parameters, each second set of variational parameters generated from an increase in a second set of increases in the continuous parameter from the current state of the continuous parameter. ### Claim 2 (depends on 1) The computer-implemented method of claim 1, wherein the hybrid classical-quantum computing device comprises a Noisy Intermediate Scale Quantum (NISQ) device. ### Claim 3 (depends on 2) The computer-implemented method of claim 2, wherein the first set of configurations of the quantum circuit each comprises a square quantum circuit, the square quantum circuit being suited for implementing on the NISQ device. ### Claim 4 (depends on 1) The computer-implemented method of claim 1, wherein the goal state of the continuous parameter corresponds to a second difficulty level of the parametrized optimization problem higher than the first difficulty level, further comprising: controlling, according to the values of the first set of increases in the continuous parameter, a pace at which to progress a difficulty level of the parametrized optimization problem. ### Claim 5 (depends on 4) The computer-implemented method of claim 4, wherein the largest increase in the first set of increases comprises a difference between the goal state of the continuous parameter and the current state of the continuous parameter. ### Claim 6 (depends on 4) The computer-implemented method of claim 4, wherein the largest increase in the first set of increases comprises a 1/n multiple of a difference between the goal state of the continuous parameter and the current state of the continuous parameter, where n is a positive whole number. ### Claim 7 (depends on 4) The computer-implemented method of claim 4, wherein the first set of increases comprises a set of equally-spaced increases between the current state of the continuous parameter and the goal state of the continuous parameter. ### Claim 8 (depends on 4) The computer-implemented method of claim 4, wherein the largest increase in first set of increases to a configuration of the quantum circuit that completed execution within an execution time period. ### Claim 9 A computer usable program product comprising one or more computer-readable storage devices, and program instructions stored on at least one of the one or more storage devices, the stored program instructions comprising: program instructions to generate a first set of increases from a current state of a continuous parameter, wherein the current state of the continuous parameter corresponds to a first difficulty level of a parametrized optimization problem; program instructions to generate a set of variational parameters corresponding to each of the first set of increases, each set of variational parameters specifying an executable configuration of a quantum circuit in a first set of configurations of the quantum circuit; program instructions to cause a hybrid classical-quantum computing device to execute each configuration in the first set of configurations and produce a corresponding first set of outputs; program instructions to conclude, from the first set of outputs, that a largest increase in the first set of increases is keeping the continuous parameter at or below a goal state; and program instructions to cause, responsive to the program instructions to conclude, the hybrid classical-quantum computing device to execute a second set of configurations of the quantum circuit, each configuration in the second set of configurations of the quantum circuit specified by a second set of variational parameters, each second set of variational parameters generated from an increase in a second set of increases in the continuous parameter from the current state of the continuous parameter. ### Claim 10 (depends on 9) The computer usable program product of claim 9, wherein the hybrid classical-quantum computing device comprises a Noisy Intermediate Scale Quantum (NISQ) device. ### Claim 11 (depends on 10) The computer usable program product of claim 10, wherein the first set of configurations of the quantum circuit each comprises a square quantum circuit, the square quantum circuit being suited for implementing on the NISQ device. ### Claim 12 (depends on 9) The computer usable program product of claim 9, wherein the goal state of the continuous parameter corresponds to a second difficulty level of the parametrized optimization problem higher than the first difficulty level, further comprising: program instructions to control, according to the values of the first set of increases in the continuous parameter, a pace at which to progress a difficulty level of the parametrized optimization problem. ### Claim 13 (depends on 12) The computer usable program product of claim 12, wherein the largest increase in the first set of increases comprises a difference between the goal state of the continuous parameter and the current state of the continuous parameter. ### Claim 14 (depends on 12) The computer usable program product of claim 12, wherein the largest increase in the first set of increases comprises a 1/n multiple of a difference between the goal state of the continuous parameter and the current state of the continuous parameter, where n is a positive whole number. ### Claim 15 (depends on 12) The computer usable program product of claim 12, wherein the first set of increases comprises a set of equally-spaced increases between the current state of the continuous parameter and the goal state of the continuous parameter. ### Claim 16 (depends on 12) The computer usable program product of claim 12, wherein the largest increase in first set of increases to a configuration of the quantum circuit that completed execution within an execution time period. ### Claim 17 (depends on 9) The computer usable program product of claim 9, wherein the computer usable code is stored in a computer readable storage device in a data processing system, and wherein the computer usable code is transferred over a network from a remote data processing system. ### Claim 18 (depends on 9) The computer usable program product of claim 9, wherein the computer usable code is stored in a computer readable storage device in a server data processing system, and wherein the computer usable code is downloaded over a network to a remote data processing system for use in a computer readable storage device associated with the remote data processing system, further comprising: program instructions to meter use of the computer usable code associated with a request; and program instructions to generate an invoice based on the metered use. ### Claim 19 A computer system comprising one or more processors, one or more computer-readable memories, and one or more computer-readable storage devices, and program instructions stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, the stored program instructions comprising: program instructions to generate a first set of increases from a current state of a continuous parameter, wherein the current state of the continuous parameter corresponds to a first difficulty level of a parametrized optimization problem; program instructions to generate a set of variational parameters corresponding to each of the first set of increases, each set of variational parameters specifying an executable configuration of a quantum circuit in a first set of configurations of the quantum circuit; program instructions to cause a hybrid classical-quantum computing device to execute each configuration in the first set of configurations and produce a corresponding first set of outputs; program instructions to conclude, from the first set of outputs, that a largest increase in the first set of increases is keeping the continuous parameter at or below a goal state; and program instructions to cause, responsive to the program instructions to conclude, the hybrid classical-quantum computing device to execute a second set of configurations of the quantum circuit, each configuration in the second set of configurations of the quantum circuit specified by a second set of variational parameters, each second set of variational parameters generated from an increase in a second set of increases in the continuous parameter from the current state of the continuous parameter. ### Claim 20 (depends on 19) The computer system of claim 19, wherein the hybrid classical-quantum computing device comprises a Noisy Intermediate Scale Quantum (NISQ) device. ### Claim 21 (depends on 20) The computer system of claim 20, wherein the first set of configurations of the quantum circuit each comprises a square quantum circuit, the square quantum circuit being suited for implementing on the NISQ device. ### Claim 22 (depends on 19) The computer system of claim 19, wherein the goal state of the continuous parameter corresponds to a second difficulty level of the parametrized optimization problem higher than the first difficulty level, further comprising: program instructions to control, according to the values of the first set of increases in the continuous parameter, a pace at which to progress a difficulty level of the parametrized optimization problem. ### Claim 23 (depends on 22) The computer system of claim 22, wherein the largest increase in the first set of increases comprises a difference between the goal state of the continuous parameter and the current state of the continuous parameter. ### Claim 24 (depends on 22) The computer system of claim 22, wherein the largest increase in the first set of increases comprises a 1/n multiple of a difference between the goal state of the continuous parameter and the current state of the continuous parameter, where n is a positive whole number. ### Claim 25 (depends on 22) The computer system of claim 22, wherein the first set of increases comprises a set of equally-spaced increases between the current state of the continuous parameter and the goal state of the continuous parameter.