EP4033416A1 - Construction et programmation de matériel quantique pour des processus de recuit quantique robustes - Google Patents

Construction et programmation de matériel quantique pour des processus de recuit quantique robustes Download PDF

Info

Publication number
EP4033416A1
EP4033416A1 EP22162517.1A EP22162517A EP4033416A1 EP 4033416 A1 EP4033416 A1 EP 4033416A1 EP 22162517 A EP22162517 A EP 22162517A EP 4033416 A1 EP4033416 A1 EP 4033416A1
Authority
EP
European Patent Office
Prior art keywords
quantum
total
state
quantum processor
hamiltonian
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
EP22162517.1A
Other languages
German (de)
English (en)
Inventor
Masoud MOHSENI
Hartmut Neven
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Google LLC
Original Assignee
Google LLC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Google LLC filed Critical Google LLC
Publication of EP4033416A1 publication Critical patent/EP4033416A1/fr
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
    • G06N10/60—Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/76—Architectures of general purpose stored program computers
    • G06F15/82—Architectures of general purpose stored program computers data or demand driven
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
    • G06N10/20—Models of quantum computing, e.g. quantum circuits or universal quantum computers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N7/00—Computing arrangements based on specific mathematical models
    • G06N7/01—Probabilistic graphical models, e.g. probabilistic networks
    • H—ELECTRICITY
    • H10—SEMICONDUCTOR DEVICES; ELECTRIC SOLID-STATE DEVICES NOT OTHERWISE PROVIDED FOR
    • H10N—ELECTRIC SOLID-STATE DEVICES NOT OTHERWISE PROVIDED FOR
    • H10N60/00—Superconducting devices
    • H10N60/10—Junction-based devices
    • H10N60/12—Josephson-effect devices
    • H—ELECTRICITY
    • H10—SEMICONDUCTOR DEVICES; ELECTRIC SOLID-STATE DEVICES NOT OTHERWISE PROVIDED FOR
    • H10N—ELECTRIC SOLID-STATE DEVICES NOT OTHERWISE PROVIDED FOR
    • H10N60/00—Superconducting devices
    • H10N60/10—Junction-based devices
    • H10N60/128—Junction-based devices having three or more electrodes, e.g. transistor-like structures
    • H—ELECTRICITY
    • H10—SEMICONDUCTOR DEVICES; ELECTRIC SOLID-STATE DEVICES NOT OTHERWISE PROVIDED FOR
    • H10N—ELECTRIC SOLID-STATE DEVICES NOT OTHERWISE PROVIDED FOR
    • H10N60/00—Superconducting devices
    • H10N60/80—Constructional details
    • H10N60/805—Constructional details for Josephson-effect devices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
    • G06N10/40—Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N20/00—Machine learning

