CA3158858A1 - Constructing and programming quantum hardware for robust quantum annealing processes - Google Patents
Constructing and programming quantum hardware for robust quantum annealing processesInfo
- Publication number
- CA3158858A1 CA3158858A1 CA3158858A CA3158858A CA3158858A1 CA 3158858 A1 CA3158858 A1 CA 3158858A1 CA 3158858 A CA3158858 A CA 3158858A CA 3158858 A CA3158858 A CA 3158858A CA 3158858 A1 CA3158858 A1 CA 3158858A1
- Authority
- CA
- Canada
- Prior art keywords
- quantum
- energy
- hamiltonian
- average
- hqg
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 230000008569 process Effects 0.000 title abstract description 30
- 238000000137 annealing Methods 0.000 title abstract description 18
- 230000005283 ground state Effects 0.000 claims description 42
- 238000009826 distribution Methods 0.000 claims description 20
- 230000006870 function Effects 0.000 claims description 20
- 238000001228 spectrum Methods 0.000 claims description 18
- 230000005281 excited state Effects 0.000 claims description 12
- 230000005284 excitation Effects 0.000 claims description 10
- 238000010801 machine learning Methods 0.000 claims description 9
- 230000003595 spectral effect Effects 0.000 claims description 9
- 230000007704 transition Effects 0.000 claims description 9
- 238000005457 optimization Methods 0.000 claims description 8
- 230000008521 reorganization Effects 0.000 claims description 3
- 238000005290 field theory Methods 0.000 claims description 2
- 230000010365 information processing Effects 0.000 abstract description 2
- 230000003993 interaction Effects 0.000 description 17
- 238000012545 processing Methods 0.000 description 15
- 238000004590 computer program Methods 0.000 description 11
- 239000011159 matrix material Substances 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000003860 storage Methods 0.000 description 6
- 238000012549 training Methods 0.000 description 6
- 238000005315 distribution function Methods 0.000 description 5
- 230000004807 localization Effects 0.000 description 5
- 238000013473 artificial intelligence Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 4
- 238000010168 coupling process Methods 0.000 description 4
- 238000005859 coupling reaction Methods 0.000 description 4
- 239000002096 quantum dot Substances 0.000 description 4
- 230000001939 inductive effect Effects 0.000 description 3
- 238000011217 control strategy Methods 0.000 description 2
- 230000001419 dependent effect Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000007613 environmental effect Effects 0.000 description 2
- 230000008014 freezing Effects 0.000 description 2
- 238000007710 freezing Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000013515 script Methods 0.000 description 2
- 238000000926 separation method Methods 0.000 description 2
- VLCQZHSMCYCDJL-UHFFFAOYSA-N tribenuron methyl Chemical compound COC(=O)C1=CC=CC=C1S(=O)(=O)NC(=O)N(C)C1=NC(C)=NC(OC)=N1 VLCQZHSMCYCDJL-UHFFFAOYSA-N 0.000 description 2
- 241001459757 Juga Species 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 238000013528 artificial neural network Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 239000003990 capacitor Substances 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000002028 premature Effects 0.000 description 1
- 230000000644 propagated effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000002269 spontaneous effect Effects 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 239000000758 substrate Substances 0.000 description 1
- 230000036962 time dependent Effects 0.000 description 1
- 238000003325 tomography Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
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
- G06N10/60—Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
-
- 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
- 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
- G06N20/00—Machine learning
-
- 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
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)
- Medical Informatics (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Probability & Statistics with Applications (AREA)
- Superconductor Devices And Manufacturing Methods Thereof (AREA)
- Semiconductor Lasers (AREA)
- Semiconductor Memories (AREA)
- Recrystallisation Techniques (AREA)
- Logic Circuits (AREA)
Abstract
Methods, systems and apparatus for constructing and programming quantum annealing hardware for quantum annealing processes that can perform reliable information processing at non-zero temperatures is provided. There is provided an apparatus comprising quantum units with couplers among the quantum units. Each coupler being configured to couple a pair of quantum units such that a quantum Hamiltonian characterizing the quantum units and the couplers is defined. The quantum Hamiltonian includes quantum annealer Hamiltonian and a quantum governor Hamiltonian. The quantum annealer Hamiltonian includes infomiation bearing degrees of freedom. The quantum governor Hamiltonian includes non-information bearing degrees of freedom that are engineered to steer the dissipative dynamics of infomiation bearing degrees of freedom. Date Recue/Date Received 2022-05-12
Description
CONSTRUCTING AND PROGRAMMING QUANTUM HARDWARE FOR
ROBUST QUANTUM ANNEALING PROCESSES
This application is a divisional of Canadian Patent Application No. 2,936,112 filed December 31, 2014.
BACKGROUND
This specification relates to constructing and programming quantum hardware for quantum annealing processes that can perform reliable information processing at non-zero temperatures.
SUMMARY
Artificial intelligent tasks can be translated into machine learning optimization problems. To perform an artificial intelligence task, quantum hardware, e.g., a quantum processor, 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. For example, 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.
Sometimes the quantum adiabatic computation becomes non-adiabatic due to excitations caused, e.g., by thermal fluctuations. Instead of remaining at the instantaneous ground state, 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. In addition, the quantum hardware is also constructed and Date Recue/Date Received 2022-05-12 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.
The details of one or more embodiments of the subject matter of this specification are set forth in the accompanying drawings and the description below.
Other features, aspects, and advantages of the subject matter will be apparent from the description, the drawings, and the claims.
DESCRIPTION OF DRAWINGS
FIG. 1 is a schematic perspective view of a quantum annealing processor within a Chimera connectivity of interacting qubits.
FIG. 2 is a schematic diagram showing the structures and interactions of two qubits in a quantum processor, where the interactions include x-x and x-z interactions of a quantum governor.
FIG. 2A is a schematic diagram showing a Josephson box, including a Josephson junction and a capacitor.
FIG. 3 is a schematic diagram showing the effect of a quantum governor on transitions among instantaneous energy states during a quantum annealing process FIG. 4 is a schematic diagram showing the interplay of an initial Hamiltonian, a problem Hamiltonian, and a Hamiltonian of a quantum governor chosen for the problem Hamiltonian during a quantum annealing process.
FIG. 5 is a flow diagram of an example process for determining a quantum governor distribution.
FIG. 6 is a flow diagram of an example process for performing an artificial intelligence task.
DETAILED DESCRIPTION
Overview Solutions to hard combinatorial problems, e.g., NP-hard problems and machine learning problems, can be encoded in the ground state of a many-body quantum Hamiltonian system, which is also called a quantum annealer ("QA"). A
ROBUST QUANTUM ANNEALING PROCESSES
This application is a divisional of Canadian Patent Application No. 2,936,112 filed December 31, 2014.
BACKGROUND
This specification relates to constructing and programming quantum hardware for quantum annealing processes that can perform reliable information processing at non-zero temperatures.
SUMMARY
Artificial intelligent tasks can be translated into machine learning optimization problems. To perform an artificial intelligence task, quantum hardware, e.g., a quantum processor, 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. For example, 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.
Sometimes the quantum adiabatic computation becomes non-adiabatic due to excitations caused, e.g., by thermal fluctuations. Instead of remaining at the instantaneous ground state, 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. In addition, the quantum hardware is also constructed and Date Recue/Date Received 2022-05-12 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.
The details of one or more embodiments of the subject matter of this specification are set forth in the accompanying drawings and the description below.
Other features, aspects, and advantages of the subject matter will be apparent from the description, the drawings, and the claims.
DESCRIPTION OF DRAWINGS
FIG. 1 is a schematic perspective view of a quantum annealing processor within a Chimera connectivity of interacting qubits.
FIG. 2 is a schematic diagram showing the structures and interactions of two qubits in a quantum processor, where the interactions include x-x and x-z interactions of a quantum governor.
FIG. 2A is a schematic diagram showing a Josephson box, including a Josephson junction and a capacitor.
FIG. 3 is a schematic diagram showing the effect of a quantum governor on transitions among instantaneous energy states during a quantum annealing process FIG. 4 is a schematic diagram showing the interplay of an initial Hamiltonian, a problem Hamiltonian, and a Hamiltonian of a quantum governor chosen for the problem Hamiltonian during a quantum annealing process.
FIG. 5 is a flow diagram of an example process for determining a quantum governor distribution.
FIG. 6 is a flow diagram of an example process for performing an artificial intelligence task.
DETAILED DESCRIPTION
Overview Solutions to hard combinatorial problems, e.g., NP-hard problems and machine learning problems, can be encoded in the ground state of a many-body quantum Hamiltonian system, which is also called a quantum annealer ("QA"). A
2 Date Recue/Date Received 2022-05-12 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 H, that is a known and easy to prepare. Over time, the QA is adiabatically guided within the Hilbert space to a problem Hamiltonian Hp that encodes the problem.
In theory, during the adiabatic quantum computation, the QA can remain in the instantaneous ground state of a Hamiltonian Htotal evolving from Hi to Hp, where Htotal can be expressed as:
Htotal = (1-s)H1 + sHp , where s is a time dependent control parameter:
s=t/IT, and IT is the total time of the adiabatic quantum computation. The QA will reach the ground state of the problem Hamiltonian Hp with certainty, if the evolution of system is sufficiently slow with respect to the intrinsic energy scale of the system.
In reality, the quantum computation may not be completely adiabatic and the QA may reach an excited state of Htotal during the computation, which can lead to inaccurate result at the end of the quantum computation. For example, in many hard combinatorial optimization problems, e.g., in decision problems, when the problem Hamiltonian demonstrates a phase transition in its computational complexity, the size of a gap between an excited state and the ground state of Htotal can be small, e.g., exponentially small, with respect to the intrinsic energy scale of the system.
In such situations, the QA may undergo a quantum phase transition and can reach a large number, e.g., an exponentially large number, of excited states. In addition, the QA
may also deviate from the ground state of Htotal 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.
In this specification, the process of driving the QA from the ground state of Hi to the ground state of Hp 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 (1)G") in addition to H and Hp, such that the evolving Hamiltonian Htotal becomes H101:
H101= I(t)H, + G(t)HG + P(t) Hp + HAG-B,
In theory, during the adiabatic quantum computation, the QA can remain in the instantaneous ground state of a Hamiltonian Htotal evolving from Hi to Hp, where Htotal can be expressed as:
Htotal = (1-s)H1 + sHp , where s is a time dependent control parameter:
s=t/IT, and IT is the total time of the adiabatic quantum computation. The QA will reach the ground state of the problem Hamiltonian Hp with certainty, if the evolution of system is sufficiently slow with respect to the intrinsic energy scale of the system.
In reality, the quantum computation may not be completely adiabatic and the QA may reach an excited state of Htotal during the computation, which can lead to inaccurate result at the end of the quantum computation. For example, in many hard combinatorial optimization problems, e.g., in decision problems, when the problem Hamiltonian demonstrates a phase transition in its computational complexity, the size of a gap between an excited state and the ground state of Htotal can be small, e.g., exponentially small, with respect to the intrinsic energy scale of the system.
In such situations, the QA may undergo a quantum phase transition and can reach a large number, e.g., an exponentially large number, of excited states. In addition, the QA
may also deviate from the ground state of Htotal 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.
In this specification, the process of driving the QA from the ground state of Hi to the ground state of Hp 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 (1)G") in addition to H and Hp, such that the evolving Hamiltonian Htotal becomes H101:
H101= I(t)H, + G(t)HG + P(t) Hp + HAG-B,
3 Date Recue/Date Received 2022-05-12 where 1(0 and P(t) represent the time-dependency of the initial and problem Hamiltonians, H, and Hp, respectively; G(t) represents the time-dependency of the QG
Hamiltonian, HG; and HAG¨B is the interaction of the combined QA-QG system with its surrounding environment, commonly referred to as a bath. In a simplified example, 1(0 equals (1-s), P(t) equals s, G(t) equals s(/-s), and HAG¨B is assumed to be non-zero but constant during the quantum annealing process. The strength of1-14G-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.
Generally, 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. In the example of Htotai, 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. For example, the QG can facilitate driving the QA towards a quantum phase transition, while decoupling the QA from excited states of Htotai by making the excited states effectively inaccessible by 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.
Generally, 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. In the third and fourth stages, the QG can enhance thermal fluctuations by creating an overlap
Hamiltonian, HG; and HAG¨B is the interaction of the combined QA-QG system with its surrounding environment, commonly referred to as a bath. In a simplified example, 1(0 equals (1-s), P(t) equals s, G(t) equals s(/-s), and HAG¨B is assumed to be non-zero but constant during the quantum annealing process. The strength of1-14G-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.
Generally, 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. In the example of Htotai, 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. For example, the QG can facilitate driving the QA towards a quantum phase transition, while decoupling the QA from excited states of Htotai by making the excited states effectively inaccessible by 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.
Generally, 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. In the third and fourth stages, the QG can enhance thermal fluctuations by creating an overlap
4 Date Recue/Date Received 2022-05-12 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 Hp . In particular, 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. For example, 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.
Generally, the QG is problem-dependent. The quantum hardware of the specification can be programmed to provide different QGs for different classes of problem Hamiltonians. In some implementations, a QG can be determined for a given Hp using a quantum control strategy developed based on mean-field and microscopic approaches. In addition or alternatively, 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 Hp, such as Poisson, Levy, or Boltzmann distributions.
Example Quantum Hardware As shown in FIG. 1, in a quantum processor, a programmable quantum chip 100 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. In this example, each qubit is a superconducting qubit and includes two parallelly Date Recue/Date Received 2022-05-12 connected Josephson boxes 204a, 204b or 206a, 206b. Each Josephson box can include a Josephson junction and a capacitance connected in parallel. An example is shown in FIG. 2A, in which a Josephson box 218 includes a Josephson junction 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 0 . 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. Here x, y, and z are spin directions in Hilbert space, in which each direction is orthogonal to the other two directions.
Compared to one conventional quantum chip known in the art, 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. The Hamiltonian of the conventional quantum chip can be written as:
HSG = 1(1 JEUT P( where o-and o-izquantum operators that have binary values and each represents the spin of the ith qubit along the x direction or the z direction, respectively.
hi and J are parameters that can be programmed for different problems to be solved by adjusting the inductive coupler set 208. hi and J, have real values. The sparsity of the parameter is constrained by the hardware connectivity, i.e., the connectivity of the qubits shown in FIG. 1. For unconnected qubits, the corresponding J, is 0. Again, 1(t) and P(t) represent the time-dependency of initial and problem Hamiltonians, respectively.
In a simplified example, 1(t) equals (1-s), and P(t) equals s, where s equals 1/IT.
The additional coupler sets 210, 212 introduce additional quantum control mechanisms to the chip 100.
In general the control mechanisms of a QG acts within the same Hilbert space of the QA and include:
Date Recue/Date Received 2022-05-12 (i) Site dependent magnetic field on any spin, or quantum disorders, such as o-1, which is also binary and represents the spin of the ith qubit along the y direction;
(ii) Two-body quantum exchange interaction terms, e.g., o-ixot, that repre-sents coupling of the ith and jth qubits along the x-z directions;
(iii) A global time-varying control knob G(t), which can be s(1- s), where s = 1/IT; and (iv) A set of macroscopic, programmable control parameters of the environment, such as the temperature T.
Accordingly, the Hamiltonian Hioi for the combined QA-QG system in the chip 100 is:
H101¨
,Nr t Ei (-; E E E ) + E hiof ) sm1 i where Eiondenotes the QG induced disorders, the tensor ppm defines the general two-body interaction parameters that specify the QG, and 1(t), G(t), and P(t) are as described above. In this Hamiltonian, the initial Hamiltonian is:
Ecif Hi= , the problem Hamiltonian Hp is:
hio-T E
Hp=
and the QG Hamiltonian HQG is:
ist E E E õ ,un .= rf f, = =
' 3 HQG = "1Ã11,Y,z} ra,nÃ
Again, the total Hamiltonian is:
H101= (1-t/tT)Hi + t/tT(1-t/tT)HQG + (t/tT)Hp.
Programming the Quantum Hardware For a given problem and its corresponding problem Hamiltonian Hp, a QG is determined to improve the ground state fidelity of the QA. The QG can be determined Date Recue/Date Received 2022-05-12 without needing to diagonalize H. Various QG realizations can be repeated to statistically improve knowledge about the computational outcomes.
In some implementations, a QG is determined such that before a system characterized by Htotai experiences a quantum phase transition, the QG
Hamiltonian HQG acts to suppress excitations of the QA. In particular, 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 Motto reduce unwanted excitations. After the system undergoes the quantum phase transition, the QG Hamiltonian HQG acts to enhance relaxation of the QA
from any excited state to the ground state of 1-1101. In particular, the average energy level spacing of I-1101 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 I-1101 at a high relaxation rate and prevent the QA from being prematurely frozen at an excited state due to quantum localization.
An example of desirable QG functions is shown in FIG. 3. The energy levels Eo, El, E2, E, (not shown) of Htotai are plotted as a function of time t. At t = 0, Htotai is 1-11, and at t = IT, Htotai is H. During a quantum annealing process from t = 0 to t =
IT, the QA approximately experiences an initialization phase from t = 0 to t =
ti, an excitation phase from t = ti to t = /2, a relaxation phase from t = t2 to t =13, and a freezing phase from t =13 to t = IT. The time 12 can correspond to a time at which a quantum phase transition occurs in a system characterized by Htotai. During the excitation phase, the QG increases, as indicated by arrows 300, 302, the average energy spacing between adjacent energy levels Aei, such as Aei= E2-Ei and Aeo=
Ei-Eo, such that the increased energy spacing is much larger than the average phonon energy. During the relaxation phase, the QG adjusts the average energy spacing Aeo, ... 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, Hp, and HQG over time in different phases of the quantum annealing process is schematically shown in FIG. 4. The Date Recue/Date Received 2022-05-12 control parameters 1(0, P(t), and G(t) control the shapes of the curves for the corresponding Hamiltonians. In this example, 1(t) and P(t) are linear and G(t) is parabolic.
In addition, the QG can be chosen to allow the QA of 1/101 to steadily evolve over the QA schedule and reach a final state that has a maximum overlap with the ground state of H. Ideally, the ground state fidelity of the QA at time IT is 1.
However, unity fidelity is hard to achieve within a finite period of time.
Other than at time 0 and at time IT, the QA of 1/101 is in a mixed state of the combined Hp, Hi, and HQG. The evolution of the QA can be expressed as:
At i t) lot;) (41 where 1160/4 is the state of the QA at time 0, =0 is the state of the QA at time IT, and is the density function of the QA at other times. By assigning a probability, e.g., using a probability mass function, to each state =0. , the evolution of the QA can be further expressed as:
1E10.) (E4 roA(t).¨
where f G(k) is the probability mass function, k=0, 1, ..., and corresponds to quantum state levels, and a 1. If the ground state fidelity is 1, then f G(0) = 1, and f G (103) = 0. As described above, such a unity fidelity is hard to realize.
Instead, a desirable QG can be selected to provide an exponential distribution function as:
f G(c G) = P A(t G) E f() wherekG defines the distribution of a QG family suitable for use with H. The probability mass function can be any probability distribution function.
Examples include Poisson distribution functions, Levy distribution functions, and Boltzmann distribution functions.
To determine a QG with desirable functions for a problem, including those functions described above with reference to FIGS. 3 and 4, 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 Date Recue/Date Received 2022-05-12 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.
In the process 500, information about energy states of a known Htotal is obtained (502). In some implementations, 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. In particular, using the random matrix theory, approximate distributions of the energy levels E, of the i energy states, where i is 0, 1, 2, ..., a spontaneous energy spectrum, the spacings Ae, of the energy levels, and the average level spacing zi of the spacings can be obtained. In some implementations, the average energy level spacing AE is obtained using mean-field theories without explicitly diagonalizing Htotai. In some examples, path-integral Monte-Carlo is used for evaluating an approximate ground state energy of Htotai.
In some implementations, the average energy level spacing at time t is estimated as:
_____________ 2E,N71 __ (t)¨
t_t ¨1 ) where e(t) is the energy of the ith instantaneous eigenstate energy of Htotai, and N is the total number of eigenstates.
Also in the process 500, the average phonon energy of the bath in which the system characterized by Htotai is located is calculated (504). In approximation, 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. For example, 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. Under the open quantum system model, the average phonon energy of a bath, in which a system represented by Htotai is located, at any given temperature T can be defined as:
',`"Ljj(,))d,RewikT
=
E000 j(w)d,/(,,/kT
) , Date Recue/Date Received 2022-05-12 where J(w) can be the Omhic spectral density, i.e., AWC , the super-.
Omhic spectral density, i.e., J(co)= Aco'e , the Drude-Lorentz spectral density, i.e., 41-1-12 , or a flat spectral distribution, i.e., Acd) 1= In these equations, k is the reorganization energy and y is the bath frequency cut-off.
A probability mass function for the ground state fidelity of the QA is selected (506). In some implementations, the probability mass function is selected manually by a user. Based on the obtained information, the calculated average phonon energy, and the selected probability mass function, the process 500 then determines (508) a QG
distribution for H. In some implementations, the determination process can be at least partially performed by a user. For example, 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 Ag and the maximum and minimum energy eigenvalues of the QG or HQG are determined to allow the QG to function as desired. In particular, in the second phase of the QA
schedule, e.g., during time ti to 12 shown in FIG. 3, 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 A(g E) becomes:
A(g E)>>(.o.
This choice increases the energy level spacing of Mom] such that the combined energy level spacing of 1-1101 is much larger than the average phonon energy.
Accordingly, possible excitations of the QA to a higher energy state by thermal fluctuation are suppressed. In addition, the QG is also selected such that in the third phase of the QA
schedule, e.g., during time 12 to 13 shown in FIG. 3, the average energy level spacing of the QG leads to:
A(g E) 67) This choice allows the energy level spacing of Htotai to be similar to the thermal fluctuation. The QA can relax to a lower energy state or the ground state at a high Date Recue/Date Received 2022-05-12 rate. The selected exponential family can be parameterized with respect to the controllable parameters, such as the coupling between qubits, of the quantum hardware.
Alternatively or in addition, a machine learning system can be used to tune the control parameters of the QG distribution selected based on the random matrix theory model. In some implementations, a deep neural network is used to represent the QG-QA system or the system characterized by 11101, and stochastic gradient descent is used to train the QG distribution. As an example, the training is done by selecting a statistically meaningful number, e.g., 1000, of random matrices {ei.; gym,}
from a parameterized exponential family that can in average generate path-integral Monte-Carlo outputs, within the desired probability mass function for a given Htotai of interest. In some implementations, the training can start with an initial QG
distribution selected based on the desired average combined energy level spacing A (g + E) 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. In supervised training, 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 x2 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 1-1/0/.1. The encoding is based on structure of the QA hardware, such as the couplings between qubits. An example of Htotai is the Ising Hamiltonian HSG, and the encoding determines the values for the parameters hi Date Recue/Date Received 2022-05-12 and J,. The encoded information, such as hi and Jy, is provided to the QA
hardware, which receives (620) the information as initialization parameters for the hardware. To stabilize the QA during a quantum annealing process to be performed by the QA
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. In some implementations, 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 Eini and gym', , which are sent to the QA hardware to program the QA hardware.
The QA hardware receives (620) the initialization parameters, such as hi and Jy, and also receives (622) the control parameters for the QG, such as hiG , j1G,JuGA, 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 11101. The solution to the machine learning optimization problem is encoded in these eigenstates. After a predetermined amount of time, 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/(A (g + E))2. However, 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.
As described above, in the output provided by the QA hardware, the ground state fidelity of the QA is generally smaller than 1. When the fidelity is smaller than 1, the one-time output provided by the QA hardware may not accurately encode the solution to the problem. In some implementations, 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 eini and gy. , 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.
Date Recue/Date Received 2022-05-12 In particular, in the process 600, after the control system receives and stores (610) the output provided by the QA hardware, 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). If the QA hardware has completed the predetermined number of iterations of QA schedule, then 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. In some implementations, 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. For example, when the length of each QA schedule is relatively short, e.g., shorter than 1/(A (g + E))2 , the predetermined number of iterations can be chosen to be relatively large, e.g., 1000 iterations or more. In other situations when the length of each QA schedule is relatively long, e.g., longer than 1/(A (g + E))2, 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 Date Recue/Date Received 2022-05-12 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.
Alternatively or in addition, 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.
The term "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 Date Recue/Date Received 2022-05-12 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. 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 or actions.
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. Generally, 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. Generally, 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, Date Recue/Date Received 2022-05-12 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.
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.
While this specification contains many specific implementation details, these should not be construed as limitations on the scope of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments.
Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.
Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system modules and components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.
Date Recue/Date Received 2022-05-12 Particular embodiments of the subject matter have been described. Other embodiments are within the scope of the following claims. For example, the actions recited in the claims can be performed in a different order and still achieve desirable results. As one example, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some cases, multitasking and parallel processing may be advantageous.
Date Recue/Date Received 2022-05-12
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. For example, 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.
Generally, the QG is problem-dependent. The quantum hardware of the specification can be programmed to provide different QGs for different classes of problem Hamiltonians. In some implementations, a QG can be determined for a given Hp using a quantum control strategy developed based on mean-field and microscopic approaches. In addition or alternatively, 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 Hp, such as Poisson, Levy, or Boltzmann distributions.
Example Quantum Hardware As shown in FIG. 1, in a quantum processor, a programmable quantum chip 100 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. In this example, each qubit is a superconducting qubit and includes two parallelly Date Recue/Date Received 2022-05-12 connected Josephson boxes 204a, 204b or 206a, 206b. Each Josephson box can include a Josephson junction and a capacitance connected in parallel. An example is shown in FIG. 2A, in which a Josephson box 218 includes a Josephson junction 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 0 . 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. Here x, y, and z are spin directions in Hilbert space, in which each direction is orthogonal to the other two directions.
Compared to one conventional quantum chip known in the art, 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. The Hamiltonian of the conventional quantum chip can be written as:
HSG = 1(1 JEUT P( where o-and o-izquantum operators that have binary values and each represents the spin of the ith qubit along the x direction or the z direction, respectively.
hi and J are parameters that can be programmed for different problems to be solved by adjusting the inductive coupler set 208. hi and J, have real values. The sparsity of the parameter is constrained by the hardware connectivity, i.e., the connectivity of the qubits shown in FIG. 1. For unconnected qubits, the corresponding J, is 0. Again, 1(t) and P(t) represent the time-dependency of initial and problem Hamiltonians, respectively.
In a simplified example, 1(t) equals (1-s), and P(t) equals s, where s equals 1/IT.
The additional coupler sets 210, 212 introduce additional quantum control mechanisms to the chip 100.
In general the control mechanisms of a QG acts within the same Hilbert space of the QA and include:
Date Recue/Date Received 2022-05-12 (i) Site dependent magnetic field on any spin, or quantum disorders, such as o-1, which is also binary and represents the spin of the ith qubit along the y direction;
(ii) Two-body quantum exchange interaction terms, e.g., o-ixot, that repre-sents coupling of the ith and jth qubits along the x-z directions;
(iii) A global time-varying control knob G(t), which can be s(1- s), where s = 1/IT; and (iv) A set of macroscopic, programmable control parameters of the environment, such as the temperature T.
Accordingly, the Hamiltonian Hioi for the combined QA-QG system in the chip 100 is:
H101¨
,Nr t Ei (-; E E E ) + E hiof ) sm1 i where Eiondenotes the QG induced disorders, the tensor ppm defines the general two-body interaction parameters that specify the QG, and 1(t), G(t), and P(t) are as described above. In this Hamiltonian, the initial Hamiltonian is:
Ecif Hi= , the problem Hamiltonian Hp is:
hio-T E
Hp=
and the QG Hamiltonian HQG is:
ist E E E õ ,un .= rf f, = =
' 3 HQG = "1Ã11,Y,z} ra,nÃ
Again, the total Hamiltonian is:
H101= (1-t/tT)Hi + t/tT(1-t/tT)HQG + (t/tT)Hp.
Programming the Quantum Hardware For a given problem and its corresponding problem Hamiltonian Hp, a QG is determined to improve the ground state fidelity of the QA. The QG can be determined Date Recue/Date Received 2022-05-12 without needing to diagonalize H. Various QG realizations can be repeated to statistically improve knowledge about the computational outcomes.
In some implementations, a QG is determined such that before a system characterized by Htotai experiences a quantum phase transition, the QG
Hamiltonian HQG acts to suppress excitations of the QA. In particular, 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 Motto reduce unwanted excitations. After the system undergoes the quantum phase transition, the QG Hamiltonian HQG acts to enhance relaxation of the QA
from any excited state to the ground state of 1-1101. In particular, the average energy level spacing of I-1101 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 I-1101 at a high relaxation rate and prevent the QA from being prematurely frozen at an excited state due to quantum localization.
An example of desirable QG functions is shown in FIG. 3. The energy levels Eo, El, E2, E, (not shown) of Htotai are plotted as a function of time t. At t = 0, Htotai is 1-11, and at t = IT, Htotai is H. During a quantum annealing process from t = 0 to t =
IT, the QA approximately experiences an initialization phase from t = 0 to t =
ti, an excitation phase from t = ti to t = /2, a relaxation phase from t = t2 to t =13, and a freezing phase from t =13 to t = IT. The time 12 can correspond to a time at which a quantum phase transition occurs in a system characterized by Htotai. During the excitation phase, the QG increases, as indicated by arrows 300, 302, the average energy spacing between adjacent energy levels Aei, such as Aei= E2-Ei and Aeo=
Ei-Eo, such that the increased energy spacing is much larger than the average phonon energy. During the relaxation phase, the QG adjusts the average energy spacing Aeo, ... 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, Hp, and HQG over time in different phases of the quantum annealing process is schematically shown in FIG. 4. The Date Recue/Date Received 2022-05-12 control parameters 1(0, P(t), and G(t) control the shapes of the curves for the corresponding Hamiltonians. In this example, 1(t) and P(t) are linear and G(t) is parabolic.
In addition, the QG can be chosen to allow the QA of 1/101 to steadily evolve over the QA schedule and reach a final state that has a maximum overlap with the ground state of H. Ideally, the ground state fidelity of the QA at time IT is 1.
However, unity fidelity is hard to achieve within a finite period of time.
Other than at time 0 and at time IT, the QA of 1/101 is in a mixed state of the combined Hp, Hi, and HQG. The evolution of the QA can be expressed as:
At i t) lot;) (41 where 1160/4 is the state of the QA at time 0, =0 is the state of the QA at time IT, and is the density function of the QA at other times. By assigning a probability, e.g., using a probability mass function, to each state =0. , the evolution of the QA can be further expressed as:
1E10.) (E4 roA(t).¨
where f G(k) is the probability mass function, k=0, 1, ..., and corresponds to quantum state levels, and a 1. If the ground state fidelity is 1, then f G(0) = 1, and f G (103) = 0. As described above, such a unity fidelity is hard to realize.
Instead, a desirable QG can be selected to provide an exponential distribution function as:
f G(c G) = P A(t G) E f() wherekG defines the distribution of a QG family suitable for use with H. The probability mass function can be any probability distribution function.
Examples include Poisson distribution functions, Levy distribution functions, and Boltzmann distribution functions.
To determine a QG with desirable functions for a problem, including those functions described above with reference to FIGS. 3 and 4, 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 Date Recue/Date Received 2022-05-12 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.
In the process 500, information about energy states of a known Htotal is obtained (502). In some implementations, 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. In particular, using the random matrix theory, approximate distributions of the energy levels E, of the i energy states, where i is 0, 1, 2, ..., a spontaneous energy spectrum, the spacings Ae, of the energy levels, and the average level spacing zi of the spacings can be obtained. In some implementations, the average energy level spacing AE is obtained using mean-field theories without explicitly diagonalizing Htotai. In some examples, path-integral Monte-Carlo is used for evaluating an approximate ground state energy of Htotai.
In some implementations, the average energy level spacing at time t is estimated as:
_____________ 2E,N71 __ (t)¨
t_t ¨1 ) where e(t) is the energy of the ith instantaneous eigenstate energy of Htotai, and N is the total number of eigenstates.
Also in the process 500, the average phonon energy of the bath in which the system characterized by Htotai is located is calculated (504). In approximation, 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. For example, 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. Under the open quantum system model, the average phonon energy of a bath, in which a system represented by Htotai is located, at any given temperature T can be defined as:
',`"Ljj(,))d,RewikT
=
E000 j(w)d,/(,,/kT
) , Date Recue/Date Received 2022-05-12 where J(w) can be the Omhic spectral density, i.e., AWC , the super-.
Omhic spectral density, i.e., J(co)= Aco'e , the Drude-Lorentz spectral density, i.e., 41-1-12 , or a flat spectral distribution, i.e., Acd) 1= In these equations, k is the reorganization energy and y is the bath frequency cut-off.
A probability mass function for the ground state fidelity of the QA is selected (506). In some implementations, the probability mass function is selected manually by a user. Based on the obtained information, the calculated average phonon energy, and the selected probability mass function, the process 500 then determines (508) a QG
distribution for H. In some implementations, the determination process can be at least partially performed by a user. For example, 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 Ag and the maximum and minimum energy eigenvalues of the QG or HQG are determined to allow the QG to function as desired. In particular, in the second phase of the QA
schedule, e.g., during time ti to 12 shown in FIG. 3, 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 A(g E) becomes:
A(g E)>>(.o.
This choice increases the energy level spacing of Mom] such that the combined energy level spacing of 1-1101 is much larger than the average phonon energy.
Accordingly, possible excitations of the QA to a higher energy state by thermal fluctuation are suppressed. In addition, the QG is also selected such that in the third phase of the QA
schedule, e.g., during time 12 to 13 shown in FIG. 3, the average energy level spacing of the QG leads to:
A(g E) 67) This choice allows the energy level spacing of Htotai to be similar to the thermal fluctuation. The QA can relax to a lower energy state or the ground state at a high Date Recue/Date Received 2022-05-12 rate. The selected exponential family can be parameterized with respect to the controllable parameters, such as the coupling between qubits, of the quantum hardware.
Alternatively or in addition, a machine learning system can be used to tune the control parameters of the QG distribution selected based on the random matrix theory model. In some implementations, a deep neural network is used to represent the QG-QA system or the system characterized by 11101, and stochastic gradient descent is used to train the QG distribution. As an example, the training is done by selecting a statistically meaningful number, e.g., 1000, of random matrices {ei.; gym,}
from a parameterized exponential family that can in average generate path-integral Monte-Carlo outputs, within the desired probability mass function for a given Htotai of interest. In some implementations, the training can start with an initial QG
distribution selected based on the desired average combined energy level spacing A (g + E) 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. In supervised training, 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 x2 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 1-1/0/.1. The encoding is based on structure of the QA hardware, such as the couplings between qubits. An example of Htotai is the Ising Hamiltonian HSG, and the encoding determines the values for the parameters hi Date Recue/Date Received 2022-05-12 and J,. The encoded information, such as hi and Jy, is provided to the QA
hardware, which receives (620) the information as initialization parameters for the hardware. To stabilize the QA during a quantum annealing process to be performed by the QA
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. In some implementations, 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 Eini and gym', , which are sent to the QA hardware to program the QA hardware.
The QA hardware receives (620) the initialization parameters, such as hi and Jy, and also receives (622) the control parameters for the QG, such as hiG , j1G,JuGA, 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 11101. The solution to the machine learning optimization problem is encoded in these eigenstates. After a predetermined amount of time, 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/(A (g + E))2. However, 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.
As described above, in the output provided by the QA hardware, the ground state fidelity of the QA is generally smaller than 1. When the fidelity is smaller than 1, the one-time output provided by the QA hardware may not accurately encode the solution to the problem. In some implementations, 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 eini and gy. , 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.
Date Recue/Date Received 2022-05-12 In particular, in the process 600, after the control system receives and stores (610) the output provided by the QA hardware, 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). If the QA hardware has completed the predetermined number of iterations of QA schedule, then 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. In some implementations, 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. For example, when the length of each QA schedule is relatively short, e.g., shorter than 1/(A (g + E))2 , the predetermined number of iterations can be chosen to be relatively large, e.g., 1000 iterations or more. In other situations when the length of each QA schedule is relatively long, e.g., longer than 1/(A (g + E))2, 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 Date Recue/Date Received 2022-05-12 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.
Alternatively or in addition, 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.
The term "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 Date Recue/Date Received 2022-05-12 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. 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 or actions.
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. Generally, 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. Generally, 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, Date Recue/Date Received 2022-05-12 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.
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.
While this specification contains many specific implementation details, these should not be construed as limitations on the scope of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments.
Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.
Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system modules and components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.
Date Recue/Date Received 2022-05-12 Particular embodiments of the subject matter have been described. Other embodiments are within the scope of the following claims. For example, the actions recited in the claims can be performed in a different order and still achieve desirable results. As one example, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some cases, multitasking and parallel processing may be advantageous.
Date Recue/Date Received 2022-05-12
Claims (11)
1. A method comprising:
deriving, by one or more processors, data characterizing an energy spectrum of a Hamiltonian Htotal that characterizes controllable quantum states of a quantum processor, wherein the quantum processor is controllable such that the Hamiltonian Htotal evolves from an initial Hamiltonian H, to a problem Hamiltonian Hp comprising an energy spectrum that encodes a solution to a machine learning optimization problem, and a quantum state of the quantum processor evolves from a ground state of H, towards a ground state of Hp as Htotal evolves from H, to Hp, the deriving being based on a combination of H, and Hp at a time that Htotaihas the energy spectrum;
estimating, based on reorganization energy and frequency of a bath in which the quantum processor is located and by the one or more processors, an average phonon energy of the bath; and determining, by the one or more processors, an additional quantum Hamiltonian HQG based on the derived data characterizing the energy spectrum of //total and the estimated average phonon energy, such that when combined with Htotal, HQG
limits evolution of the quantum state into the ground state of Hp when Htotal evolves to Hp without diagonalizing H.
deriving, by one or more processors, data characterizing an energy spectrum of a Hamiltonian Htotal that characterizes controllable quantum states of a quantum processor, wherein the quantum processor is controllable such that the Hamiltonian Htotal evolves from an initial Hamiltonian H, to a problem Hamiltonian Hp comprising an energy spectrum that encodes a solution to a machine learning optimization problem, and a quantum state of the quantum processor evolves from a ground state of H, towards a ground state of Hp as Htotal evolves from H, to Hp, the deriving being based on a combination of H, and Hp at a time that Htotaihas the energy spectrum;
estimating, based on reorganization energy and frequency of a bath in which the quantum processor is located and by the one or more processors, an average phonon energy of the bath; and determining, by the one or more processors, an additional quantum Hamiltonian HQG based on the derived data characterizing the energy spectrum of //total and the estimated average phonon energy, such that when combined with Htotal, HQG
limits evolution of the quantum state into the ground state of Hp when Htotal evolves to Hp without diagonalizing H.
2. The method of claim 1, comprising recording a selected probability mass function for a probability of the quantum state being in the ground state of Hp when Htotal evolves to Hp, and HQG is determined also based on the selected probability mass function and using the selected probability mass function in determining the additional quantum Hamiltonian.
Date Recue/Date Received 2022-05-12
Date Recue/Date Received 2022-05-12
3. The method of claim 1, wherein the energy spectrum is obtained at approximately half time of a total time for Htotai to evolve from H, to H.
4. The method of claim 1, wherein deriving the data characterizing the energy spectrum of Htotai comprises evaluating ground state energy of Htotai using quantum Monte-Carlo techniques, mean-field theories, or Markus theory.
5. The method of claim 4, wherein deriving the data characterizing the energy spectrum information about an energy spectrum of Htotai comprises deriving data characterizing the energy spectrum information about an energy spectrum of Htotai the data at a time of a quantum phase transition.
6. The method of claim 1, wherein the infomiation about an energy spectrum comprises actual energy levels, spacing among the actual energy levels, distribution of the spacing among the actual energy levels, or an average spacing between adjacent average energy levels.
7. The method of claim 1, wherein calculating the average phonon energy of the bath comprises calculating the average phonon energy using an open quantum systems model.
8. The method of claim 7, wherein the average phonon energy satisfies the following equation:
where J(w) is one of an Omhic spectral density:
Date Recue/Date Received 2022-05-12 and a flat spectral distribution: Aco) = 1, X, is a reorganization energy, and y is a bath frequency cut-off.
where J(w) is one of an Omhic spectral density:
Date Recue/Date Received 2022-05-12 and a flat spectral distribution: Aco) = 1, X, is a reorganization energy, and y is a bath frequency cut-off.
9. The method of claim 1, wherein determining an additional quantum Hamiltonian HQG comprises selecting an exponential family of random matrices to represent a distribution of HQG and determining control parameters for the selected exponential family of random matrices.
10. The method of claim 1, wherein determining an additional quantum Hamiltonian HQG comprises determining HQG such that during the evolution of the Hamiltonian Htotal and the time the Hamiltonian Htotathas the energy spectrum, excitations of the quantum state from a ground state of Htotatto an excited state of //total is suppressed, and after the time, the quantum state relaxes from an excited state of Htotalto the ground state of Htotal.
11. The method of claim 10, wherein HQG is determined such that, before the time, [MG
an average spacing between energy levels of HQG and an average spacing <DIG>
between energy levels of Htotai in combination are much larger than an average phonon energylivIC of the bath, and after the time, the average spacing Ag between the energy Date Recue/Date Received 2022-05-12 E
levels of HQG and the average spacinviGg between energy levels of H;otai in combination are similar to the average phonon energyzniG=of the bath.
an average spacing between energy levels of HQG and an average spacing <DIG>
between energy levels of Htotai in combination are much larger than an average phonon energylivIC of the bath, and after the time, the average spacing Ag between the energy Date Recue/Date Received 2022-05-12 E
levels of HQG and the average spacinviGg between energy levels of H;otai in combination are similar to the average phonon energyzniG=of the bath.
Applications Claiming Priority (5)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US201461924207P | 2014-01-06 | 2014-01-06 | |
| US61/924,207 | 2014-01-06 | ||
| US201461985348P | 2014-04-28 | 2014-04-28 | |
| US61/985,348 | 2014-04-28 | ||
| CA2936112A CA2936112C (en) | 2014-01-06 | 2014-12-31 | Constructing and programming quantum hardware for robust quantum annealing processes |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA2936112A Division CA2936112C (en) | 2014-01-06 | 2014-12-31 | Constructing and programming quantum hardware for robust quantum annealing processes |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA3158858A1 true CA3158858A1 (en) | 2015-07-09 |
Family
ID=53494011
Family Applications (6)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA3189038A Pending CA3189038A1 (en) | 2014-01-06 | 2014-12-31 | Constructing and programming quantum hardware for quantum annealing processes |
| CA2936114A Active CA2936114C (en) | 2014-01-06 | 2014-12-31 | Constructing and programming quantum hardware for quantum annealing processes |
| CA3158858A Pending CA3158858A1 (en) | 2014-01-06 | 2014-12-31 | Constructing and programming quantum hardware for robust quantum annealing processes |
| CA3158864A Pending CA3158864A1 (en) | 2014-01-06 | 2014-12-31 | Constructing and programming quantum hardware for robust quantum annealing processes |
| CA3189028A Pending CA3189028A1 (en) | 2014-01-06 | 2014-12-31 | Constructing and programming quantum hardware for quantum annealing processes |
| CA2936112A Active CA2936112C (en) | 2014-01-06 | 2014-12-31 | Constructing and programming quantum hardware for robust quantum annealing processes |
Family Applications Before (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA3189038A Pending CA3189038A1 (en) | 2014-01-06 | 2014-12-31 | Constructing and programming quantum hardware for quantum annealing processes |
| CA2936114A Active CA2936114C (en) | 2014-01-06 | 2014-12-31 | Constructing and programming quantum hardware for quantum annealing processes |
Family Applications After (3)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA3158864A Pending CA3158864A1 (en) | 2014-01-06 | 2014-12-31 | Constructing and programming quantum hardware for robust quantum annealing processes |
| CA3189028A Pending CA3189028A1 (en) | 2014-01-06 | 2014-12-31 | Constructing and programming quantum hardware for quantum annealing processes |
| CA2936112A Active CA2936112C (en) | 2014-01-06 | 2014-12-31 | Constructing and programming quantum hardware for robust quantum annealing processes |
Country Status (8)
| Country | Link |
|---|---|
| US (13) | US10346760B2 (en) |
| EP (4) | EP4033416A1 (en) |
| JP (5) | JP6574199B2 (en) |
| CN (3) | CN105960650B (en) |
| AU (9) | AU2014373698B2 (en) |
| CA (6) | CA3189038A1 (en) |
| SG (5) | SG11201605499SA (en) |
| WO (2) | WO2015103375A1 (en) |
Families Citing this family (74)
| 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 |
| WO2008122128A1 (en) | 2007-04-05 | 2008-10-16 | D-Wave Systems Inc. | Physical realizations of a universal adiabatic quantum computer |
| US10037493B2 (en) | 2013-10-22 | 2018-07-31 | D-Wave Systems Inc. | Universal adiabatic quantum computing with superconducting qubits |
| SG11201605499SA (en) | 2014-01-06 | 2016-08-30 | Google Inc | Constructing and programming quantum hardware for quantum annealing processes |
| 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 (en) | 2015-02-03 | 2016-03-15 | 1Qb Information Technologies Inc. | Method and system for solving lagrangian dual of a constrained binary quadratic programming problem |
| JP2018513452A (en) | 2015-02-27 | 2018-05-24 | イェール ユニバーシティーＹａｌｅ Ｕｎｉｖｅｒｓｉｔｙ | Techniques and related systems and methods for universal quantum control of quantum coherent states |
| US11263546B2 (en) * | 2015-07-24 | 2022-03-01 | Yale University | Techniques of oscillator state manipulation for quantum information processing and related systems and methods |
| JP6833817B2 (en) * | 2015-08-13 | 2021-02-24 | ディー−ウェイブ システムズ インコーポレイテッド | Systems and methods for generating and using higher-order interactions between quantum devices |
| US10187065B2 (en) | 2015-11-17 | 2019-01-22 | Massachusetts Institute Of Technology | Four spin couplers for quantum information processing |
| US10275718B2 (en) | 2015-11-17 | 2019-04-30 | Massachusetts Institute Of Technology | Paramagnetic tree coupling of spin qubits |
| US10283693B2 (en) | 2015-11-17 | 2019-05-07 | Massachusetts Institute Of Technology | Multiloop interferometers for quantum information processing |
| US10360088B2 (en) * | 2015-11-20 | 2019-07-23 | Quantum Benchmark, Inc. | Randomized compiling for quantum computation |
| CN108701263B (en) | 2015-12-30 | 2022-06-24 | 谷歌有限责任公司 | Apparatus for coupling qubits and method for training quantum processors to solve machine learning inference problem |
| WO2017117016A1 (en) | 2015-12-30 | 2017-07-06 | Google Inc. | Enhancing simulated annealing with quantum annealing |
| EP3427196B1 (en) * | 2016-03-11 | 2021-12-22 | 1QB Information Technologies Inc. | Methods and systems for quantum computing |
| CA3210815A1 (en) * | 2016-05-17 | 2017-11-23 | Google Llc | Fidelity estimation for quantum computing systems |
| JP6915110B2 (en) * | 2016-05-17 | 2021-08-04 | グーグル エルエルシーＧｏｏｇｌｅ ＬＬＣ | Fidelity estimation for quantum computing systems |
| 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 (en) * | 2016-06-08 | 2023-08-15 | D-波系统公司 | System and method for quantum computing |
| JP6723439B2 (en) * | 2016-08-26 | 2020-07-15 | １キュービー インフォメーション テクノロジーズ インコーポレイテッド１Ｑｂ Ｉｎｆｏｒｍａｔｉｏｎ Ｔｅｃｈｎｏｌｏｇｉｅｓ Ｉｎｃ． | Method and system for performing real-time analytics on multiple data streams |
| JP2018067200A (en) * | 2016-10-20 | 2018-04-26 | 国立大学法人京都大学 | Simulation device, computer program, and simulation method |
| 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 (en) | 2017-03-10 | 2018-09-13 | Rigetti & Co, Inc. | Performing a calibration process in a quantum computing system |
| JP6918980B2 (en) * | 2017-05-15 | 2021-08-11 | グーグル エルエルシーＧｏｏｇｌｅ ＬＬＣ | Operator averaging in quantum computing systems |
| US10977570B2 (en) * | 2017-06-19 | 2021-04-13 | Rigetti & Co, Inc. | Distributed quantum computing system |
| WO2019005206A1 (en) * | 2017-06-26 | 2019-01-03 | Google Llc | Nonlinear calibration of a quantum computing apparatus |
| 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 |
| CN111788588A (en) | 2017-12-20 | 2020-10-16 | D-波系统公司 | System and method for coupling qubits in a quantum processor |
| CA3087247A1 (en) * | 2017-12-29 | 2019-07-04 | Google Llc | Inhomogeneous quantum annealing schedules |
| JP7372681B2 (en) | 2018-01-05 | 2023-11-01 | イェール ユニバーシティー | Error-robust quantum logic gates |
| US11108380B2 (en) | 2018-01-11 | 2021-08-31 | Northrop Grumman Systems Corporation | Capacitively-driven tunable coupling |
| CN111989686B (en) * | 2018-01-22 | 2023-12-29 | D-波系统公司 | System and method for improving performance of analog processor |
| 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 |
| WO2020037301A1 (en) * | 2018-08-17 | 2020-02-20 | Zapata Computing, Inc. | Hybrid quantum-classical computer system and method for performing function inversion |
| CA3107549A1 (en) * | 2018-08-21 | 2020-02-27 | President And Fellows Of Harvard College | Quantum circuit embedding by simulated annealing |
| US11050009B2 (en) | 2018-08-28 | 2021-06-29 | International Business Machines Corporation | Methods for annealing qubits with an antenna chip |
| US10475983B1 (en) | 2018-08-28 | 2019-11-12 | International Business Machines Corporation | Antenna-based qubit annealing method |
| US10510943B1 (en) | 2018-08-28 | 2019-12-17 | International Business Machines Corporation | Structure for an antenna chip for qubit annealing |
| WO2020047444A1 (en) * | 2018-08-31 | 2020-03-05 | President And Fellows Of Harvard College | Quantum computing for combinatorial optimization problems using programmable atom arrays |
| JP6856592B2 (en) * | 2018-09-12 | 2021-04-07 | 株式会社東芝 | Electronic circuits and arithmetic units |
| EP3876167A4 (en) * | 2018-11-04 | 2022-08-10 | Qunasys Inc. | Method for determining hamiltonian excitation state and program therefor |
| 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 (en) * | 2019-04-17 | 2019-08-13 | 上海大学 | A kind of insulation shortcut method of high-fidelity population inversion in two-level energy system |
| US11537928B2 (en) | 2019-05-03 | 2022-12-27 | Zapata Computing, Inc. | Quantum-classical system and method for matrix computations |
| CN110045613B (en) * | 2019-05-13 | 2020-09-22 | 北京邮电大学 | Mixed integer optimal control numerical solution method based on quantum annealing |
| WO2020255076A1 (en) | 2019-06-19 | 2020-12-24 | 1Qb Information Technologies Inc. | Method and system for mapping a dataset from a hilbert space of a given dimension to a hilbert space of a different dimension |
| JP7171520B2 (en) | 2019-07-09 | 2022-11-15 | 株式会社日立製作所 | machine learning system |
| US11537381B2 (en) | 2019-07-15 | 2022-12-27 | International Business Machines Corporation | Quantum software developer kit and framework |
| CN112651508B (en) * | 2020-01-10 | 2022-04-15 | 腾讯科技（深圳）有限公司 | Prediction method, device, equipment and storage medium of adiabatic evolution path |
| WO2021144922A1 (en) * | 2020-01-16 | 2021-07-22 | 国立研究開発法人産業技術総合研究所 | Quantum computing element |
| JP2022167926A (en) * | 2020-02-13 | 2022-11-04 | グーグル エルエルシー | Fidelity Estimation for Quantum Computing Systems |
| WO2022204266A1 (en) | 2021-03-23 | 2022-09-29 | Zapata Computing, Inc. | Classically-boosted quantum optimization |
| EP4334854A2 (en) * | 2021-05-07 | 2024-03-13 | KBR Wyle Services, LLC | System and method using multilayer optical lattice qubit arrays for quantum computing |
| CN114326494A (en) * | 2021-12-21 | 2022-04-12 | 华东计算技术研究所（中国电子科技集团公司第三十二研究所） | Quantum measurement and control system and method of superconducting quantum computer |
| TWI824578B (en) * | 2022-01-24 | 2023-12-01 | 旺宏電子股份有限公司 | Semiconductor circuit and operating method for the same |
| 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)
| 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 |
| US7418283B2 (en) * | 2004-03-29 | 2008-08-26 | 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 (en) | 2009-06-17 | 2010-12-23 | D-Wave Systems Inc. | Systems and methods for solving computational problems |
| CN101375302B (en) | 2006-01-27 | 2012-03-28 | D-波系统公司 | Methods of adiabatic quantum computation |
| WO2008006217A1 (en) * | 2006-07-14 | 2008-01-17 | D-Wave Systems Inc. | Systems, methods, and apparatus for quasi-adiabatic quantum computation |
| JP5313912B2 (en) * | 2006-12-05 | 2013-10-09 | ディー−ウェイブ システムズ，インコーポレイテッド | System, method 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 |
| EP2223374A4 (en) | 2007-12-11 | 2014-01-22 | Utc Power Corp | Tailoring liquid water permeability of diffusion layers in fuel cell stacks |
| WO2009120638A2 (en) * | 2008-03-24 | 2009-10-01 | D-Wave Systems Inc. | Systems, devices, and methods for analog processing |
| US9015215B2 (en) * | 2008-05-20 | 2015-04-21 | D-Wave Systems, Inc. | Systems, methods, and apparatus for calibrating, controlling, and operating a quantum processor |
| 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 (en) | 2008-06-10 | 2009-12-17 | D-Wave Systems Inc. | Parameter learning system for solvers |
| 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 |
| WO2010151581A2 (en) * | 2009-06-26 | 2010-12-29 | D-Wave Systems Inc. | Systems and methods for quantum computation using real physical hardware |
| WO2012082938A2 (en) * | 2010-12-14 | 2012-06-21 | President And Fellows Of Harvard College | Scalable room temperature quantum information processor |
| JP5669069B2 (en) * | 2011-08-24 | 2015-02-12 | 日本電信電話株式会社 | Quantum state generation method, quantum state generation apparatus, and program |
| 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 |
| SG11201605499SA (en) | 2014-01-06 | 2016-08-30 | Google Inc | Constructing and programming quantum hardware for quantum annealing processes |
| CA3128586C (en) * | 2014-01-21 | 2023-12-19 | Masoud MOHSENI | Quantum hardware characterized by programmable bose-hubbard hamiltonians |
| GB2524039A (en) * | 2014-03-12 | 2015-09-16 | Nokia Technologies Oy | Method and apparatus for adiabatic quantum annealing |
| US10002107B2 (en) * | 2014-03-12 | 2018-06-19 | D-Wave Systems Inc. | Systems and methods for removing unwanted interactions in quantum devices |
| US10250271B2 (en) * | 2015-10-07 | 2019-04-02 | Kabushiki Kaisha Toshiba | Quantum computation apparatus and quantum computation method |
| CA2968830C (en) * | 2017-05-29 | 2024-04-02 | Socpra Sciences Et Genie S.E.C. | Quantum processor, and method of quantum processing |
-
2014
- 2014-12-31 SG SG11201605499SA patent/SG11201605499SA/en unknown
- 2014-12-31 CA CA3189038A patent/CA3189038A1/en active Pending
- 2014-12-31 EP EP22162517.1A patent/EP4033416A1/en active Pending
- 2014-12-31 CA CA2936114A patent/CA2936114C/en active Active
- 2014-12-31 CN CN201480074980.8A patent/CN105960650B/en active Active
- 2014-12-31 CA CA3158858A patent/CA3158858A1/en active Pending
- 2014-12-31 CN CN202010705398.4A patent/CN112016690A/en active Pending
- 2014-12-31 US US15/109,614 patent/US10346760B2/en active Active
- 2014-12-31 JP JP2016562458A patent/JP6574199B2/en active Active
- 2014-12-31 SG SG10202006553XA patent/SG10202006553XA/en unknown
- 2014-12-31 JP JP2016562459A patent/JP6576949B2/en active Active
- 2014-12-31 AU AU2014373698A patent/AU2014373698B2/en active Active
- 2014-12-31 AU AU2014373701A patent/AU2014373701C1/en active Active
- 2014-12-31 EP EP14876158.8A patent/EP3092607B1/en active Active
- 2014-12-31 CA CA3158864A patent/CA3158864A1/en active Pending
- 2014-12-31 SG SG10201706473SA patent/SG10201706473SA/en unknown
- 2014-12-31 WO PCT/US2014/072962 patent/WO2015103375A1/en active Application Filing
- 2014-12-31 SG SG11201605503VA patent/SG11201605503VA/en unknown
- 2014-12-31 CA CA3189028A patent/CA3189028A1/en active Pending
- 2014-12-31 EP EP22179379.7A patent/EP4099233A1/en active Pending
- 2014-12-31 SG SG10201706475TA patent/SG10201706475TA/en unknown
- 2014-12-31 EP EP14876050.7A patent/EP3092716B1/en active Active
- 2014-12-31 CA CA2936112A patent/CA2936112C/en active Active
- 2014-12-31 CN CN201480074978.0A patent/CN106031041B/en active Active
- 2014-12-31 WO PCT/US2014/072959 patent/WO2015103372A1/en active Application Filing
- 2014-12-31 US US15/109,600 patent/US9934468B2/en active Active
-
2018
- 2018-03-07 US US15/914,689 patent/US10510015B2/en active Active
-
2019
- 2019-03-04 AU AU2019201469A patent/AU2019201469B2/en active Active
- 2019-06-24 US US16/450,461 patent/US10614372B2/en active Active
- 2019-06-26 US US16/453,477 patent/US10713584B2/en active Active
- 2019-08-20 JP JP2019150457A patent/JP7004691B2/en active Active
- 2019-11-13 US US16/683,149 patent/US10755194B2/en active Active
- 2019-12-16 AU AU2019283774A patent/AU2019283774B2/en active Active
-
2020
- 2020-04-06 US US16/841,251 patent/US10915832B2/en active Active
- 2020-04-20 US US16/853,463 patent/US10789541B2/en active Active
- 2020-08-19 US US16/997,673 patent/US10922619B2/en active Active
- 2020-12-02 AU AU2020281055A patent/AU2020281055B2/en active Active
- 2020-12-08 US US17/115,493 patent/US11288588B2/en active Active
-
2021
- 2021-01-14 US US17/149,407 patent/US20210224680A1/en active Pending
- 2021-09-01 AU AU2021225194A patent/AU2021225194B2/en active Active
- 2021-12-28 JP JP2021214391A patent/JP7263502B2/en active Active
-
2022
- 2022-01-14 AU AU2022200224A patent/AU2022200224B2/en active Active
- 2022-03-28 US US17/706,158 patent/US11809963B2/en active Active
-
2023
- 2023-03-02 AU AU2023201299A patent/AU2023201299B2/en active Active
- 2023-04-11 JP JP2023064372A patent/JP2023098988A/en active Pending
- 2023-07-27 AU AU2023208179A patent/AU2023208179A1/en active Pending
- 2023-10-10 US US18/484,233 patent/US20240037431A1/en active Pending
Also Published As
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10915832B2 (en) | Constructing and programming quantum hardware for robust quantum annealing processes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request |
Effective date: 20220512 |
|
| EEER | Examination request |
Effective date: 20220512 |
|
| EEER | Examination request |
Effective date: 20220512 |
|
| EEER | Examination request |
Effective date: 20220512 |
|
| EEER | Examination request |
Effective date: 20220512 |
|
| EEER | Examination request |
Effective date: 20220512 |
|
| EEER | Examination request |
Effective date: 20220512 |
|
| EEER | Examination request |
Effective date: 20220512 |