EP3469523B1 - Automatic qubit calibration - Google Patents

Automatic qubit calibration Download PDF

Info

Publication number
EP3469523B1
EP3469523B1 EP16825954.7A EP16825954A EP3469523B1 EP 3469523 B1 EP3469523 B1 EP 3469523B1 EP 16825954 A EP16825954 A EP 16825954A EP 3469523 B1 EP3469523 B1 EP 3469523B1
Authority
EP
European Patent Office
Prior art keywords
qubit
parameter
parameters
calibration
node
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.)
Active
Application number
EP16825954.7A
Other languages
German (de)
English (en)
French (fr)
Other versions
EP3469523A1 (en
Inventor
Julian Shaw KELLY
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Google LLC
Original Assignee
Google LLC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Google LLC filed Critical Google LLC
Publication of EP3469523A1 publication Critical patent/EP3469523A1/en
Application granted granted Critical
Publication of EP3469523B1 publication Critical patent/EP3469523B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/22—Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing
    • G06F11/2205—Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing using arrangements specific to the hardware being tested
    • G06F11/2236—Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing using arrangements specific to the hardware being tested to test CPU or processors
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/22—Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing
    • G06F11/2247—Verification or detection of system hardware configuration
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/22—Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing
    • G06F11/2273—Test methods
    • 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
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
    • G06N10/70—Quantum error correction, detection or prevention, e.g. surface codes or magic state distillation

Definitions

  • This specification relates to quantum computing.
  • This specification relates to performing calibrations of qubit parameters.
  • this specification describes methods and apparatus for automatically maintaining and calibrating qubit parameters of a system of one or more qubits involved in a quantum computation.
  • one innovative aspect of the subject matter described in this specification can be implemented in a method that includes the actions of obtaining a plurality of qubit parameters and data describing dependencies of the plurality of qubit parameters on one or more other qubit parameters; identifying a qubit parameter; selecting a set of qubit parameters that includes the identified qubit parameter and one or more dependent qubit parameters; processing one or more parameters in the set of qubit parameters in sequence according to the data describing dependencies, comprising, for a parameter in the set of qubit parameters: performing a calibration test on the parameter; and performing a first calibration experiment or a diagnostic calibration algorithm on the parameter when the calibration test fails.
  • implementations of this aspect include corresponding computer systems, apparatus, and computer programs recorded on one or more computer storage devices, each configured to perform the actions of the methods.
  • a system of one or more computers can be configured to perform particular operations or actions by virtue of having software, firmware, hardware, or a combination thereof installed on the system that in operation causes or cause the system to perform the actions.
  • One or more computer programs can be configured to perform particular operations or actions by virtue of including instructions that, when executed by data processing apparatus, cause the apparatus to perform the actions.
  • performing a first calibration experiment or a diagnostic calibration algorithm on the parameter comprises: performing a first calibration experiment on the parameter when the calibration test fails; and performing a diagnostic calibration algorithm on the parameter when the first calibration experiment fails due to errors that are not attributable to the parameter.
  • the method further comprises performing a second calibration experiment on the parameter when the first calibration experiment fails due to errors that are attributable to the parameter; aborting the processing of the one or more parameters in the set of qubit parameters in sequence when the second calibration experiment fails; and flagging the parameter as a parameter that is within specification when the parameter passes any of the calibration test or first calibration experiment.
  • the plurality of qubit parameters and the data describing dependencies of the plurality of qubit parameters on one or more other qubit parameters are represented by a directed graph comprising a node for each qubit parameter and a directed edge for each dependency; identifying a qubit parameter comprises identifying a qubit parameter that corresponds to a root node; selecting a set of qubit parameters that includes the identified qubit parameter and one or more dependent qubit parameters comprises selecting a set of qubit parameters that includes the qubit parameter that corresponds to the root node and the qubit parameters of each descendant node, wherein the set of qubit parameters is ordered according to a node ancestry ordering; and processing one or more parameters in the set of qubit parameters in sequence according to the data describing dependencies comprises processing one or more parameters in the set of qubit parameters in sequence according to the node ancestry ordering.
  • performing a diagnostic calibration algorithm on the parameter comprises: iteratively performing one or more of the first calibration experiment and second calibration experiment on the qubit parameter and qubit parameters that correspond to an ancestor node of the node of the qubit parameter until the qubit parameter and qubit parameters that correspond to an ancestor node of the node of the qubit parameter are determined to be within specification or the process is aborted, the iteratively performing comprising, for each iteration: performing the first calibration experiment on the qubit parameter; in response to determining the qubit parameter passes the first calibration experiment, flagging the parameter as a parameter that is within specification; and in response to determining the qubit parameter fails the first calibration experiment due to errors that are not attributable to the parameter, selecting an ancestor parameter as the qubit parameter.
  • the method further comprises in response to determining the qubit parameter fails the first calibration experiment due to errors that are attributable to the parameter, performing the second calibration experiment on the qubit parameter; in response to determining the qubit parameter passes the second calibration experiment, flagging the parameter as a parameter that is within specification; and in response to determining the qubit parameter fails the second calibration experiment, aborting the processing of the parameters in the set of qubit parameters.
  • errors that are not attributable to the parameter comprise errors that are attributable to ancestor parameters.
  • the directed graph is acyclic.
  • the directed graph is cyclic.
  • the number of iterations between co-dependent parameters in the selected set of qubit parameters is capped to a predetermined threshold.
  • the obtained data further comprises one or more attributes of the parameters in the set of qubit parameters including (i) a respective timeout period for which a calibration is to be performed, and (ii) acceptable thresholds for parameter values.
  • the calibration test comprises pass and fail criteria for determining when a parameter is out of specification.
  • the calibration test passes if a successful first or second calibration experiment has been performed on a parameter within a respective timeout period.
  • the calibration test fails if a parameter dependence has been recalibrated within a predetermined amount of time.
  • the calibration test fails if a parameter dependence fails the calibration test.
  • the first calibration experiment comprises one or more qubit experiments with respective measurement outcomes that are used to determine when a parameter is out of specification.
  • the first calibration experiment fails if the measurement outcomes of the qubit experiments comprise parameter values that are out of specification.
  • the second calibration experiment comprises one or more qubit experiments with respective measurement outcomes that are used to update the value of a parameter.
  • the second calibration experiment requires more time or more hardware to complete than the first calibration experiment.
  • the directed graph comprises a node for multiple parameters that are calibrated simultaneously.
  • the root node comprises a root node whose corresponding qubit parameter fails the calibration test.
  • the diagnostic calibration algorithm is data driven.
  • processing one or more parameters in the set of qubit parameters in sequence according to the data describing dependencies comprises processing each parameter in the set of qubit parameters in sequence according to the data describing dependencies.
  • Qubit calibrations may be bootstrapped from no specific knowledge of qubit parameters to a completely calibrated qubit.
  • qubit calibrations are not stable and may have to be repeatedly performed during the course of one or more quantum computations, thus increasing the complexity of the task of calibrating qubits.
  • a system implementing automatic qubit calibration may efficiently and effectively perform qubit calibration, thus increasing the reliability and performance of a system of one or more physical qubits, in turn improving the reliability and performance of quantum computations.
  • a system implementing automatic qubit calibration performs different qubit calibration methods at varying computational costs to determine whether a qubit parameter is functioning correctly or not and to correct a qubit parameter that is not functioning correctly.
  • the system effectively and efficiently monitors a system of qubits and applies appropriate, cost effective procedures to correct qubits that are not operating properly, thus achieving improved computational performance and reduced costs associated with performing qubit calibration compared to systems that do not implement automatic qubit calibration.
  • a system implementing automatic qubit calibration systematically performs the different calibration methods at varying computational costs on the qubits, taking into account the dependencies of each qubit parameter on other qubit parameters.
  • the systematic approach improves the computational efficiency of a system implementing automatic qubit calibration compared to other systems that do not implement automatic qubit calibration, since the performance of unnecessary qubit calibration procedures or complete qubit resets are avoided whilst high levels of control and reliability are maintained.
  • a system implementing automatic qubit calibration utilizes known information about qubit parameters to calibrate the qubit parameters, improving the quality of the calibration procedure and reducing the time required to successfully calibrate a qubit parameter compared to systems that do not implement automatic qubit calibration.
  • a system implementing automatic qubit calibration may be robust to errors. When errors are encountered, the system fixes the errors and saves information regarding the context of the calibration procedure used to fix the error. Unnecessary work and calibration is therefore avoided.
  • This specification describes an architecture and method for automatically calibrating multiple qubit parameters.
  • the architecture and methods model the system of qubit parameters and their dependencies on one another using a directed graph comprising nodes and directed edges, each node corresponding to a qubit parameter and each directed edge indicating a dependency of one qubit parameter on another.
  • a maintain qubit calibration procedure and a diagnostic qubit calibration procedure may be performed automatically according to the directed graph, that is according to the qubit parameter dependencies, in order to monitor the values of the qubit parameters and correct any qubits whose values are out of specification.
  • FIG. 1 depicts an example system 100 for automatic qubit calibration.
  • the example system 100 is an example of a system implemented as classical or quantum computer programs on one or more classical computers or quantum computing devices in one or more locations, in which the systems, components, and techniques described below can be implemented.
  • the system includes a quantum computing device 102 in communication with a qubit calibration system 104 and a qubit and parameter attribute data store 106.
  • the qubit calibration system 104 is also in communication with the qubit and parameter attribute data store 106.
  • the quantum computing device includes one or more qubits 112.
  • the one or more qubits may be used to perform algorithmic operations or quantum computations.
  • the specific realization of the one or more qubits depends on the type of algorithmic operations or quantum computations that the quantum computing device is performing.
  • the qubits may include qubits that are realized via atomic, molecular or solid-state quantum systems.
  • the qubits may include, but are not limited to, superconducting qubits or semi conducting qubits. For clarity, three qubits are depicted in FIG. 1 , however the system may include a larger number of qubits.
  • Qubit parameters may include values used in a parameterized quantum gate, e.g., voltage amplitude for a pi pulse or frequency of a readout pulse.
  • the superconducting qubit may be associated with multiple parameters including: readout pulse frequency, readout pulse length, readout pulse power, readout discrimination threshold to discriminate between the 0 and 1 states based on the readout signal, pi rotation qubit frequency, pi/2 rotation qubit frequency, pi pulse length, pi/2 pulse length, pi pulse amplitude and pi/2 pulse amplitude.
  • Some or all of the parameters associated with a qubit may require experimental determination.
  • the readout pulse frequency, readout pulse power, readout discrimination threshold to discriminate between the 0 and 1 states based on the readout signal, pi rotation qubit frequency, pi/2 rotation qubit frequency, pi pulse amplitude and pi/2 pulse amplitude may require experimental determination.
  • Other parameters may be set a priori.
  • the multiple qubit parameters may in turn be associated with one or more parameter attributes.
  • the parameter attributes are dependent on the physical realization of the respective qubit.
  • the parameter attributes for a qubit parameter may include acceptable values of the qubit parameter, e.g., acceptable values used in a parameterized quantum gate. If a qubit parameter value is determined to be an acceptable value, or if the qubit parameter value is determined to lie within a tolerance value of what is accepted, the qubit parameter may be determined as being within specification. If a qubit value is determined to be an unacceptable value, the qubit parameter may be determined as being out of specification.
  • a pi pulse parameter may be determined to be in specification if the rotation angle is within the tolerance value of 1% of a 180 degree rotation. A qubit parameter that is out of specification may require calibration in order to ensure that the qubit parameter is within specification.
  • the parameter attributes for a qubit parameter may include a measure of the stability of the parameter, or the drift time of the parameter. After calibration, a qubit parameter may naturally drift out of specification due to external factors such as temperature.
  • the parameter attributes may therefore include a respective timeout period which indicates a time period for which a parameter value should be checked or calibrated.
  • the parameter attributes for a qubit parameter may include the dependencies of a qubit parameter on other qubit parameters.
  • a qubit parameter may depend on at least one other qubit parameter and the calibration of the at least one other qubit parameter.
  • the qubit may be an atom and the parameters of the qubit may be calibrated using Rabi driving.
  • Rabi driving may need to be performed at the qubit frequency, which must be determined in a different experiment, and the qubit state must be measured using a readout operation which must itself be calibrated. Therefore, due to these parameter dependencies, before Rabi driving is performed, the qubit frequency calibration and readout operation should be calibrated.
  • the qubit parameters may be represented by a directed graph comprising a node for each parameter, e.g., node 108, and a directed edge for each dependency, e.g., directed edge 110.
  • the readout threshold parameter to discriminate between the 0 and 1 state may be represented by a node that is connected to a node representing a pi pulse parameter with a directed edge indicating that the readout threshold parameter is dependent on the pi pulse parameter.
  • a node that requires a pi pulse will be connected to a node that calibrated the pi pulse amplitude, since a node that requires a pi pulse may depend on a node that calibrates the pi pulse amplitude.
  • Each node in the directed graph may have an associated parameter and one or more associated experiments that may be used to determine a correct value for the parameter associated with the node.
  • qubit 114 may be associated with a number of qubit parameters, e.g., qubit parameter 108.
  • qubit parameter 108 For clarity a restricted number of qubit parameters, e.g., qubit parameter 108, are shown, however a qubit may be associated with a smaller or larger number of qubit parameters.
  • the directed graph may include one or more root node, e.g., nodes with no dependencies, which define a root or "ancestor" direction of the graph, e.g., the direction towards the root nodes with no dependencies, and a leaf or "child” direction of the graph, e.g., towards nodes that are dependent or deeper in the graph.
  • root node e.g., nodes with no dependencies
  • a root or "ancestor” direction of the graph e.g., the direction towards the root nodes with no dependencies
  • a leaf or "child” direction of the graph e.g., towards nodes that are dependent or deeper in the graph.
  • the qubit calibration system 104 may include a classical or quantum processing device and communicates with the quantum computing device 102.
  • the qubit calibration system 104 may be configured to obtain a set of qubit parameters and data describing one or more attributes of the parameters in the set of qubit parameters, including dependencies of qubit parameters on one or more other qubit parameters in the set of qubit parameters, wherein the parameters and their dependencies on one another may be represented by a directed graph comprising a node for each parameter and a directed edge for each dependency.
  • the qubit calibration system 104 may optionally store the data describing the one or more attributes of the parameters in the set of qubit parameters in a data store, e.g., qubit parameter and attributes data store 106.
  • the qubit calibration system 104 may receive some or all of the data describing the one or more attributes of the parameters in the set of qubit parameters from a third party external to the automatic qubit calibration system 100, e.g., through user input.
  • the qubit calibration system 104 may use the data describing the one or more attributes of the parameters in the set of qubit parameters to automatically calibrate the qubit parameters.
  • the qubit calibration system 104 may be configured to identify a qubit parameter, e.g., a qubit parameter that corresponds to a root node of the directed graph, select a set of qubit parameters that includes the identified qubit parameter and one or more dependent qubit parameters, e.g., the qubit parameter that corresponds to the selected node and the qubit parameters of each descendant node.
  • the set of qubit parameters may be ordered, e.g., according to a node ancestry ordering.
  • the qubit calibration system 104 may calibrate the parameters in the set of qubit parameters in sequence according to the ordering. A process used by the qubit calibration system 104 to perform these operations is described in more detail below with reference to FIGS. 2 , 3 and 4 .
  • the qubit calibration system 104 may be configured to perform calibration tests and calibration experiments on qubit parameters, e.g., qubit parameter 108, in order to calibrate the qubit parameters of the one or more qubits 112 included in the quantum computing device 102, e.g., qubit 114.
  • a calibration experiment may include a single, static set of waveforms, where a single experiment may be repeated N times to gather statistics on a probability distribution of a final qubit state after the experiment.
  • a calibration experiment may include performing a pi pulse followed by a readout pulse.
  • a calibration experiment may also include an ensemble of experiment where waveforms are altered from experiment to experiment.
  • An example ensemble of experiments includes a Rabi scan, e.g., a series of experiments consisting of a rotation pulse followed by a readout pulse, where each experiment would have a different amplitude for the rotation pulse. Such an ensemble of experiments could be used to determine a relationship between rotation amplitude and qubit state. Performing calibration tests and calibration experiments on qubit parameters is described in more detail below with reference to FIGS. 3 and 4 .
  • FIG. 2 is a flowchart of an example process 200 for automatic qubit calibration.
  • the process 200 will be described as being performed by a system of one or more classical or quantum computing devices located in one or more locations.
  • a qubit calibration system e.g., the qubit calibration system 104 and of FIG. 1 , appropriately programmed in accordance with this specification, can perform the process 200.
  • the system obtains multiple qubit parameters and data describing dependencies of the multiple qubit parameters on one or more other qubit parameters (step 202).
  • the data may also include data describing one or more attributes of the multiple parameters.
  • the parameters and their dependencies on one another may be represented by a directed graph including a node for each parameter and a directed edge for each dependency.
  • the directed edges for each dependency indicate a dependence of a node on a successful calibration of previous nodes. For example, a node corresponding to a pi pulse may depend on a successful calibration of at least the pi pulse amplitude.
  • the directed graph may include a node for multiple parameters and calibrations if related parameters are to be calibrated simultaneously.
  • the directed graph may be acyclic.
  • the directed graph may be a tree with a root node and one or more descendant nodes that are reached by proceeding from parent nodes to child nodes.
  • the directed graph may be cyclic, for example when there are one or more co-dependent parameters.
  • the one or more attributes of the parameters in the obtained set of qubit parameters may further include (i) a respective timeout period for which a calibration is to be performed, and (ii) acceptable thresholds for parameter values.
  • a timeout period for which a calibration is to be performed may be determined based on the "drift time" of the parameter, that is a length of time in which the value of the parameter remains stable and does not drift out of specification.
  • Acceptable thresholds for parameter values may vary according to the parameter type. For example, an acceptable threshold for a pi pulse may be within 1% of a 180 degree rotation.
  • the acceptable thresholds for parameter values may be used to determine whether a parameter is out of specification, e.g., whether a measurement of a parameter is producing noise.
  • the system identifies a qubit parameter (step 204).
  • the identified qubit parameter may be a qubit parameter that corresponds to a root node of the directed graph.
  • the directed graph may have one root node that is selected.
  • the directed graph may have multiple root nodes. In such a case the system may repeatedly select one of the qubit parameters that corresponds to a root node and perform the process 200 for each selected qubit parameter that corresponds to a root node.
  • the identified qubit parameter may correspond to a most root node that has failed a calibration test, as described in more detail below.
  • the system selects a set of qubit parameters that includes the identified qubit parameter and one or more dependent qubit parameters (step 206).
  • the set of qubit parameters may include the identified qubit parameter that corresponds to the identified node and the qubit parameters of each descendant node.
  • the set of qubit parameters may be ordered, e.g., according to a node ancestry ordering, that is the set of qubit parameters may be ordered in a sequence proceeding through the node dependencies, beginning with the identified root node and ending with the youngest child.
  • the directed graph is acyclic and includes nodes A, B, C and D, where A is the root node, node B depends on node A and nodes C and D depend on node B
  • the selected set of qubit parameters with node ancestry ordering may be ⁇ A, B, C, D ⁇ .
  • an equivalent node ancestry ordering may be ⁇ A, B, D, C ⁇ .
  • the directed graph is cyclic and the number of iterations between co-dependent parameters in the selected set of qubit parameters is capped to a predetermined threshold.
  • the directed graph is cyclic and includes nodes A, B, and C, where A is the root node, node B depends on node A and node C, and node C depends on node B, in principle the number of iterations between the co-dependent parameters B and C could be indefinite, that is the selected set of qubit parameters with node ancestry ordering could be an infinite set ⁇ A, B, C, B, C, B, C, ... ⁇ .
  • the system creates levels of optimization and caps the number of iterations between co-dependent parameters to a predetermined threshold.
  • the number of iterations may be capped to two and the selected set of qubit parameters with node ancestry ordering may be ⁇ A, B, C, B, C ⁇ .
  • the system processes one or more parameters in the set of qubit parameters in sequence according to the data describing the dependencies (step 208).
  • the system processes each of the parameters in the set of qubit parameters in sequence.
  • the directed graph is acyclic and includes nodes A, B, C and D, where A is the root node, node B depends on node A, and both nodes C and D depend on node B
  • the system may calibrate each parameter corresponding to nodes A, B, C and D in the set of qubit parameters ⁇ A, B, C, D ⁇ in sequence according to the ordering A, B, C, D. Processing a qubit parameter in a set of qubit parameters in sequence according to an ordering is described in more detail below with reference to FIGS. 3 and 4 .
  • FIG. 3 is a flow diagram of an example qubit maintenance process 300 for processing a parameter in a set of qubit parameters.
  • the qubit maintenance process 300 may be performed for one or more parameters in a set of qubit parameters in sequence according to a qubit parameter ordering.
  • the process 300 will be described as being performed by a system of one or more classical or quantum computing devices located in one or more locations.
  • a qubit calibration system e.g., the qubit calibration system 104 and of FIG. 1 , appropriately programmed in accordance with this specification, can perform the process 300.
  • the example process 300 may be considered a depth-first, recursive method of traversing a directed graph that represents qubit parameters and their dependencies, e.g., the process may be invoked on a node in a "leaf or "child' direction of the graph that is to be calibrated. The process may then start investigating the node in the most "root" direction that may be likely to be out of specification based on information regarding the recent and current status of the system, and works towards the node that originally had the process invoked on it. In some examples, the process 300 may be performed as an initial system calibration, since the process naturally moves in the order of least dependent towards a most dependent node, or in some cases it may be performed when a system has been idle sometime after a recent calibration.
  • the system performs a calibration test on the qubit parameter (step 302).
  • the calibration test determines whether the parameter is in or out of specification.
  • the calibration test may include a set of metadata associated with the directed graph, and may not include performing an experiment on the qubit parameter. Rather, the calibration test may be a low cost test that may be used to determine a current state of the parameter, and in turn the current state of the system, by investigating the qubit parameter and previous calibrations.
  • the calibration test may include pass and fail criteria for determining when a parameter is out of specification. For example, a calibration test on a qubit parameter may pass if a successful calibration experiment has been performed on the parameter within a respective timeout period. Calibration experiments are described in detail below with reference to steps 306 and 314.
  • a calibration test may fail if the parameter has been flagged as having failed a calibration experiment.
  • a calibration test may fail if a parameter dependence has been recalibrated within a predetermined amount of time, e.g., if an ancestor parameter, that is a parameter on which a current parameter depends, has been recalibrated since the current parameter itself was calibrated.
  • a calibration test may fail if the parameter dependence has been altered within a predetermined amount of time, e.g., if the parameter now depends on a different parameter.
  • a calibration test may fail if a parameter that depends on the parameter has failed a calibration test.
  • the system performs a first calibration experiment or a diagnostic calibration algorithm on the parameter when the calibration test fails.
  • the system performs a first calibration experiment on the parameter (step 306).
  • a first calibration experiment may include a method on a node that runs an ensemble of experiments and uses data from the ensemble of experiments to determine a state of calibration.
  • a first calibration experiment may include one or more qubit experiments with respective measurement outcomes that are used to determine whether a parameter value is out of specification.
  • the first calibration experiment may be a low cost ensemble of experiments, where an experiment may include an input waveform and an output of measured qubit states after applying the waveform. The first calibration experiment may be used to determine whether the qubit requires a full calibration.
  • a first calibration experiment may fail if a measurement outcome of a corresponding qubit experiment indicates parameter values that are out of specification. For example, a parameter value may be out of specification if the first calibration experiment returns noise and not an expected measurement result.
  • a first calibration experiment may be used to answer questions about a qubit parameter, such as: is the parameter in specification? Is the first calibration experiment functioning correctly, e.g., is an ensemble of experiments functioning accurately?
  • the system For a parameter in the set of qubit parameters for which the first calibration experiment fails due to errors that are not attributable to the parameter (step 308), the system performs a diagnostic calibration algorithm on the set of qubit parameters (step 310). Errors that are not attributable to the parameter may include errors that are attributable to ancestor parameters. For example, if a parameter requires a pi pulse but a parameter on which it depends does not have a calibrated pi pulse amplitude, the parameter that requires a pi pulse may fail the first calibration experiment due to the out of specification pi pulse amplitude. Performing a diagnostic calibration algorithm on a set of qubit parameters is described in more detail below with reference to FIG. 4 .
  • the system For a parameter in the set of qubit parameters for which the first calibration experiment fails due to errors that are attributable to the parameter (step 312), the system performs a second calibration experiment on the parameter (step 314).
  • Errors that are attributable to the parameter may include drift in the control electronics or device parameters, or an ancestor parameter changing the optimal value for this parameter, e.g., the pi amplitude may change for these reasons.
  • a second calibration experiment may include a method on a node representing a parameter that runs an ensemble of experiments and uses the data from the experiments to update the parameter associated with the node.
  • the second calibration experiment is the only experiment that alters the metadata associated with the directed graph.
  • a second calibration experiment may include one or more qubit experiments with respective measurement outcomes that are used to update the value of a parameter.
  • the second calibration experiment may be a high cost ensemble of experiments that are used to determine a new value for the qubit parameter.
  • the output of a second calibration experiment may be interpreted as updating a qubit parameter value.
  • the second calibration experiment may require more time or more hardware to complete than the first calibration experiment, e.g., a first calibration experiment is of lower cost than a second calibration experiment.
  • the system aborts the processing of the parameters in the set of qubit parameters (step 316).
  • the system For a parameter in the set of qubit parameters that passes any of the calibration test (as described in step 302), first calibration experiment (as described in step 306) or second calibration experiment, the system flags the parameter as a parameter that is within specification (step 318), that is the value of the parameter is acceptable and does not require further action/calibration. In this situation, the system may return to step 208 described above with reference to FIG. 2 , and select the next parameter in the set of qubit parameters in sequence according to the ordering.
  • the system may flag the qubit parameter corresponding to node A as being within specification, return to step 302 and perform a calibration test on node B.
  • FIG. 4 is a flow diagram of an example process 400 for performing a diagnostic calibration algorithm on a set of qubit parameters.
  • the process 400 will be described as being performed by a system of one or more classical or quantum computing devices located in one or more locations.
  • a qubit calibration system e.g., the qubit calibration system 104 of FIG. 1 , appropriately programmed in accordance with this specification, can perform the process 400.
  • the example process 400 may traverse a directed graph that represents qubit parameters and their dependencies by starting at a particular node and working backwards through the dependencies of the node.
  • the example process may assume that current or recent information regarding the system can no longer be trusted in a region near a node that calls the process. Therefore, the process 400 may traverse the graph entirely without the use of calibration tests and with the use of first and second calibration experiments.
  • the process 400 is an iterative process that includes iteratively performing one or more of the first calibration experiment and second calibration experiment on the qubit parameter and qubit parameters that correspond to an ancestor node of the node of the qubit parameter until the qubit parameter and qubit parameters that correspond to an ancestor node of the node of the qubit parameter are determined to be within specification or the process is aborted.
  • the process 400 maybe be iteratively performed until the qubit parameters that have failed the first calibration experiment, e.g., due to errors not attributable to the parameter, and qubit parameters that correspond to an ancestor node of the node of the qubit parameter that has failed the first calibration experiment are determined to be within specification.
  • the process 400 is a data driven diagnostic calibration algorithm.
  • the system performs a first calibration experiment on the qubit parameter (step 402). For example, if the directed graph is acyclic and includes nodes A, B and D, where A is the root node, node B depends on node A and node D depends on node B, where node D has failed the first calibration experiment due to errors not attributable to the parameter represented by node D, the system may perform a first calibration experiment on the qubit parameter corresponding to node D. Performing a first calibration experiment is described in more detail above with reference to FIG. 3 .
  • the system may determine whether the first calibration experiment on the qubit parameter has passed or not. In response to determining that the qubit parameter passes the first calibration experiment, the system flags the parameter as a parameter that is within specification (step 404).
  • the system selects an ancestor parameter as the qubit parameter (step 406). Errors that are not attributable to a parameter are described above with reference to FIG. 3 .
  • the system may select an ancestor node of node D, e.g., node B, return to step 402 and perform a first calibration experiment on the ancestor node, e.g., node B.
  • the system may determine a system failure if the process 400 is performed on a root node of the directed graph, e.g., a node that does not have an ancestor parameter, and it is determined at step 406 that the first calibration experiment has failed due to errors not attributable to the parameter corresponding to the root node.
  • the system performs the second calibration experiment on the qubit parameter (step 408). For example, continuing the example above, if it is determined in that the first calibration experiment performed on the qubit parameter corresponding to node D has failed due to errors attributable to the parameter corresponding to node D, the system performs a second calibration experiment on the qubit parameter corresponding to node D. Both Errors that are attributable to a parameter and performing second calibration experiments are described above with reference to FIG. 3 .
  • the system In response to determining the qubit parameter passes the second calibration experiment, the system flags the parameter as a parameter that is within specification (step 410).
  • the system In response to determining the qubit parameter fails the second calibration experiment, the system aborts the processing of the parameters in the set of qubit parameters (step 412).
  • FIGS. 5A and 5B show example illustrations 502 - 510 of calibrating a resonance frequency using a first and second calibration experiment, as described above with reference to FIGS. 3 and 4 and as performed by a qubit calibration system, e.g., the qubit calibration system 104 of FIG. 1 .
  • Illustration 502 shows an ideal Lorentzian frequency response of a readout resonator centered at 6500MHz.
  • Performing a first calibration experiment to the qubit may be used to verify that the resonator frequency is within specification, e.g., within a given range around 6500MHz, or out of specification. Since the first calibration experiment may be a low cost ensemble of experiments, instead of taking a large number of data points, the system may take a small number of data points, e.g., 5 data points using 5 experiments, centered about the expected resonance frequency of 6500MHz. Illustration 504 illustrates 5 data points using 5 experiments. The resulting data may suggest that the resonance frequency is where it is expected to be, e.g., at or close to 6500MHz. In this case, the first calibration experiment would return "true", e.g., the parameter has passed the first calibration experiment.
  • the system may produce illustration 506, wherein the circle bullets represent the outputs from the 5 experiments, as in illustration 504, and the vertical line represents the expected frequency of the resonator, e.g., 6493MHz.
  • the first experiment would indicate that the resonator frequency is not as expected, e.g., not at 6500MHz, and the first calibration experiment would return "false", e.g., the parameter has failed the first calibration experiment due to errors that are not attributable to the parameter.
  • a readout device may not be functioning, e.g., due to faulty hardware.
  • the system may produce illustration 508.
  • the data shown in illustration 508 is nonsensical - the readout device is always returning 0.5, independent of the frequency.
  • the first experiment would return "false", e.g., the calibration experiment failed due to errors that are not attributable to the parameter - rather the errors are attributable to the readout device.
  • the system may assume that the parameter is not within specification.
  • Illustration 510 shows the results of a second calibration experiment used to calibrate the resonance frequency.
  • a second calibration experiment may include running an ensemble of experiments and using the data from the experiments to update the parameter associated with the node.
  • Illustration 510 shows the results of performing the ensemble of experiments to determine the resonator frequency.
  • Implementations of the digital and/or quantum subject matter and the digital functional operations and quantum operations described in this specification can be implemented in digital electronic circuitry, suitable quantum circuitry or, more generally, quantum computational systems, in tangibly-embodied digital and/or quantum computer software or firmware, in digital and/or quantum computer hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them.
  • quantum computational systems may include, but is not limited to, quantum computers, quantum information processing systems, quantum cryptography systems, or quantum simulators.
  • Implementations of the digital and/or quantum subject matter described in this specification can be implemented as one or more digital and/or quantum computer programs, i.e., one or more modules of digital and/or quantum computer program instructions encoded on a tangible non-transitory storage medium for execution by, or to control the operation of, data processing apparatus.
  • the digital and/or quantum computer storage medium can be a machine-readable storage device, a machine-readable storage substrate, a random or serial access memory device, one or more qubits, or a combination of one or more of them.
  • the program instructions can be encoded on an artificially-generated propagated signal that is capable of encoding digital and/or quantum information, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode digital and/or quantum information for transmission to suitable receiver apparatus for execution by a data processing apparatus.
  • digital and/or quantum information e.g., a machine-generated electrical, optical, or electromagnetic signal
  • quantum information and quantum data refer to information or data that is carried by, held or stored in quantum systems, where the smallest non-trivial system is a qubit, i.e., a system that defines the unit of quantum information.
  • qubit encompasses all quantum systems that may be suitably approximated as a two-level system in the corresponding context.
  • Such quantum systems may include multi-level systems, e.g., with two or more levels.
  • such systems can include atoms, electrons, photons, ions or superconducting qubits.
  • the computational basis states are identified with the ground and first excited states, however it is understood that other setups where the computational states are identified with higher level excited states are possible.
  • data processing apparatus refers to digital and/or quantum data processing hardware and encompasses all kinds of apparatus, devices, and machines for processing digital and/or quantum data, including by way of example a programmable digital processor, a programmable quantum processor, a digital computer, a quantum computer, multiple digital and quantum processors or computers, and combinations thereof.
  • the apparatus can also be, or further include, special purpose logic circuitry, e.g., an FPGA (field programmable gate array), an ASIC (application-specific integrated circuit), or a quantum simulator, i.e., a quantum data processing apparatus that is designed to simulate or produce information about a specific quantum system.
  • a quantum simulator is a special purpose quantum computer that does not have the capability to perform universal quantum computation.
  • the apparatus can optionally include, in addition to hardware, code that creates an execution environment for digital and/or quantum 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.
  • code that creates an execution environment for digital and/or quantum 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 digital 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 quantum 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 translated into a suitable quantum programming language, or can be written in a quantum programming language, e.g., QCL or Quipper.
  • a digital and/or quantum 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 digital and/or quantum computer program can be deployed to be executed on one digital or one quantum computer or on multiple digital and/or quantum computers that are located at one site or distributed across multiple sites and interconnected by a digital and/or quantum data communication network.
  • a quantum data communication network is understood to be a network that may transmit quantum data using quantum systems, e.g., qubits. Generally, a digital data communication network cannot transmit quantum data, however a quantum data communication network may transmit both quantum data and digital data.
  • the processes and logic flows described in this specification can be performed by one or more programmable digital and/or quantum computers, operating with one or more digital and/or quantum processors, as appropriate, executing one or more digital and/or quantum computer programs to perform functions by operating on input digital and quantum 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 a quantum simulator, or by a combination of special purpose logic circuitry or quantum simulators and one or more programmed digital and/or quantum computers.
  • a system of one or more digital and/or quantum 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.
  • one or more digital and/or quantum 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 and/or quantum data processing apparatus, cause the apparatus to perform the operations or actions.
  • a quantum computer may receive instructions from a digital computer that, when executed by the quantum computing apparatus, cause the apparatus to perform the operations or actions.
  • Digital and/or quantum computers suitable for the execution of a digital and/or quantum computer program can be based on general or special purpose digital and/or quantum processors or both, or any other kind of central digital and/or quantum processing unit.
  • a central digital and/or quantum processing unit will receive instructions and digital and/or quantum data from a read-only memory, a random access memory, or quantum systems suitable for transmitting quantum data, e.g. photons, or combinations thereof.
  • the essential elements of a digital and/or quantum computer are a central processing unit for performing or executing instructions and one or more memory devices for storing instructions and digital and/or quantum data.
  • the central processing unit and the memory can be supplemented by, or incorporated in, special purpose logic circuitry or quantum simulators.
  • a digital and/or quantum computer will also include, or be operatively coupled to receive digital and/or quantum data from or transfer digital and/or quantum data to, or both, one or more mass storage devices for storing digital and/or quantum data, e.g., magnetic, magneto-optical disks, optical disks, or quantum systems suitable for storing quantum information.
  • mass storage devices for storing digital and/or quantum data, e.g., magnetic, magneto-optical disks, optical disks, or quantum systems suitable for storing quantum information.
  • a digital and/or quantum computer need not have such devices.
  • Digital and/or quantum computer-readable media suitable for storing digital and/or quantum computer program instructions and digital and/or quantum data include all forms of non-volatile digital and/or quantum memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; CD-ROM and DVD-ROM disks; and quantum systems, e.g., trapped atoms or electrons.
  • semiconductor memory devices e.g., EPROM, EEPROM, and flash memory devices
  • magnetic disks e.g., internal hard disks or removable disks
  • magneto-optical disks CD-ROM and DVD-ROM disks
  • quantum systems e.g., trapped atoms or electrons.
  • quantum memories are devices that can store quantum data for a long time with high fidelity and efficiency, e.g., light-matter interfaces where light is used for transmission and matter for storing and preserving the quantum features of quantum data such as superposition or quantum coherence.
  • Control of the various systems described in this specification, or portions of them, can be implemented in a digital and/or quantum 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 and/or quantum processing devices.
  • the systems described in this specification, or portions of them, can each be implemented as an apparatus, method, or system that may include one or more digital and/or quantum processing devices and memory to store executable instructions to perform the operations described in this specification.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • Quality & Reliability (AREA)
  • Data Mining & Analysis (AREA)
  • Software Systems (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Computing Systems (AREA)
  • Evolutionary Computation (AREA)
  • Mathematical Physics (AREA)
  • Mathematical Analysis (AREA)
  • Condensed Matter Physics & Semiconductors (AREA)
  • Computational Mathematics (AREA)
  • Artificial Intelligence (AREA)
  • Testing Or Calibration Of Command Recording Devices (AREA)
  • Complex Calculations (AREA)
  • Tests Of Electronic Circuits (AREA)
EP16825954.7A 2016-06-09 2016-12-19 Automatic qubit calibration Active EP3469523B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US15/178,136 US9940212B2 (en) 2016-06-09 2016-06-09 Automatic qubit calibration
PCT/US2016/067467 WO2017213698A1 (en) 2016-06-09 2016-12-19 Automatic qubit calibration

Publications (2)

Publication Number Publication Date
EP3469523A1 EP3469523A1 (en) 2019-04-17
EP3469523B1 true EP3469523B1 (en) 2020-05-27

Family

ID=57794359

Family Applications (1)

Application Number Title Priority Date Filing Date
EP16825954.7A Active EP3469523B1 (en) 2016-06-09 2016-12-19 Automatic qubit calibration

Country Status (7)

Country Link
US (5) US9940212B2 (ja)
EP (1) EP3469523B1 (ja)
JP (3) JP6668512B2 (ja)
CN (2) CN109804387B (ja)
AU (4) AU2016410256B2 (ja)
CA (1) CA3026622C (ja)
WO (1) WO2017213698A1 (ja)

Families Citing this family (40)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3369047B1 (en) * 2015-10-29 2024-08-28 Google LLC Removing leakage in a quantum bit
US10282675B2 (en) 2017-03-10 2019-05-07 Rigetti & Co, Inc. Performing a calibration process in a quantum computing system
EP3642765A4 (en) 2017-06-19 2021-04-07 Rigetti & Co., Inc. DISTRIBUTED QUANTUM COMPUTER SYSTEM
US11875222B1 (en) * 2017-09-18 2024-01-16 Rigetti & Co, Llc Maintaining calibration in a quantum computing system
US10885678B2 (en) * 2017-09-29 2021-01-05 International Business Machines Corporation Facilitating quantum tomography
CN111712842B (zh) * 2017-12-15 2023-11-28 谷歌有限责任公司 使用监督学习细化量子位校准模型
US11010145B1 (en) 2018-02-21 2021-05-18 Rigetti & Co, Inc. Retargetable compilation for quantum computing systems
US11361241B2 (en) * 2018-03-02 2022-06-14 Google Llc Optimizing qubit operating frequencies
US11893003B2 (en) * 2018-03-20 2024-02-06 Google Llc Batching waveform data
US11372651B2 (en) 2018-09-10 2022-06-28 International Business Machines Corporation Bootstrapping a variational algorithm for quantum computing
CN109522166A (zh) * 2018-10-11 2019-03-26 广东电网有限责任公司 一种等保测评的自动测评方法及系统
CN109597728B (zh) * 2018-11-15 2022-09-06 Oppo（重庆）智能科技有限公司 测试设备的控制方法及装置、计算机可读存储介质
US11194642B2 (en) * 2018-11-29 2021-12-07 International Business Machines Corporation Noise and calibration adaptive compilation of quantum programs
US10997519B2 (en) 2018-11-29 2021-05-04 International Business Machines Corporation Co-scheduling quantum computing jobs
CN109858628B (zh) * 2019-02-28 2021-04-27 北京百度网讯科技有限公司 编译量子电路的方法、装置、设备和计算机可读存储介质
US11699088B2 (en) * 2019-06-07 2023-07-11 Google Llc Calibration of quantum processor operator parameters
CA3141547C (en) 2019-06-14 2024-02-06 Zapata Computing, Inc. Hybrid quantum-classical computer for bayesian inference with engineered likelihood functions for robust amplitude estimation
US11321619B2 (en) 2019-08-14 2022-05-03 International Business Machines Corporation State dependent calibration of qubit measurements
CN112444713B (zh) * 2019-08-28 2021-10-08 合肥本源量子计算科技有限责任公司 一种量子芯片检测方法
US11681908B2 (en) * 2019-09-13 2023-06-20 International Business Machines Corporation Quantum state classifier using reservoir computing
US20230029092A1 (en) * 2019-12-10 2023-01-26 Google Llc Denoising Qubit Calibration Data with Deep Learning
US11544613B2 (en) 2019-12-26 2023-01-03 International Business Machines Corporation Controlling a quantum computing device based on predicted operation time
CN113255921A (zh) * 2020-02-11 2021-08-13 阿里巴巴集团控股有限公司 测量系统、方法、装置及设备
WO2021236725A1 (en) * 2020-05-22 2021-11-25 Zapata Computing, Inc. Noise mitigation through quantum state purification by classical ansatz training
CN111722084B (zh) * 2020-06-29 2021-07-20 浪潮集团有限公司 一种超导量子芯片参数自动校准方法及相关组件
US11526796B2 (en) 2020-07-15 2022-12-13 International Business Machines Corporation Qubit pulse calibration via canary parameter monitoring
WO2022087143A1 (en) 2020-10-20 2022-04-28 Zapata Computing, Inc. Parameter initialization on quantum computers through domain decomposition
US11741387B2 (en) * 2020-11-11 2023-08-29 International Business Machines Corporation Techniques for quickly revising waveforms following calibration of a quantum system
US11687818B2 (en) 2021-02-05 2023-06-27 International Business Machines Corporation Hardware-efficient calibration framework for quantum computing devices
CN114970867B (zh) * 2021-02-20 2024-04-05 本源量子计算科技（合肥）股份有限公司 量子计算机系统以及任务调度方法
CN113011594B (zh) * 2021-03-26 2023-08-08 本源量子计算科技（合肥）股份有限公司 量子比特的校准方法及装置、量子计算机
US20220309371A1 (en) * 2021-03-29 2022-09-29 Red Hat, Inc. Automated quantum circuit job submission and status determination
CN113240122A (zh) * 2021-04-09 2021-08-10 合肥本源量子计算科技有限责任公司 量子计算机操作系统以及量子计算机
CN115249069B (zh) * 2021-04-25 2023-12-12 本源量子计算科技（合肥）股份有限公司 量子比特校准方法、装置及量子计算机操作系统
CN115470922B (zh) * 2022-03-28 2024-04-05 本源量子计算科技（合肥）股份有限公司 量子比特校准方法及装置、量子控制系统、量子计算机
CN115470921B (zh) * 2022-03-28 2024-02-06 本源量子计算科技（合肥）股份有限公司 量子比特校准方法以及装置、量子计算机
CN115470920B (zh) * 2022-03-28 2024-02-06 本源量子计算科技（合肥）股份有限公司 量子比特校准方法以及装置、量子计算机
CN114757225B (zh) * 2022-03-31 2023-05-30 北京百度网讯科技有限公司 信号采样质量的确定方法、装置、设备及存储介质
CN115879561B (zh) * 2022-12-30 2024-07-05 北京百度网讯科技有限公司 量子电路任务超时原因确定方法、装置、设备及存储介质
WO2024210909A1 (en) 2023-04-07 2024-10-10 Google Llc Metric based quantum processor re-calibration

Family Cites Families (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0553815A (ja) * 1991-08-29 1993-03-05 Fuji Xerox Co Ltd 推論装置における支援方式
US6803599B2 (en) * 2001-06-01 2004-10-12 D-Wave Systems, Inc. Quantum processing system for a superconducting phase qubit
US7002174B2 (en) * 2001-12-18 2006-02-21 D-Wave Systems, Inc. Characterization and measurement of superconducting structures
US20030121028A1 (en) * 2001-12-22 2003-06-26 Michael Coury Quantum computing integrated development environment
US7830695B1 (en) * 2006-10-30 2010-11-09 Hrl Laboratories Capacitive arrangement for qubit operations
WO2008134875A1 (en) * 2007-05-02 2008-11-13 D-Wave Systems, Inc. Systems, devices, and methods for controllably coupling qubits
CN101118608B (zh) * 2007-08-23 2011-07-20 清华大学 任意量子比特门的分解方法
US7860900B2 (en) * 2008-02-25 2010-12-28 Microsoft Corporation Consistently signaling state changes
US8089286B2 (en) * 2008-04-15 2012-01-03 Nec Laboratories America, Inc. System and method for quantum computer calibration and performance estimation
DE102009054112A1 (de) * 2009-11-20 2011-05-26 Kuka Roboter Gmbh Verfahren und Vorrichtung zur Planung und/oder Steuerung einer Roboterapplikation
US8589898B2 (en) * 2010-03-29 2013-11-19 GM Global Technology Operations LLC Method and apparatus for analyzing software including a calibrated value
CN102509105B (zh) * 2011-09-30 2013-07-31 北京航空航天大学 一种基于贝叶斯推理的图像场景分层处理方法
EP2766859B1 (en) * 2011-10-14 2020-12-16 Element Six Technologies Limited Quantum processing device
US9092573B2 (en) * 2012-07-06 2015-07-28 Nvidia Corporation System, method, and computer program product for testing device parameters
JP6300830B2 (ja) * 2013-02-08 2018-03-28 ディー−ウェイブ システムズ，インコーポレイテッド 量子プロセッサの要素を較正するためのシステムおよび方法
US9727824B2 (en) * 2013-06-28 2017-08-08 D-Wave Systems Inc. Systems and methods for quantum processing of data
US9727823B2 (en) * 2013-07-23 2017-08-08 D-Wave Systems Inc. Systems and methods for achieving orthogonal control of non-orthogonal qubit parameters
US9898575B2 (en) * 2013-08-21 2018-02-20 Seven Bridges Genomics Inc. Methods and systems for aligning sequences
US9946893B2 (en) * 2013-11-26 2018-04-17 Nokia Technologies Oy Method and apparatus for providing privacy profile adaptation based on physiological state change
US20140164313A1 (en) * 2014-02-17 2014-06-12 Invent.ly LLC Method and Apparatus for Predicting Subject Responses to a Proposition based on Quantum Representation of the Subject's Internal State and of the Proposition
CN103942460B (zh) * 2014-05-13 2017-04-12 华南师范大学 一种容错实现通用量子计算的方法
CA2901048C (en) * 2014-08-20 2022-09-27 Lockheed Martin Corporation Heuristic graph embedding methods for adiabatic quantum computation optimization
US10552755B2 (en) * 2014-08-22 2020-02-04 D-Wave Systems Inc. Systems and methods for improving the performance of a quantum processor to reduce intrinsic/control errors
US9614532B1 (en) * 2015-12-17 2017-04-04 International Business Machines Corporation Single-flux-quantum probabilistic digitizer

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
CN112101560A (zh) 2020-12-18
JP7210650B2 (ja) 2023-01-23
WO2017213698A1 (en) 2017-12-14
US9940212B2 (en) 2018-04-10
AU2019229402B2 (en) 2020-07-16
US11567842B2 (en) 2023-01-31
AU2020239709B2 (en) 2021-05-27
CN109804387A (zh) 2019-05-24
JP2020102240A (ja) 2020-07-02
CA3026622C (en) 2021-09-21
AU2020239709A1 (en) 2020-10-22
AU2016410256B2 (en) 2019-07-25
US20200151073A1 (en) 2020-05-14
AU2019229402A1 (en) 2019-10-10
CN109804387B (zh) 2020-09-11
AU2021203991A1 (en) 2021-07-22
US20210216420A1 (en) 2021-07-15
JP2019521433A (ja) 2019-07-25
AU2016410256A1 (en) 2018-12-20
US20180225186A1 (en) 2018-08-09
EP3469523A1 (en) 2019-04-17
JP6668512B2 (ja) 2020-03-18
US20170357561A1 (en) 2017-12-14
US20230130488A1 (en) 2023-04-27
JP6907359B2 (ja) 2021-07-21
JP2021168164A (ja) 2021-10-21
AU2021203991B2 (en) 2022-08-11
CN112101560B (zh) 2024-10-15
US10606720B2 (en) 2020-03-31
CA3026622A1 (en) 2017-12-14
US10997044B2 (en) 2021-05-04

Similar Documents

Publication Publication Date Title
AU2021203991B2 (en) Automatic qubit calibration
AU2023202257B2 (en) Qubit calibration
JP7331261B2 (ja) ディープラーニングを用いてキュービット較正データをノイズ除去する

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

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

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

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

Free format text: ORIGINAL CODE: 0009012

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

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20190107

AK Designated contracting states

Kind code of ref document: A1

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

AX Request for extension of the european patent

Extension state: BA ME

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

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

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20191204

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

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

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1275307

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200615

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602016037197

Country of ref document: DE

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602016037197

Country of ref document: DE

Representative=s name: VENNER SHIPLEY GERMANY LLP, DE

Ref country code: DE

Ref legal event code: R082

Ref document number: 602016037197

Country of ref document: DE

Representative=s name: VENNER SHIPLEY LLP, DE

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200928

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200827

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200927

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200828

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20200527

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200827

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1275307

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200527

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602016037197

Country of ref document: DE

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20210302

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20201231

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201231

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201219

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201231

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201231

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200527

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201231

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230506

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20231227

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20231229

Year of fee payment: 8