Definitions

  • This specification relates to constructing and programming quantum hardware for quantum annealing processes that can perform reliable information processing at non-zero temperatures.
  • quantum hardware e.g., a quantum processor
  • quantum hardware is constructed and programmed to encode the solution to a corresponding machine optimization problem into an energy spectrum of a many-body quantum Hamiltonian characterizing the quantum hardware.
  • the solution is encoded in the ground state of the Hamiltonian.
  • the quantum hardware performs adiabatic quantum computation starting with a known ground state of a known initial Hamiltonian. Over time, as the known initial Hamiltonian evolves into the Hamiltonian for solving the problem, the known ground state evolves and remains at the instantaneous ground state of the evolving Hamiltonian. The energy spectrum or the ground state of the Hamiltonian for solving the problem is obtained at the end of the evolution without diagonalizing the Hamiltonian.
  • the quantum adiabatic computation becomes non-adiabatic due to excitations caused, e.g., by thermal fluctuations.
  • the evolving quantum state initially started at the ground state of the initial Hamiltonian can reach an excited state of the evolving Hamiltonian.
  • the quantum hardware is constructed and programmed to suppress such excitations from an instantaneous ground state to a higher energy state during an early stage of the computation.
  • the quantum hardware is also constructed and programmed to assist relaxation from higher energy states to lower energy states or the ground state during a later stage of the computation. The robustness of finding the ground state of the Hamiltonian for solving the problem is improved.
  • Solutions to hard combinatorial problems can be encoded in the ground state of a many-body quantum Hamiltonian system, which is also called a quantum annealer ("QA").
  • a quantum annealing process at zero temperature limit is known as adiabatic quantum computation, in which the QA is initialized to a ground state of an initial Hamiltonian Hi that is a known and easy to prepare. Over time, the QA is adiabatically guided within the Hilbert space to a problem Hamiltonian H p that encodes the problem.
  • H total 1 ⁇ s H i + sH p
  • t T is the total time of the adiabatic quantum computation.
  • the quantum computation may not be completely adiabatic and the QA may reach an excited state of H total during the computation, which can lead to inaccurate result at the end of the quantum computation.
  • the size of a gap between an excited state and the ground state of H total can be small, e.g., exponentially small, with respect to the intrinsic energy scale of the system.
  • the QA may undergo a quantum phase transition and can reach a large number, e.g., an exponentially large number, of excited states.
  • the QA may also deviate from the ground state of H total due to other factors such as quantum fluctuations induced by environmental interactions with the system and system imperfection errors, including control errors and fabrication imperfections.
  • the process of driving the QA from the ground state of H i to the ground state of H p is called a quantum annealing schedule or a quantum annealing process.
  • Quantum hardware such as quantum processors, of this specification includes a quantum chip that defines a quantum governor ("QG") in addition to H i and H p , such that the evolving Hamiltonian H total becomes H tot :
  • QG quantum governor
  • H tot I t H i + G t H G + P t H p + H AG ⁇ B
  • I(t) and P(t) represent the time-dependency of the initial and problem Hamiltonians, H i and H p , respectively
  • G(t) represents the time-dependency of the QG Hamiltonian, H G ;
  • H AG-B is the interaction of the combined QA-QG system with its surrounding environment, commonly referred to as a bath.
  • H AG-B is assumed to be non-zero but constant during the quantum annealing process.
  • the strength of H AG-B is related to spectral density of bath modes that can often be characterized off-line by a combination of experimental and theoretical quantum estimation/tomography techniques.
  • the QG can be considered as a class of non-information-bearing degrees of freedom that can be engineered to steer the dissipative dynamics of an information-bearing degree of freedom.
  • the information-bearing degree of freedom is the QA.
  • the quantum hardware is constructed and programmed to allow the QG to navigate the quantum evolution of a disordered quantum annealing hardware at finite temperature in a robust manner and improve the adiabatic quantum computation process.
  • the QG can facilitate driving the QA towards a quantum phase transition, while decoupling the QA from excited states of H total by making the excited states effectively inaccessible by the QA.
  • the QA After the quantum phase transition, the QA enters another phase in which the QA is likely to be frozen in excited states due to quantum localization or Anderson localization.
  • the QG can adjust the energy level of the QA to be in tune with vibrational energies of the environment to facilitate the QA to relax into a lower energy state or the ground state. Such an adjustment can increase the ground state fidelity, i.e., the fidelity of the QA being in the ground state at the end of the computation, and allow the QA to avoid a pre-mature freeze in suboptimal solutions due to quantum localization.
  • the QA experiences four phases in a quantum annealing process of the specification, including initialization, excitation, relaxation, and freezing, which are explained in more detailed below.
  • the QG can assist the QA in the first two phases by creating a mismatch between average phonon energy of the bath and an average energy level spacing of the QA to suppress unwanted excitations.
  • the QG can enhance thermal fluctuations by creating an overlap between the spectral densities of the QA and the bath.
  • the enhanced thermal fluctuations can allow the QA to have high relaxation rates from higher energy states to lower energy states or the ground state of the problem Hamiltonian H p .
  • the QG can allow the QA to defreeze from non-ground states caused by quantum localization.
  • the QG can be used to achieve universal adiabatic quantum computing when quantum interactions are limited due to either natural or engineered constraints of the quantum hardware.
  • a quantum chip can have engineering constraints such that the Hamiltonian representing the interactions of qubits on the quantum chip is a k-local stochastic Hamiltonian.
  • the quantum hardware can be constructed and programmed to manipulate the structural and dynamical effects of environmental interactions and disorders, even without any control over the degrees of freedom of the environment.
  • the QG is problem-dependent.
  • the quantum hardware of the specification can be programmed to provide different QGs for different classes of problem Hamiltonians.
  • a QG can be determined for a given H p using a quantum control strategy developed based on mean-field and microscopic approaches.
  • the quantum control strategy can also implement random matrix theory and machine learning techniques in determining the QG.
  • the combined QA and QG can be tuned and trained to generate desired statistical distributions of energy spectra for H p , such as Poisson, Levy, or Boltzmann distributions.
  • a programmable quantum chip 100 in a quantum processor, includes 4 by 4 unit cells 102 of eight qubits 104, connected by programmable inductive couplers as shown by lines connecting different qubits. Each line may represent one or multiple couplers between a pair of qubits.
  • the chip 100 can also include a larger number of unit cells 102, e.g., 8 by 8 or more.
  • FIG. 2 shows an example pair of coupled qubits 200, 202 in the same unit cell of a chip, such as any pair of qubits in the unit cell 102 of the quantum chip 100.
  • each qubit is a superconducting qubit and includes two parallelly connected Josephson boxes 204a, 204b or 206a, 206b.
  • Each Josephson box can include a Josephson junction and a capacitance connected in parallel.
  • FIG. 2A An example is shown in FIG. 2A , in which a Josephson box 218 includes a Josephson junction 220 parallelly connected to a capacitance 222.
  • the qubits 200, 202 are subject to an external magnetic field B applied along a z direction perpendicular to the surface of the paper on which the figure is shown; the B field is labeled by the symbol ⁇ .
  • Three sets of inductive couplers 208, 210, 212 are placed between the qubits 200, 202 such that the qubits are coupled via the z-z, x-z, and x-x spin interactions, where the z-z interactions represent the typical spin interactions of a QA, and the x-z, x-x interactions are auxiliary interactions representing the controllable degrees of freedom of a QG.
  • x, y, and z are spin directions in Hilbert space, in which each direction is orthogonal to the other two directions.
  • the qubits that are coupled along the z-z spin directions in the chip 100 of FIG. 1 are additionally coupled along the x-z spin directions and the x-x spin directions through the coupler sets 210, 212.
  • ⁇ i x and ⁇ i z quantum operators that have binary values and each represents the spin of the i th qubit along the x direction or the z direction, respectively.
  • h i and J ij are parameters that can be programmed for different problems to be solved by adjusting the inductive coupler set 208.
  • h i and J ij have real values.
  • the sparsity of the parameter J ij is constrained by the hardware connectivity, i.e., the connectivity of the qubits shown in FIG. 1 .
  • the corresponding J ij is 0.
  • I(t) and P(t) represent the time-dependency of initial and problem Hamiltonians, respectively. In a simplified example, I(t) equals (1- s ), and P(t) equals s, where s equals t / t T .
  • the additional coupler sets 210, 212 introduce additional quantum control mechanisms to the chip 100.
  • control mechanisms of a QG acts within the same Hilbert space of the QA and include:
  • H tot I t ⁇ i N ⁇ i x + G t ⁇ m ⁇ x y z ⁇ i N ⁇ i , m ⁇ i m + ⁇ m , n ⁇ x y z ⁇ i ⁇ j N g ijmn ⁇ i m ⁇ j n + P t ⁇ ⁇ i N h i ⁇ i z + ⁇ i N J ij ⁇ i z ⁇ j z
  • ⁇ i,m denotes the QG induced disorders
  • the tensor g ijmn defines the general two-body interaction parameters that specify the QG
  • I(t), G(t), and P(t) are as described above.
  • a QG is determined to improve the ground state fidelity of the QA.
  • the QG can be determined without needing to diagonalize H p .
  • Various QG realizations can be repeated to statistically improve knowledge about the computational outcomes.
  • a QG is determined such that before a system characterized by H total experiences a quantum phase transition, the QG Hamiltonian H QG acts to suppress excitations of the QA.
  • the QG is out of resonance with the average phonon energy of the bath, which creates a mismatch between the average phonon energy and average energy level spacing of the combined QA and QG, or H tot to reduce unwanted excitations.
  • the QG Hamiltonian H QG acts to enhance relaxation of the QA from any excited state to the ground state of H tot .
  • the average energy level spacing of H tot is in resonance with the average phonon energy.
  • the QG enhances thermal fluctuations by creating an overlap between the spectral densities of the system and its bath.
  • the thermal fluctuations can facilitate the QA to reach the ground state of H tot at a high relaxation rate and prevent the QA from being prematurely frozen at an excited state due to quantum localization.
  • FIG. 3 An example of desirable QG functions is shown in FIG. 3 .
  • the time t 2 can correspond to a time at which a quantum phase transition occurs in a system characterized by H total .
  • the QG adjusts the average energy spacing ⁇ 0 , ⁇ 1 , ... to be comparable to the average phone energy to facilitate relaxation of the QA from excited states to lower energy states or the ground state, as indicated by arrows 304, 306, 308, 310.
  • the interplay of the three Hamiltonians, H i , H p , and H QG over time in different phases of the quantum annealing process is schematically shown in FIG. 4 .
  • the control parameters I(t), P(t), and G(t) control the shapes of the curves for the corresponding Hamiltonians.
  • I(t) and P(t) are linear and G(t) is parabolic.
  • the QG can be chosen to allow the QA of H tot to steadily evolve over the QA schedule and reach a final state that has a maximum overlap with the ground state of H p .
  • the ground state fidelity of the QA at time t T is 1.
  • unity fidelity is hard to achieve within a finite period of time.
  • the QA of H tot is in a mixed state of the combined H p , H i , and H QG .
  • the evolution of the QA can be expressed as:
  • ⁇ 0 i ⁇ is the state of the QA at time t T
  • ⁇ A ( t ) is the density function of the QA at other times.
  • the evolution of the QA can be further expressed as:
  • f G ( k ) is the probability mass function
  • k 0, 1, ..., and corresponds to quantum state levels
  • the probability mass function can be any probability distribution function. Examples include Poisson distribution functions, Levy distribution functions, and Boltzmann distribution functions.
  • one or more techniques can be used, including, for example, open quantum system models, random matrix theory, and machine learning.
  • An example process 500 for determining a QG is shown in FIG. 5 , which can be performed by a classical processor, such as a classical computer, or a quantum processor, or a combination of them.
  • a QG is constructed using random matrix theory (RMT) and some predictions on general statistical properties of the combined QA-QG system can be made.
  • RMT random matrix theory
  • approximate distributions of the energy levels E i of the i energy states, where i is 0, 1, 2, ..., a spontaneous energy spectrum, the spacings ⁇ i of the energy levels, and the average level spacing ⁇ ⁇ of the spacings can be obtained.
  • the average energy level spacing ⁇ ⁇ is obtained using mean-field theories without explicitly diagonalizing H total .
  • path-integral Monte-Carlo is used for evaluating an approximate ground state energy of H total..
  • the average phonon energy of the bath in which the system characterized by H total is located is calculated (504).
  • the average phonon energy can be taken as kT, where k is the Boltzmann constant, and T is the temperature.
  • the average phonon energy can also be calculated in a more precise manner.
  • an open quantum system model of dynamics such as the Lindblad formalism, can be selected for the calculation. The selection can be based on calibration data of the quantum processor.
  • ⁇ is the reorganization energy and ⁇ is the bath frequency
  • a probability mass function for the ground state fidelity of the QA is selected (506).
  • the probability mass function is selected manually by a user.
  • the process 500 determines (508) a QG distribution for H p .
  • the determination process can be at least partially performed by a user.
  • the QG distribution can be represented by an exponential family, such as a Gaussian unitary ensemble, of random matrices selected using a random matrix theory model. The average energy level spacing ⁇ g and the maximum and minimum energy eigenvalues of the QG or H QG are determined to allow the QG to function as desired.
  • the average energy level spacing of the QG is chosen such that the chosen energy level spacing dominates the energy-level spacing of the problem Hamiltonian.
  • the chosen energy level spacing is also much bigger than the average energy of the phonon bath, e.g., by a factor of 5-10, such that the average energy level spacing of the combined QA and QG ⁇ ( g + ⁇ ) becomes: ⁇ g + ⁇ ⁇ > > ⁇ ⁇ .
  • This choice increases the energy level spacing of H total such that the combined energy level spacing of H tot is much larger than the average phonon energy.
  • the QG is also selected such that in the third phase of the QA schedule, e.g., during time t 2 to t 3 shown in FIG. 3 , the average energy level spacing of the QG leads to : ⁇ g + ⁇ ⁇ ⁇ ⁇ ⁇
  • This choice allows the energy level spacing of H total to be similar to the thermal fluctuation.
  • the QA can relax to a lower energy state or the ground state at a high rate.
  • the selected exponential family can be parameterized with respect to the controllable parameters, such as the coupling between qubits, of the quantum hardware.
  • a machine learning system can be used to tune the control parameters of the QG distribution selected based on the random matrix theory model.
  • a deep neural network is used to represent the QG-QA system or the system characterized by H tot , and stochastic gradient descent is used to train the QG distribution.
  • the training is done by selecting a statistically meaningful number, e.g., 1000, of random matrices ⁇ ⁇ im ; g ijm ⁇ from a parameterized exponential family that can in average generate path-integral Monte-Carlo outputs, within the desired probability mass function for a given H total of interest.
  • the training can start with an initial QG distribution selected based on the desired average combined energy level spacing ⁇ ( g + ⁇ ) discussed above.
  • the initial QG distribution can have predetermined probability distributions.
  • the training can be supervised training.
  • the implementation of the random matrix theory model can output a generative probability mass function.
  • label can be generated by finding the coupling coefficients of the QG such that the probability mass function generated by the QA and the QG has maximum overlap, e.g., within a given measure or figure of merit such as ⁇ 2 divergence, with an ideal probability mass function that is known in advance for the training set.
  • FIG. 6 shows an example process 600 in which a control system programs QA hardware, such as a quantum processor, for the QA hardware to perform an artificial intelligence task.
  • the control system includes one or more classical, i.e., non-quantum, computers, and may also include a quantum computer.
  • the task is translated into a machine learning optimization problem, which is represented in a machine-readable form.
  • the control system receives (602) the machine-readable machine learning optimization problem.
  • the control system encodes (606) the optimization problem into the energy spectrum of an engineered H total .
  • the encoding is based on structure of the QA hardware, such as the couplings between qubits.
  • An example of H total is the Ising Hamiltonian H SG , and the encoding determines the values for the parameters h i and Jij.
  • the encoded information, such as h i and I ij is provided to the QA hardware, which receives (620) the information as initialization parameters for the hardware.
  • the control system further devises (608) a QG, e.g., by selecting one QG from a QG distribution determined using the process 500 of FIG. 5 .
  • the selection can be random (pseudo) selection.
  • a user can select the QG from the QG distribution and input the selection to the control system.
  • the devised QG is characterized by control parameters including ⁇ im and g ijmn , which are sent to the QA hardware to program the QA hardware.
  • the QA hardware receives (620) the initialization parameters, such as h i and Jij, and also receives (622) the control parameters for the QG, such as h i G , J ij G , J ij GA , and is programmed and initialized by the control system according to the received initialization parameters and QG parameters.
  • the QA hardware implements (624) the quantum annealing schedule to obtain eigenstates of the combined QA-QG system characterized by H tot .
  • the solution to the machine learning optimization problem is encoded in these eigenstates.
  • the QA schedule ends and the QA hardware provides (626) an output represented by the eigenstates and their corresponding energy spectra.
  • the output can be read by the control system or by another classical computer or quantum computer.
  • the predetermined amount of time can be in the order of 1/( ⁇ ( g + ⁇ ) ) 2 .
  • shorter or longer periods of time can be used. A shorter time period may provide better quantum speedup, and a longer time period may provide a higher ground state fidelity.
  • the ground state fidelity of the QA is generally smaller than 1.
  • the QA hardware performs the QA schedule multiple times, using the same QG or different QGs provided by the control system that have different sets of control parameters, such as ⁇ im and g ijmn , selected from the same QG distribution determined for the problem, to provide multiple outputs.
  • the multiple outputs can be statistically analyzed and the problem or the artificial intelligence task can be resolved or performed based on the statistical results.
  • the control system determines (612) whether the QA hardware has completed the predetermined number of iterations of QA schedules. If not, then the control system returns to the step 608 by devising another QG, which can be the same as the previously used QG or a different QG selected from the previously determined QG distribution.
  • the QA hardware receives (622) another set of control parameters for the QG and is re-programmed by the control system based on this set of control parameters and the previously determined initialization parameters that encode the problem.
  • the QA schedule is implemented again (624) and another output is provided (626).
  • the control system or another data processing system statistically processes (614) all outputs to provide solutions to the problem. Solutions to a problem can be provided with a predetermined degree of certainty that has a sharply peaked PDF about an actual solution to the problem. The PDF can be peaked based on the statistical analysis.
  • the predetermined number of iterations can be 100 iterations or more, or 1000 iterations or more.
  • the number of iterations can be chosen in connection with the length of the QA schedule, so that the process 600 can be performed with high efficiency and provide solutions to the problems with high accuracy.
  • the predetermined number of iterations can be chosen to be relatively large, e.g., 1000 iterations or more.
  • the predetermined number of iterations can be chosen to be relatively small, e.g., less than 1000 iterations.
  • Embodiments of the digital, i.e., non-quantum, subject matter and the digital functional operations described in this specification can be implemented in digital electronic circuitry, in tangibly-embodied computer software or firmware, in computer hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them.
  • Embodiments of the digital subject matter described in this specification can be implemented as one or more computer programs, i.e., one or more modules of computer program instructions encoded on a tangible non-transitory storage medium for execution by, or to control the operation of, data processing apparatus.
  • the computer storage medium can be a machine-readable storage device, a machine-readable storage substrate, a random or serial access memory device, or a combination of one or more of them.
  • the program instructions can be encoded on an artificially-generated propagated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus for execution by a data processing apparatus.
  • data processing apparatus refers to digital data processing hardware and encompasses all kinds of apparatus, devices, and machines for processing data, including by way of example a programmable digital processor, a digital computer, or multiple digital processors or computers.
  • the apparatus can also be, or further include, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).
  • the apparatus can optionally include, in addition to hardware, code that creates an execution environment for computer programs, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them.
  • a computer program which may also be referred to or described as a program, software, a software application, a module, a software module, a script, or code, can be written in any form of programming language, including compiled or interpreted languages, or declarative or procedural languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a digital computing environment.
  • a computer program may, but need not, correspond to a file in a file system.
  • a program can be stored in a portion of a file that holds other programs or data, e.g., one or more scripts stored in a markup language document, in a single file dedicated to the program in question, or in multiple coordinated files, e.g., files that store one or more modules, sub-programs, or portions of code.
  • a computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a data communication network.
  • the processes and logic flows described in this specification can be performed by one or more programmable digital computers, operating with one or more quantum processors, as appropriate, executing one or more computer programs to perform functions by operating on input data and generating output.
  • the processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA or an ASIC, or by a combination of special purpose logic circuitry and one or more programmed computers.
  • special purpose logic circuitry e.g., an FPGA or an ASIC
  • special purpose logic circuitry e.g., an FPGA or an ASIC
  • For a system of one or more digital computers to be "configured to" perform particular operations or actions means that the system has installed on it software, firmware, hardware, or a combination of them that in operation cause the system to perform the operations or actions.
  • For one or more computer programs to be configured to perform particular operations or actions means that the one or more programs include instructions that, when executed by digital data processing apparatus, cause the apparatus to perform the operations
  • Digital computers suitable for the execution of a computer program can be based on general or special purpose microprocessors or both, or any other kind of central processing unit.
  • a central processing unit will receive instructions and data from a read-only memory or a random access memory or both.
  • the essential elements of a computer are a central processing unit for performing or executing instructions and one or more memory devices for storing instructions and data.
  • the central processing unit and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.
  • a digital computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. However, a computer need not have such devices.
  • Computer-readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks.
  • semiconductor memory devices e.g., EPROM, EEPROM, and flash memory devices
  • magnetic disks e.g., internal hard disks or removable disks
  • magneto-optical disks e.g., CD-ROM and DVD-ROM disks.
  • Control of the various systems described in this specification, or portions of them, can be implemented in a computer program product that includes instructions that are stored on one or more non-transitory machine-readable storage media, and that are executable on one or more digital processing devices.
  • the systems described in this specification, or portions of them, can each be implemented as an apparatus, method, or electronic system that may include one or more digital processing devices and memory to store executable instructions to perform the operations described in this specification.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Software Systems (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Evolutionary Computation (AREA)
  • Artificial Intelligence (AREA)
  • Computing Systems (AREA)
  • Condensed Matter Physics & Semiconductors (AREA)
  • Computer Hardware Design (AREA)
  • Algebra (AREA)
  • Operations Research (AREA)
  • Databases & Information Systems (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Medical Informatics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Superconductor Devices And Manufacturing Methods Thereof (AREA)
  • Semiconductor Lasers (AREA)
  • Logic Circuits (AREA)
  • Recrystallisation Techniques (AREA)
  • Semiconductor Memories (AREA)
EP22162517.1A 2014-01-06 2014-12-31 Construction et programmation de matériel quantique pour des processus de recuit quantique robustes Pending EP4033416A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US201461924207P 2014-01-06 2014-01-06
US201461985348P 2014-04-28 2014-04-28
PCT/US2014/072959 WO2015103372A1 (fr) 2014-01-06 2014-12-31 Construction et programmation de matériel quantique pour des processus de recuit quantique robustes
EP14876158.8A EP3092607B1 (fr) 2014-01-06 2014-12-31 Construction et programmation de matériel quantique pour des processus de recuit quantique robustes

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
EP14876158.8A Division EP3092607B1 (fr) 2014-01-06 2014-12-31 Construction et programmation de matériel quantique pour des processus de recuit quantique robustes

Publications (1)

Publication Number Publication Date
EP4033416A1 true EP4033416A1 (fr) 2022-07-27

Family

ID=53494011

Family Applications (4)

Application Number Title Priority Date Filing Date
EP14876050.7A Active EP3092716B1 (fr) 2014-01-06 2014-12-31 Construction et programmation d'un matériel quantique pour des procédés de recuit quantique
EP22179379.7A Pending EP4099233A1 (fr) 2014-01-06 2014-12-31 Construction et programmation d'un matériel quantique pour des procédés de recuit quantique
EP22162517.1A Pending EP4033416A1 (fr) 2014-01-06 2014-12-31 Construction et programmation de matériel quantique pour des processus de recuit quantique robustes
EP14876158.8A Active EP3092607B1 (fr) 2014-01-06 2014-12-31 Construction et programmation de matériel quantique pour des processus de recuit quantique robustes

Family Applications Before (2)

Application Number Title Priority Date Filing Date
EP14876050.7A Active EP3092716B1 (fr) 2014-01-06 2014-12-31 Construction et programmation d'un matériel quantique pour des procédés de recuit quantique
EP22179379.7A Pending EP4099233A1 (fr) 2014-01-06 2014-12-31 Construction et programmation d'un matériel quantique pour des procédés de recuit quantique

Family Applications After (1)

Application Number Title Priority Date Filing Date
EP14876158.8A Active EP3092607B1 (fr) 2014-01-06 2014-12-31 Construction et programmation de matériel quantique pour des processus de recuit quantique robustes

Country Status (8)

Country Link
US (13) US9934468B2 (fr)
EP (4) EP3092716B1 (fr)
JP (5) JP6574199B2 (fr)
CN (3) CN112016690A (fr)
AU (9) AU2014373698B2 (fr)
CA (6) CA3189038A1 (fr)
SG (5) SG10201706475TA (fr)
WO (2) WO2015103372A1 (fr)

Families Citing this family (74)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7533068B2 (en) 2004-12-23 2009-05-12 D-Wave Systems, Inc. Analog processor comprising quantum devices
WO2008122127A1 (fr) 2007-04-05 2008-10-16 D-Wave Systems Inc. Systèmes, procédés et appareil de couplage de bits quantiques antisymétrique
US10037493B2 (en) 2013-10-22 2018-07-31 D-Wave Systems Inc. Universal adiabatic quantum computing with superconducting qubits
CN112016690A (zh) * 2014-01-06 2020-12-01 谷歌有限责任公司 构建和编程用于量子退火过程的量子硬件
US10002107B2 (en) 2014-03-12 2018-06-19 D-Wave Systems Inc. Systems and methods for removing unwanted interactions in quantum devices
US11797641B2 (en) 2015-02-03 2023-10-24 1Qb Information Technologies Inc. Method and system for solving the lagrangian dual of a constrained binary quadratic programming problem using a quantum annealer
CA2881033C (fr) 2015-02-03 2016-03-15 1Qb Information Technologies Inc. Procede et systeme visant a resoudre le double lagrangien d'un probleme de programmation quadratique binaire contraint
KR20170124568A (ko) 2015-02-27 2017-11-10 예일 유니버시티 양자 결맞음 상태들의 보편적인 양자 제어 기술 및 관련 시스템 및 방법
JP6843336B2 (ja) * 2015-07-24 2021-03-17 イェール ユニバーシティーＹａｌｅ Ｕｎｉｖｅｒｓｉｔｙ 量子情報処理のための振動子状態操作の技術ならびに関連する系および方法
EP3335161B1 (fr) * 2015-08-13 2021-09-29 D-Wave Systems Inc. Systèmes et procédés de création et d'utilisation d'interactions de degré supérieur entre des dispositifs quantiques
WO2017087630A1 (fr) 2015-11-17 2017-05-26 Massachusetts Institute Of Technology Couplage paramagnétique en arborescence de bits quantiques de spin
US10187065B2 (en) 2015-11-17 2019-01-22 Massachusetts Institute Of Technology Four spin couplers for quantum information processing
WO2017087627A1 (fr) 2015-11-17 2017-05-26 Massachusetts Institute Of Technology Interféromètres à boucles multiples de traitement d'informations quantiques
US10360088B2 (en) * 2015-11-20 2019-07-23 Quantum Benchmark, Inc. Randomized compiling for quantum computation
CN108701263B (zh) * 2015-12-30 2022-06-24 谷歌有限责任公司 用于耦合量子比特的设备以及用于训练量子处理器以解决机器学习推断问题的方法
US11113620B2 (en) 2015-12-30 2021-09-07 Google Llc Enhancing simulated annealing with quantum annealing
WO2017152289A1 (fr) * 2016-03-11 2017-09-14 1Qb Information Technologies Inc. Procédés et systèmes d'informatique quantique
US11244240B2 (en) 2016-05-17 2022-02-08 Google Llc Fidelity estimation for quantum computing systems
JP6915110B2 (ja) * 2016-05-17 2021-08-04 グーグル エルエルシーＧｏｏｇｌｅ ＬＬＣ 量子コンピューティングシステムのための忠実度推定
US10044638B2 (en) 2016-05-26 2018-08-07 1Qb Information Technologies Inc. Methods and systems for quantum computing
US9870273B2 (en) 2016-06-13 2018-01-16 1Qb Information Technologies Inc. Methods and systems for quantum ready and quantum enabled computations
CN109716360B (zh) * 2016-06-08 2023-08-15 D-波系统公司 用于量子计算的系统和方法
US11100191B2 (en) 2016-08-26 2021-08-24 1Qb Information Technologies Inc. Method and system for performing real-time analytics on a plurality of data streams
JP2018067200A (ja) * 2016-10-20 2018-04-26 国立大学法人京都大学 シミュレーション装置、コンピュータプログラム及びシミュレーション方法
US11157828B2 (en) * 2016-12-08 2021-10-26 Microsoft Technology Licensing, Llc Tomography and generative data modeling via quantum boltzmann training
US11263547B2 (en) 2017-01-30 2022-03-01 D-Wave Systems Inc. Quantum annealing debugging systems and methods
US10255557B2 (en) 2017-02-15 2019-04-09 Northrop Grumman Systems Corporation XX Coupler for flux qubits
US10332024B2 (en) 2017-02-22 2019-06-25 Rigetti & Co, Inc. Modeling superconducting quantum circuit systems
US10074792B1 (en) 2017-03-10 2018-09-11 Northrop Grumman Systems Corporation ZZZ coupler for superconducting qubits
WO2018165500A1 (fr) 2017-03-10 2018-09-13 Rigetti & Co, Inc. Réalisation d'un processus d'étalonnage dans un système informatique quantique
CA3230733A1 (fr) * 2017-05-15 2018-11-22 Google Llc Etablissement de moyenne d'operateur dans des systemes informatiques quantiques
EP3642765A4 (fr) 2017-06-19 2021-04-07 Rigetti & Co., Inc. Système informatique quantique réparti
CN117689034A (zh) 2017-06-26 2024-03-12 谷歌有限责任公司 量子计算设备的非线性校准的方法、系统和设备
US11875222B1 (en) * 2017-09-18 2024-01-16 Rigetti & Co, Llc Maintaining calibration in a quantum computing system
US11494655B2 (en) * 2017-12-08 2022-11-08 International Business Machines Corporation Random matrix hardware for machine learning
WO2019126396A1 (fr) 2017-12-20 2019-06-27 D-Wave Systems Inc. Systèmes et procédés de couplage de bits quantiques dans un processeur quantique
US11809961B2 (en) 2017-12-29 2023-11-07 Google Llc Inhomogeneous quantum annealing schedules
US11451231B2 (en) 2018-01-05 2022-09-20 Yale University Robust quantum logical gates
US11108380B2 (en) 2018-01-11 2021-08-31 Northrop Grumman Systems Corporation Capacitively-driven tunable coupling
US20210085675A1 (en) * 2018-01-22 2021-03-25 Bioventures, Llc BCL-2 Proteins Degraders for Cancer Treatment
US10749096B2 (en) 2018-02-01 2020-08-18 Northrop Grumman Systems Corporation Controlling a state of a qubit assembly via tunable coupling
US11010145B1 (en) 2018-02-21 2021-05-18 Rigetti & Co, Inc. Retargetable compilation for quantum computing systems
US11334693B1 (en) 2018-03-07 2022-05-17 Keysight Technologies Canada Inc. Systems and methods for optimizing quantum computers
US10838792B1 (en) 2018-03-07 2020-11-17 Quantum Benchmark, Inc. Systems and methods for reconstructing noise from pauli fidelities
US11620561B2 (en) 2018-05-30 2023-04-04 Mark A. Novotny Method and system for a quantum oracle to obtain the number of quantum ground states
US10540603B2 (en) 2018-06-19 2020-01-21 Northrop Grumman Systems Corporation Reconfigurable quantum routing
US10852366B2 (en) 2018-06-26 2020-12-01 Northrop Grumman Systems Corporation Magnetic flux source system
US11568293B2 (en) 2018-07-18 2023-01-31 Accenture Global Solutions Limited Quantum formulation independent solver
CA3109604A1 (fr) 2018-08-17 2020-02-20 Zapata Computing, Inc. Systeme informatique hybride quantique-classique et procede de realisation d'inversion de fonction
WO2020041295A1 (fr) * 2018-08-21 2020-02-27 President And Fellows Of Harvard College Intégration de circuit quantique par recuit simulé
US10510943B1 (en) 2018-08-28 2019-12-17 International Business Machines Corporation Structure for an antenna chip for qubit annealing
US10475983B1 (en) 2018-08-28 2019-11-12 International Business Machines Corporation Antenna-based qubit annealing method
US11050009B2 (en) 2018-08-28 2021-06-29 International Business Machines Corporation Methods for annealing qubits with an antenna chip
JP7287705B2 (ja) * 2018-08-31 2023-06-06 プレジデント アンド フェローズ オブ ハーバード カレッジ プログラム可能原子アレイを使用した組合せ最適化問題のための量子コンピューター計算
JP6856592B2 (ja) * 2018-09-12 2021-04-07 株式会社東芝 電子回路及び計算装置
JP7391307B2 (ja) * 2018-11-04 2023-12-05 株式会社QunaSys ハミルトニアンの励起状態を求めるための方法、古典コンピュータ、量子コンピュータ、ハイブリッドシステム、及びプログラム
US10886049B2 (en) 2018-11-30 2021-01-05 Northrop Grumman Systems Corporation Coiled coupled-line hybrid coupler
US11650751B2 (en) 2018-12-18 2023-05-16 Hewlett Packard Enterprise Development Lp Adiabatic annealing scheme and system for edge computing
US11900264B2 (en) 2019-02-08 2024-02-13 D-Wave Systems Inc. Systems and methods for hybrid quantum-classical computing
US11488049B2 (en) 2019-04-09 2022-11-01 Zapata Computing, Inc. Hybrid quantum-classical computer system and method for optimization
CN110120799A (zh) * 2019-04-17 2019-08-13 上海大学 一种二能级系统中高保真布居数反转的绝热捷径方法
US11537928B2 (en) 2019-05-03 2022-12-27 Zapata Computing, Inc. Quantum-classical system and method for matrix computations
CN110045613B (zh) * 2019-05-13 2020-09-22 北京邮电大学 基于量子退火的混合整数最优控制数值求解方法
CA3126553A1 (fr) 2019-06-19 2020-12-24 1Qb Information Technologies Inc. Procede et systeme de mappage d'un ensemble de donnees d'un espace de hilbert d'une dimension donnee a un espace de hilbert d'une dimension differente
JP7171520B2 (ja) 2019-07-09 2022-11-15 株式会社日立製作所 機械学習システム
US11537381B2 (en) 2019-07-15 2022-12-27 International Business Machines Corporation Quantum software developer kit and framework
CN112651508B (zh) * 2020-01-10 2022-04-15 腾讯科技（深圳）有限公司 绝热演化路径的预测方法、装置、设备及存储介质
WO2021144922A1 (fr) * 2020-01-16 2021-07-22 国立研究開発法人産業技術総合研究所 Élément de calcul quantique
JP2022167926A (ja) * 2020-02-13 2022-11-04 グーグル エルエルシー 量子コンピューティングシステムのための忠実度推定
WO2022178623A1 (fr) 2021-02-25 2022-09-01 Gladiolus Veritatis Consulting Company Construction et programmation de graphiques de pilote dans un matériel quantique pour des procédés de recuit d'optimisation quantique non stoquastique
EP4315186A1 (fr) 2021-03-23 2024-02-07 Zapata Computing, Inc. Optimisation quantique amplifiée de manière classique
JP2024518457A (ja) * 2021-05-07 2024-05-01 ケービーアール ワイル サービシーズ エルエルシー 量子コンピューティングのための多層光格子量子ビット配列を用いたシステム及び方法
TWI824578B (zh) * 2022-01-24 2023-12-01 旺宏電子股份有限公司 半導體電路及其操作方法
US20230298101A1 (en) * 2022-03-02 2023-09-21 Jpmorgan Chase Bank, N.A. Systems and methods for quantum computing-assisted portfolio selection

Family Cites Families (28)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6979836B2 (en) 2001-08-29 2005-12-27 D-Wave Systems, Inc. Superconducting low inductance qubit
US7307275B2 (en) * 2002-04-04 2007-12-11 D-Wave Systems Inc. Encoding and error suppression for superconducting quantum computers
US6900454B2 (en) * 2002-04-20 2005-05-31 D-Wave Systems, Inc. Resonant controlled qubit system
AU2002950888A0 (en) * 2002-08-20 2002-09-12 Unisearch Limited Quantum device
US7135701B2 (en) * 2004-03-29 2006-11-14 D-Wave Systems Inc. Adiabatic quantum computation with superconducting qubits
US7639035B2 (en) * 2005-04-26 2009-12-29 D-Wave Systems, Inc. Qubit state copying
WO2010148120A2 (fr) 2009-06-17 2010-12-23 D-Wave Systems Inc. Systèmes et procédés de résolution de problèmes de calcul
US7788192B2 (en) * 2006-01-27 2010-08-31 D-Wave Systems Inc. Method for adiabatic quantum computing comprising of Hamiltonian scaling
WO2008006217A1 (fr) 2006-07-14 2008-01-17 D-Wave Systems Inc. Systèmes, procédés et appareil de calcul quantique quasi-adiabatique
AU2007329156B2 (en) 2006-12-05 2012-09-13 D-Wave Systems Inc. Systems, methods and apparatus for local programming of quantum processor elements
US7895142B2 (en) * 2007-09-27 2011-02-22 Siemens Aktiengesellschaft Method and apparatus for quantum adiabatic pattern recognition
JP5406207B2 (ja) 2007-12-11 2014-02-05 ユーティーシー パワー コーポレイション 燃料電池スタックの拡散層における液体水透過性の調整
US8421053B2 (en) * 2008-03-24 2013-04-16 D-Wave Systems Inc. Oubit based systems, devices, and methods for analog processing
JP5400872B2 (ja) 2008-05-20 2014-01-29 ディー−ウェイブ システムズ，インコーポレイテッド 量子プロセッサを較正し、制御し、動作させるためのシステム、方法および装置
US8229863B2 (en) * 2008-05-28 2012-07-24 D-Wave Systems Inc. Method and apparatus for evolving a quantum system using a mixed initial hamiltonian comprising both diagonal and off-diagonal terms
US7969178B2 (en) 2008-05-29 2011-06-28 Northrop Grumman Systems Corporation Method and apparatus for controlling qubits with single flux quantum logic
WO2009152180A2 (fr) 2008-06-10 2009-12-17 D-Wave Systems Inc. Système d'apprentissage de paramètres pour résolveurs
US20100258746A1 (en) * 2009-04-08 2010-10-14 Yun-Chung Na Massive parallel generation of nonclassical photons via polaritonic superfluid to mott- insulator quantum phase transition
US8494993B2 (en) * 2009-06-26 2013-07-23 D-Wave Systems Inc. Systems and methods for quantum computation using real physical hardware
WO2012082938A2 (fr) * 2010-12-14 2012-06-21 President And Fellows Of Harvard College Processeur évolutif d'information quantique à température ambiante
JP5669069B2 (ja) * 2011-08-24 2015-02-12 日本電信電話株式会社 量子状態生成方法、量子状態生成装置、及びプログラム
US9501747B2 (en) * 2012-12-18 2016-11-22 D-Wave Systems Inc. Systems and methods that formulate embeddings of problems for solving by a quantum processor
CN112016690A (zh) * 2014-01-06 2020-12-01 谷歌有限责任公司 构建和编程用于量子退火过程的量子硬件
CA2937324C (fr) * 2014-01-21 2022-09-27 Google Inc. Materiel quantique caracterise par des hamiltoniens de bose-hubbard programmables
US10002107B2 (en) * 2014-03-12 2018-06-19 D-Wave Systems Inc. Systems and methods for removing unwanted interactions in quantum devices
GB2524039A (en) * 2014-03-12 2015-09-16 Nokia Technologies Oy Method and apparatus for adiabatic quantum annealing
US10250271B2 (en) * 2015-10-07 2019-04-02 Kabushiki Kaisha Toshiba Quantum computation apparatus and quantum computation method
CA2968830C (fr) * 2017-05-29 2024-04-02 Socpra Sciences Et Genie S.E.C. Processeur quantique, et methode de traitement quantique

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
BOIXO SERGIO ET AL: "Evidence for quantum annealing with more than one hundred qubits", 2 July 2013 (2013-07-02), arXiv.org, pages 1 - 23, XP055930437, Retrieved from the Internet <URL:https://arxiv.org/pdf/1304.4595.pdf> [retrieved on 20220613] *
CONSTANTIN BRIF ET AL: "Exploring adiabatic quantum trajectories via optimal control", 13 October 2013 (2013-10-13), XP055388781, Retrieved from the Internet <URL:https://arxiv.org/pdf/1310.3443v1.pdf> [retrieved on 20170707] *

Also Published As

Publication number Publication date
CA2936114A1 (fr) 2015-07-09
WO2015103372A1 (fr) 2015-07-09
EP3092607A1 (fr) 2016-11-16
AU2020281055B2 (en) 2021-11-04
CN105960650B (zh) 2019-07-05
US9934468B2 (en) 2018-04-03
US20160328659A1 (en) 2016-11-10
US20190318259A1 (en) 2019-10-17
SG10201706473SA (en) 2017-09-28
AU2019283774A1 (en) 2020-01-16
US11288588B2 (en) 2022-03-29
CN105960650A (zh) 2016-09-21
WO2015103375A1 (fr) 2015-07-09
US20200242504A1 (en) 2020-07-30
AU2014373701A1 (en) 2016-07-21
AU2023208179A1 (en) 2023-08-17
US10915832B2 (en) 2021-02-09
SG10202006553XA (en) 2020-08-28
US20220215280A1 (en) 2022-07-07
AU2014373701B2 (en) 2018-12-13
AU2021225194B2 (en) 2023-04-27
JP2017507439A (ja) 2017-03-16
SG11201605503VA (en) 2016-08-30
US10510015B2 (en) 2019-12-17
JP2023098988A (ja) 2023-07-11
US20200234175A1 (en) 2020-07-23
JP2020010044A (ja) 2020-01-16
US20210117847A1 (en) 2021-04-22
US20240037431A1 (en) 2024-02-01
CN106031041B (zh) 2020-08-14
AU2020281055A1 (en) 2021-01-07
US20210004709A1 (en) 2021-01-07
US10789541B2 (en) 2020-09-29
AU2019201469A1 (en) 2019-03-28
AU2023201299A1 (en) 2023-04-13
EP3092607A4 (fr) 2017-08-16
SG10201706475TA (en) 2017-09-28
AU2022200224B2 (en) 2022-12-08
JP2017510005A (ja) 2017-04-06
US10713584B2 (en) 2020-07-14
US20200082292A1 (en) 2020-03-12
AU2014373698B2 (en) 2019-09-19
JP7004691B2 (ja) 2022-01-21
JP2022058462A (ja) 2022-04-12
US20160335560A1 (en) 2016-11-17
AU2022200224A1 (en) 2022-02-10
AU2023201299B2 (en) 2024-04-18
CA3158864A1 (fr) 2015-07-09
EP3092716A1 (fr) 2016-11-16
US20190311284A1 (en) 2019-10-10
AU2019201469B2 (en) 2020-11-26
AU2014373701C1 (en) 2019-06-20
US20180197102A1 (en) 2018-07-12
AU2021225194A1 (en) 2021-09-30
CN112016690A (zh) 2020-12-01
US10614372B2 (en) 2020-04-07
JP7263502B2 (ja) 2023-04-24
CA2936112A1 (fr) 2015-07-09
US10346760B2 (en) 2019-07-09
US20210224680A1 (en) 2021-07-22
US11809963B2 (en) 2023-11-07
US10922619B2 (en) 2021-02-16
SG11201605499SA (en) 2016-08-30
CN106031041A (zh) 2016-10-12
EP3092716A4 (fr) 2017-09-27
AU2019283774B2 (en) 2021-07-22
CA3189038A1 (fr) 2015-07-09
JP6576949B2 (ja) 2019-09-18
EP4099233A1 (fr) 2022-12-07
CA3158858A1 (fr) 2015-07-09
US10755194B2 (en) 2020-08-25
JP6574199B2 (ja) 2019-09-11
EP3092607B1 (fr) 2022-03-30
AU2014373698A1 (en) 2016-07-21
CA3189028A1 (fr) 2015-07-09
CA2936112C (fr) 2023-09-05
EP3092716B1 (fr) 2022-06-22
CA2936114C (fr) 2023-10-10

Similar Documents

Publication Publication Date Title
US10915832B2 (en) Constructing and programming quantum hardware for robust quantum annealing processes

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN PUBLISHED

AC Divisional application: reference to earlier application

Ref document number: 3092607

Country of ref document: EP

Kind code of ref document: P

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20230124

RBV Designated contracting states (corrected)

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20231220