Field
This disclosure generally relates to designs, layouts, and architectures for quantum processors comprising qubits and techniques for operating the same.
Adiabatic Quantum Computation
Adiabatic quantum computation typically involves evolving a system from a known initial Hamiltonian (the Hamiltonian being an operator whose eigenvalues are the allowed energies of the system) to a final Hamiltonian by gradually changing the Hamiltonian. A simple example of an adiabatic evolution is a linear interpolation between initial Hamiltonian and final Hamiltonian. An example is given by:
He=(1−s)Hi+sHf (1)
where Hi is the initial Hamiltonian, Hf is the final Hamiltonian, He is the evolution or instantaneous Hamiltonian, and s is an evolution coefficient which controls the rate of evolution. As the system evolves, the evolution coefficient s goes from 0 to 1 such that at the beginning (i.e., s=0) the evolution Hamiltonian He is equal to the initial Hamiltonian Hi and at the end (i.e., s=1) the evolution Hamiltonian He is equal to the final Hamiltonian Hf. Before the evolution begins, the system is typically initialized in a ground state of the initial Hamiltonian Hi and the goal is to evolve the system in such a way that the system ends up in a ground state of the final Hamiltonian Hf at the end of the evolution. If the evolution is too fast, then the system can transition to a higher energy state, such as the first excited state. In the present systems and devices, an “adiabatic” evolution is an evolution that satisfies the adiabatic condition:
{dot over (s)}|1|dHe/ds|O|=δg2(s) (2)
where {dot over (s)} is the time derivative of s, g(s) is the difference in energy between the ground state and first excited state of the system (also referred to herein as the “gap size”) as a function of s, and δ is a coefficient much less than 1. Generally the initial Hamiltonian Hi and the final Hamiltonian Hf do not commute. That is, [Hi, Hf]≠0.
The process of changing the Hamiltonian in adiabatic quantum computing may be referred to as evolution. If the rate of change, for example, change of s, is slow enough that the system is always in the instantaneous ground state of the evolution Hamiltonian, then transitions at anti-crossings (i.e., when the gap size is smallest) are avoided. The example of a linear evolution schedule is given above. Other evolution schedules are possible including non-linear, parametric, and the like. Further details on adiabatic quantum computing systems, methods, and apparatus are described in, for example, U.S. Pat. Nos. 7,135,701; and 7,418,283.
Depending on the form of the final Hamiltonian and the way the final results are extracted, one can operate an adiabatic quantum computer in at least three different modes. First, the adiabatic quantum computer can be operated as an adiabatic quantum optimizer to find the ground states of a Hamiltonian. This is also called quantum annealing. Second, it can be operated as a quantum simulator. Third, it can be operated to achieve the results of a gate model quantum algorithm by mapping from the gate model algorithm to an algorithm in the adiabatic quantum computing model.
Quantum Annealing
Quantum annealing is a computation method that may be used to find a low-energy state, typically preferably the ground state, of a system. Similar in concept to classical annealing, the method relies on the underlying principle that natural systems tend towards lower energy states because lower energy states are more stable. However, while classical annealing uses classical thermal fluctuations to guide a system to a low-energy state and ideally its global energy minimum, quantum annealing may use quantum effects, such as quantum tunneling, to reach a global energy minimum more accurately and/or more quickly than classical annealing. In quantum annealing thermal effects and other noise may be present to aid the annealing. However, the final low-energy state may not be the global energy minimum. Adiabatic quantum computation, therefore, may be considered a special case of quantum annealing for which the system, ideally, begins and remains in its ground state throughout an adiabatic evolution. Thus, those of skill in the art will appreciate that quantum annealing systems and methods may generally be implemented on an adiabatic quantum computer. Throughout this specification and the appended claims, any reference to quantum annealing is intended to encompass adiabatic quantum computation unless the context requires otherwise.
Quantum annealing uses quantum mechanics as a source of disorder during the annealing process. The optimization problem is encoded in a Hamiltonian HP, and the algorithm introduces quantum effects by adding a disordering Hamiltonian HD that does not commute with HP. An example case is:
HE∝A(t)HD+B(t)HP (3)
where A(t) and B(t) are time dependent envelope functions. For example, A(t) changes from a large value to substantially zero during the evolution and HE may be thought of as an evolution Hamiltonian similar to He described in the context of adiabatic quantum computation above. The disorder is slowly removed by removing HD (i.e., reducing A(t)). Thus, quantum annealing is similar to adiabatic quantum computation in that the system starts with an initial Hamiltonian and evolves through an evolution Hamiltonian to a final “problem” Hamiltonian HP whose ground state encodes a solution to the problem. If the evolution is slow enough, the system may settle in the global minimum (i.e., the exact solution), or in a local minimum close in energy to the exact solution. The performance of the computation may be assessed via the residual energy (difference from exact solution using the objective function) versus evolution time. The computation time is the time required to generate a residual energy below some acceptable threshold value. In quantum annealing, HP may encode an optimization problem but the system does not necessarily stay in the ground state at all times. The energy landscape of HP may be crafted so that its global minimum is the answer to the problem to be solved, and low-lying local minima are good approximations.
Simulating Physics
Adiabatic quantum computation may also be used for quantum simulation. Quantum simulation was the original application of quantum computers, see for example, R. P. Feynman, 1982 “Simulating physics with computers” International journal of theoretical physics 21(6), 467. The Hamiltonian of a quantum system is mapped on the Hamiltonian of a multi-qubit system and defines the final or problem Hamiltonian. An initial or disordering Hamiltonian is present per adiabatic computing model. The ground state of the problem Hamilton is then reached via adiabatic evolution. Reading out the final state then provides information about the ground state of the simulated system. A ground-state energy is the lowest eigenvalue of a time-independent Schrödinger equation for the system. The Phase-Estimation Algorithm (PEA) provides the spectrum of the system being simulated via the application of various gates and measurements in accordance with the gate model of quantum computing. See D. S. Abrams and S. Lloyd, 1997 “Simulation of Many-Body Fermi Systems on a Universal Quantum Computer” Phys. Rev. Left. 79, 2586; and D. S. Abrams and S. Lloyd, 1999 “Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors” Phys. Rev. Lett. 83, 5162.
Universal Quantum Computing
A quantum computational model is universal if it can solve a class of problems known as bounded-error quantum polynomial-time (BQP) problems in polynomial time. Such a universal computer is desirable. A quantum computer including qubits is known to be universal when it can perform single-qubit and non-local many-qubit operations. The operations should be unitary and the many qubit operations entangling. A universal quantum computer (UQC) may also be characterized as a quantum computer able to efficiently simulate any other quantum computer.
Superconducting Qubits
There are types of solid state qubits which are based on circuits of superconducting materials. There are two superconducting effects that underlie how superconducting qubits operate: magnetic flux quantization, and Josephson tunneling.
Flux is quantized via the Aharonov-Bohm effect where electrical charge carriers accrue a topological phase when traversing a conductive loop threaded by a magnetic flux. For superconducting loops, the charge carriers are pairs of electrons called Cooper pairs. For a loop of sufficiently thick superconducting material, quantum mechanics dictates that the Cooper pairs accrue a phase that is an integer multiple of 2π. This, then, constrains the allowed values of magnetic flux threading the loop.
Josephson tunneling is the process by which Cooper pairs cross an interruption, such as an insulating gap of a few nanometers, between two superconducting electrodes. The amount of current is sinusoidally dependent on the phase difference between the two populations of Cooper pairs in the electrodes. These superconducting effects are present in different configurations and give rise to different types of superconducting qubits including flux, phase, charge, and hybrid qubits. These different types of qubits depend on the topology of the loops, placement of the Josephson junctions, and the physical parameters of the parts of the circuit such as inductance, capacitance, and Josephson junction critical current.
Quantum Processor
A quantum processor may take the form of a superconducting quantum processor. A superconducting quantum processor may include a number of qubits and associated local bias devices, for instance two or more superconducting qubits. A superconducting quantum processor may also employ coupling devices (i.e., “couplers”) providing communicative coupling between qubits. A qubit and a coupler resemble each other but differ in physical parameters. One difference is the screening parameter, β. Consider an rf-SQUID, which includes a superconducting loop interrupted by Josephson junction. The screening parameter β is defined as the ratio of the geometrical inductance of the loop to the so called Josephson inductance of the junction.
The screening parameter β is defined as 2πLIC/Φ0. That is, β is proportional to the product of inductance and critical current. A design with lower values of β, below about 1, behaves more like an inductive loop whose magnetic susceptibility is altered by the presence of the Josephson junction. This is a monostable device. A design with higher values of β is more dominated by the Josephson junctions and produces a multi-stable behavior, such as bistable behavior. Flux qubits are typically designed to be bistable wherein there are degenerate ground state configurations for the superconducting current flowing around the loop. For SQUIDs with sufficiently low capacitance, quantum tunneling lifts the degeneracy of the ground state. Couplers are typically designed to be monostable, such that there is a single ground state configuration of the superconducting current flowing around the loop.
Both qubits and couplers can have more devices associated with them. Further details and embodiments of exemplary quantum processors that may be used in conjunction with the present systems and devices are described in, for example, U.S. Pat. Nos. 7,533,068; 8,008,942; 8,195,596; 8,190,548; and 8,421,053.
Most efforts in the field of quantum computing are devoted to the development of hardware that supports the universal quantum computing paradigm known as gate model quantum computation (GMQC). While GMQC has proved theoretically appealing, it has been difficult to realize in practice. An alternative quantum computing paradigm that has received appreciable experimental effort to date is adiabatic quantum computation (AQC).
Existing approaches to AQC include hardware that implements a particular AQC algorithm known as adiabatic quantum optimization (AQO). While AQO cannot provide the full functionality of what is deemed to be a universal quantum computer, it has nonetheless provided a valuable testing ground for the development of a quantum computing technology using currently available device fabrication techniques.
The quantum processor described herein takes what has been learned from building an AQO technology and applies that knowledge to the development of a universal quantum computer. The computational equivalence of AQC to GMQC has been shown in the art, and publications exist showing how to map exemplary algorithms from the gate model to the adiabatic quantum computing model.
A quantum processor may be summarized as including: at least a first pair of qubits; a first in-situ tunable superconducting capacitive coupler having a tunable capacitance, the first in-situ tunable superconducting capacitive coupler positioned to selectively provide a first communicative coupling between the qubits of the first pair of qubits; and a first in-situ tunable superconducting inductive coupler having a tunable inductance, the first in-situ tunable superconducting inductive coupler positioned to selectively provide a second communicative coupling between the qubits of the first pair of qubits.
Each of the qubits of the first pair of qubits may be a respective hybrid qubit which is operable in a flux regime or in a charge regime based on a ratio of Josephson energy to charging energy of the hybrid qubit.
The quantum processor may further include at least one readout device positioned and operable to selectively determine a state of at least one of the hybrid qubits.
Each of the qubits of the first pair of qubits may include: a qubit body, the qubit body comprising a loop of material that is superconductive below a critical temperature; and a pair of compound Josephson junctions that interrupt the loop of material, the pair of compound Josephson junctions separated by an island of superconducting material, and the island may be voltage biased with respect to the qubit body. The first in-situ tunable superconducting capacitive coupler may be located between the island of each of the qubits of the first pair of qubits, and the first in-situ tunable superconducting inductive coupler may be located between the qubit body of each of the qubits of the first pair of qubits. One of the first in-situ tunable superconducting capacitive coupler or the first in-situ tunable superconducting inductive coupler may provide a diagonal coupling in the computational basis and the other one of the first in-situ tunable superconducting capacitive coupler and the first in-situ tunable superconducting inductive coupler may provide an off-diagonal coupling in the computational basis. Each of the compound Josephson junctions may be inductively coupled to a bias line, the bias line shared by at least one of the qubits of the pair of qubits. One of the first in-situ tunable superconducting capacitive coupler or the first in-situ tunable superconducting inductive coupler may provide a diagonal coupling in the computational basis and the other one of the first in-situ tunable superconducting capacitive coupler and the first in-situ tunable superconducting inductive coupler may provide an off-diagonal coupling in the computational basis. The first in-situ tunable superconducting capacitive coupler may provide an off-diagonal coupling in the computational basis. Each of the qubits of the first pair of qubits may be communicatively coupleable to at least three qubits in addition to the qubits of the first pair of qubits. The quantum processor may be operable as a universal adiabatic quantum computing system.
A tunable superconducting capacitive coupler to communicatively couple a pair of qubits may be summarized as including: a pair of coupling capacitors in series with one another; a fixed capacitor in parallel with the pair of coupling capacitors, and a compound Josephson junction connected to a node between the coupling capacitors of the pair of coupling capacitors, the compound Josephson junction responsive to a flux bias to tune a sign and a magnitude of a sum of a capacitance of the fixed capacitor and a tunable capacitance which is mediated across the pair of coupling capacitors.
The tunable superconducting capacitive coupler may further include a node which connects to a voltage source to provide a gate voltage to the compound Josephson junction.
The tunable superconducting capacitive coupler may further include a node which connects to a voltage rail to provide a gate voltage to the compound Josephson junction of the tunable superconducting capacitive coupler and to one or more additional tunable superconducting capacitive couplers.
The compound Josephson junction may be directly connected to the node between the coupling capacitors of the pair of coupling capacitances.
A method for reading a respective final state of one or more qubits in a quantum processor may be summarized as including: setting a bias line to a dc level in operation of the one or more qubits during adiabatic quantum computing (AQC) evolution, the bias line inductively coupled to at least one compound Josephson junction; applying a step to the bias line; passing the respective final state of the one or more qubits through a scalable shift register; and reading the respective final state of the one or more qubits via one or more readout devices.
Passing the respective final state of the one or more qubits through a scalable shift register may include passing the respective final state of the one or more qubits through a quantum flux parametron shift register.
A non-transitory computer-readable storage medium may be summarized as containing at least one of processor-executable instructions or data, which when executed by at least one processor cause the at least one processor to: receive a final Hamiltonian including tunable coupling terms having a number of diagonal components and a number of off-diagonal components in the computational basis; initialize a quantum processor to a first initial state; cause the quantum processor to evolve for a time period from the first initial state toward the final Hamiltonian; and read out a final state.
The processor-executable instructions when executed may further cause the at least one processor to: receive a computational problem; and convert the computational problem into the final Hamiltonian. The processor-executable instructions when executed may further cause the at least one processor to: receive a description of a system to simulate; and convert the description of the system to simulate into the final Hamiltonian. The processor-executable instructions when executed may further cause the at least one processor to embed the final Hamiltonian in the quantum processor.
In the drawings, identical reference numbers identify similar elements or acts. The sizes and relative positions of elements in the drawings are not necessarily drawn to scale. For example, the shapes of various elements and angles are not drawn to scale, and some of these elements are arbitrarily enlarged and positioned to improve drawing legibility. Further, the particular shapes of the elements as drawn are not intended to convey any information regarding the actual shape of the particular elements, and have been solely selected for ease of recognition in the drawings.
In the following description, certain specific details are set forth in order to provide a thorough understanding of various disclosed embodiments. However, one skilled in the relevant art will recognize that embodiments may be practiced without one or more of these specific details, or with other methods, components, materials, etc. In other instances, well-known structures associated with quantum processors, qubits, couplers, controller, readout devices and/or interfaces have not been shown or described in detail to avoid unnecessarily obscuring descriptions of the embodiments.
Unless the context requires otherwise, throughout the specification and claims which follow, the word “comprise” and variations thereof, such as, “comprises” and “comprising” are to be construed in an open, inclusive sense, that is as “including, but not limited to.”
Reference throughout this specification to “one embodiment” or “an embodiment” means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment. Thus, the appearances of the phrases “in one embodiment” or “in an embodiment” in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
As used in this specification and the appended claims, the singular forms “a,” “an,” and “the” include plural referents unless the content clearly dictates otherwise. It should also be noted that the term “or” is generally employed in its sense including “and/or” unless the content clearly dictates otherwise.
The headings and Abstract of the Disclosure provided herein are for convenience only and do not interpret the scope or meaning of the embodiments.
The various embodiments described herein provide techniques to advance universal quantum computing in systems previously associated with adiabatic quantum computing and/or quantum annealing. Previous work to map gate model approaches to AQC approaches focused on existence rather than practical implementation of such mappings.
Coupled system 100 shows the particles 101, 102, and 103. Particle 102 is shown in the down state. Each particle can undergo single particle operations corresponding to the Pauli matrices {I, σix, σiy, σiz} where the subscript is the qubit index. Between the particles are set of 2-local interactions 112, 113, and 123. Also shown is a 3-local interaction 150. However, most interactions in nature are deemed to be 2-local and most implementations of qubits have 2-local (pairwise) interactions as their multi-qubit interactions.
A Universal Quantum Computer (UQC) is a quantum computer which is capable of efficiently simulating any other quantum computer. In some embodiments, a Universal Adiabatic Quantum Computer (UAQC) would be able to simulate any quantum computer via adiabatic quantum computation and/or via quantum annealing. In some embodiments, a UAQC would be able to simulate a physical quantum system via adiabatic quantum computation and/or via quantum annealing.
It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the 2-local model Hamiltonians used are general and hence do not limit the types of interactions required between spins to be known interactions that can be realized in a quantum processor. The 2-local Ising model with 1-local transverse field has been realized using different of technologies.
This quantum spin model is thought unlikely to be universal for adiabatic quantum computation. See discussion in S. Bravyi et al., 2006 arXiv:quant-ph/0606140v4 or Quant. Inf. Comp. 8, 0361(2008). However, it has been shown that adiabatic quantum computation can be rendered universal and belongs to the Quantum Merlin Arthur complexity class, a quantum analog of the NP complexity class, by having tunable 2-local diagonal and off-diagonal couplings in addition to tunable 1-local diagonal and off-diagonal biases.
Diagonal and off-diagonal terms can be defined with reference to the computational basis. The state of a qubit can be one of two basis states or a linear superposition of the two basis states. The two states form a computational basis.
The Hamiltonian that defines a universal quantum computer can be expressed in different forms. Limiting the conventional formulations including only 2-local interactions, the most compact physically realizable universal Hamiltonians are equivalent to:
See J. D. Biamonte and P. Love, 2008 “Realizable Hamiltonians for Universal Adiabatic Quantum Computers” Phys. Rev. A 78, 012352. These Hamiltonians provide for universal quantum computing when the signs and magnitudes of terms di, hi, Jijx, Jijz, Jijzx and Jijxz are tunable. However, it is believed that it may be possible Equation (4) provides a universal Hamiltonian without a sign tunable off-diagonal term di. It is also believed that for some Hamiltonians, all terms in the Hamiltonian need not be sign and magnitude tunable for the Hamiltonian to support universal adiabatic quantum computing. For example, a universal Hamiltonian could be as follows or the equivalent:
This Hamiltonian provides for universal quantum computing when the signs and magnitude of terms hi, Jijy, and Jijz, are tunable.
In accordance with some embodiments of the present systems, methods and devices, a quantum processor may be designed to perform adiabatic quantum computation and/or quantum annealing. An evolution Hamiltonian is proportional to the sum of a first term proportional to the problem Hamiltonian and a second term proportional to the disordering Hamiltonian. As previously discussed, a typical evolution may be represented by Equation (7):
HE∝A(t)HD+B(t)HP (7)
where HP is the problem Hamiltonian, disordering Hamiltonian is HD, HE is the evolution or instantaneous Hamiltonian, and A(t) and B(t) are examples of evolution coefficients which control the rate of evolution. In general, evolution coefficients vary from 0 to 1. In some embodiments, a time varying evolution coefficient is placed on the problem Hamiltonian. A common disordering Hamiltonian is shown in Equation (8):
where N represents the number of qubits, σx is the Pauli x-matrix for the ith qubit and Δj is the single qubit tunnel splitting induced in the ith qubit. Here, the σix terms are examples of off-diagonal terms. An example problem Hamiltonian includes a first component proportional to diagonal single qubit terms and a second component proportional to diagonal multi-qubit terms. The problem Hamiltonian, for example, may be of the form:
where N represents the number of qubits, σiz is the Pauli z-matrix for the ith qubit, hi and Ji,j are dimensionless local fields communicatively coupled into each qubit, and ε is some characteristic energy scale for HP. Here, the σiz and σizσjz terms are examples of “diagonal” terms. The former is a single qubit term and the latter a two qubit term. Note that the product of matrices (such as the Pauli x-matrix and Pauli z-matrix) is a tensor product. Throughout this specification, the terms “problem Hamiltonian” and “final Hamiltonian” are used interchangeably.
Hamiltonians such as HD and HP in Equations (8) and (9), respectively, may be physically realized in a variety of different ways. A particular example is realized by an implementation of superconducting qubits.
The portion of quantum processor 200 shown in
In the operation of quantum processor 200, interfaces 221 and 224 may each be used to couple a flux signal into a respective compound Josephson junction 231 and 232 of qubits 201 and 202, thereby controlling the Δi terms in the system Hamiltonian. This communicative coupling controls the off-diagonal σx terms of the Hamiltonian described by Equation (8). Similarly, interfaces 222 and 223 may each be used to apply a flux signal into a respective qubit loop of qubits 201 and 202, thereby realizing the hi terms in the system Hamiltonian. This communicative coupling provides the diagonal σz terms of Equation (9). Furthermore, interface 225 may be used to couple a flux signal into coupler 210, thereby realizing the Jij term(s) in the system Hamiltonian. This communicative coupling provides the diagonal σziσzj terms of Equation (9). In
Throughout this specification and the appended claims, the term “quantum processor” is used to generally describe a collection of physical qubits (e.g., qubits 201 and 202) and physical couplers (e.g., coupler 210). The physical qubits 201 and 202 and the physical couplers 210 are referred to as the “programmable elements” of the quantum processor 200 and their corresponding parameters (e.g., the qubit hi values and the coupler Jij values) are referred to as the “programmable parameters” of the quantum processor. In the context of a quantum processor, the term “programming subsystem” is used to generally describe the interfaces (e.g., “programming interfaces” 222, 223, and 225) used to control the programmable parameters (e.g., the hi and Jij terms) of the quantum processor 200 and other associated control circuitry and/or instructions. As previously described, the programming interfaces of the programming subsystem may communicate with other subsystems which may be separate from the quantum processor or may be included locally on the processor. As described in more detail later, the programming subsystem may receive programming instructions in a machine language of the quantum processor and execute the programming instructions to program the programmable elements in accordance with the programming instructions.
Similarly, in the context of a quantum processor, the term “evolution subsystem” is used to generally describe the interfaces (e.g., “evolution interfaces” 221 and 224) used to evolve the programmable elements of the quantum processor 200 and other associated control circuitry and/or instructions. For example, the evolution subsystem may include annealing signal lines and their corresponding interfaces (221, 224) to the qubits (201, 202).
Quantum processor 200 also includes readout devices 251 and 252, where readout device 251 is associated with qubit 201 and readout device 252 is associated with qubit 202. In the embodiment shown in
While
Examples of superconducting qubits include superconducting flux qubits, superconducting charge qubits, and the like. In a superconducting flux qubit, the Josephson energy dominates or is equal to the charging energy. In a charge qubit, it is the reverse. Examples of flux qubits that may be used include rf-SQUIDs, which include a superconducting loop interrupted by one Josephson junction, persistent current qubits, which include a superconducting loop interrupted by three Josephson junctions, and the like. See, examples of rf-SQUID qubits in Bocko, et al., 1997 IEEE Trans. on Appl. Supercond. 7, 3638; Friedman, et al., 2000, Nature 406, 43; and Harris, et al., 2010, Phys. Rev. B 81, 134510; or persistent current qubits, Mooij et al., 1999, Science 285, 1036; and Orlando et al., 1999, Phys. Rev. B 60, 15398. In addition, hybrid charge-phase qubits, where the energies are equal, may also be used. Further details of superconducting qubits may be found in Makhlin, et al., 2001, Rev. Mod. Phys. 73, 357; Devoret et al., 2004, arXiv:cond-mat/0411174; Zagoskin and Blais, 2007, Physics in Canada 63, 215; Clarke and Wilhelm, 2008, Nature 453, 1031; Martinis, 2009, Quantum Inf. Process. 8, 81; and Devoret and Schoelkopf, 2013, Science 339, 1169. In some embodiments, the qubit is controlled by on chip circuitry. Examples of on-chip control circuitry can be found in U.S. Pat. Nos. 7,876,248; 7,843,209; 8,018,244; 8,098,179; 8,169,231; and U.S. Patent Publication 2012-0094838.
A hybrid qubit, which is a component of the quantum processor described herein, is described in detail with reference to
The qubit 300 can be threaded by a magnetic flux 350. The magnetic flux 350 is the component of magnetic flux orthogonal to the plane of the qubit 300. The magnetic flux 350 can be orthogonal to the plane of qubit 300 and directed either into the plane of the qubit 300, or out of the plane of the qubit 300. For example, the magnetic flux 350 is shown in
The magnetic flux 350 can enter or leave the loop 301 via a weak link in the loop 301 such as the Josephson junction 302. The magnetic flux 350 corresponds to the states in the diagonal basis of the qubit 300.
The coupling shown in
In some embodiments, one of capacitances 410 and 411 is not supplied via a discrete capacitor but rather supplied via a capacitor formed by other elements (e.g., circuit trace, dielectric substrate, ground plane) as a mutual or parasitic capacitive coupling, e.g., via a ground plane in the quantum processor.
For the sake of clarity only a pair of qubits is shown in
D. Averin and C. Bruder, 2003 “Variable electrostatic transformer: controllable coupling of two charge qubits” Phys. Rev. Lett. 91, 057003, preprint at arXiv:cond-mat/0304166, describe a tunable electrostatic transformer providing capacitive coupling between two charge qubits. The Averin and Bruder coupling comprises a single Josephson junction and two coupling capacitors.
Similarly to the first variable electrostatic transformer 501, the second variable electrostatic transformer 511 comprises an island 512 of superconducting metal having boundaries defined by a Josephson junction 513, a first capacitor 514 and a second capacitor 515. The variable electrostatic transformer 511 further comprises the Josephson junction 513 and a voltage source 516. The capacitive coupling between the qubits 300a and 300b can be tuned by modulating the voltage applied to the Josephson junction 513.
The capacitance in the coupling can be made tunable by the addition of a variable electrostatic transformer controlled by a DC-SQUID.
An optional element 540 (indicated by dashed lines) can be included in configuration 500b to provide a bipolar capacitive coupling configuration. Element 540 comprises a capacitor 541 and a voltage source 542.
Coupler 500c is distinguished in at least one respect from the Averin and Bruder coupler by the flux-biased compound Josephson junction which replaces the single junction of the Averin and Bruder coupler. Coupler 500c is distinguished in at least another respect by fixed capacitance 551. Coupler 500c can be configured such that the sum of the fixed capacitance 551 and the tunable capacitance mediated across capacitances 552 and 553 can be sign- and magnitude-tunable using voltage source 562 and tunable magnetic flux 565.
Coupler 500d further comprises a global prebias current analog line 590, a per-coupler flux digital-to-analog converter (DAC) 593 and an associated DAC line 594. Energy can be transferred to the analog line 590 via a first transformer comprising inductances 582 and 591, and a second transformer comprising inductances 583 and 592. Energy can be transferred to the DAC line 594 via a third transformer comprising inductances 582 and 595, and a fourth transformer comprising inductances 583 and 596. Coupler 500d further comprises a global voltage rail 597 supplying a gate voltage to coupler 500d.
Coupler 500d is distinguished in at least one respect from coupler 500c of
A scalable method for the application of individually tuned qubit voltage-driven biases can be implemented using a suitable combination of static voltage rails (such as voltage rail 597) and programmable flux biases (such as magnetic flux 585).
The in-situ tunable superconducting capacitive coupler 500d of
The qubits 300a and 300b are coupled by a capacitive coupling and a galvanic coupling. Defining a first path between the qubits is a variable electrostatic transformer 601. Galvanic coupling defines a second path 602. Again, the wires or electrically conductive paths (for example, superconductive traces and/or vias) that define these paths cross. This mixed capacitive and galvanic coupling provides off-diagonal coupling between the qubits 300a and 300b. In accordance with some embodiments, the capacitance in the coupling is made tunable by the addition of a variable electrostatic transformer 601.
Also included in arrangement 600 is a variable inductive coupler 610 between qubits 300a and 300b, and an interface 651. The coupler 610 was described above in reference to
where εi, Jijyy and Jijzz are sign and magnitude tunable and Δi is magnitude tunable.
Compound Josephson junction 703 comprises two essentially identical constituent Josephson junctions each characterized by a critical current, a junction capacitance and a superconducting phase drop. Differences (non-identically) in the Josephson junctions included in the compound Josephson junction can be addressed by making the constituent Josephson junctions themselves compound Josephson junctions. The compound Josephson junction can be subjected to an applied external flux bias.
Qubit 702 is similarly designed and operated. Qubit 702 comprises a Josephson junction 706 and a loop of superconducting material 707 comprising an inductance 708.
The qubits 701 and 702 are coupled by a plurality of inductive couplings that provide an off-diagonal coupling. Coupler 720 provides an XZ coupling. Coupler 721 provides a ZX coupling. The coupler 720 is coupled to the loop 707 of qubit 702 and to the compound Josephson junction 703 of qubit 701. The flux in qubit 702 induces a flux in qubit 701 via the compound Josephson junction 703 of qubit 701. The corresponding coupler 721 couples to the loop 704 of qubit 701 and to the compound Josephson junction 706 of qubit 702. The coupling 720 can be tuned via a compound Josephson junction 724. Similarly, the coupling 721 can be tuned via a compound Josephson junction 725.
The qubits 701 and 702 can be biased with local fluxes to provide a diagonal single qubit term. Together, a Hamilton for the arrangement of coupled qubits 700 is:
where εi, Jijzx and Jijxz are sign and magnitude tunable and Δi is magnitude tunable. See U.S. Pat. No. 7,605,600.
The hybrid qubit can be operated in a flux regime or in a charge regime as determined by the ratio of the Josephson energy to the charging energy of the hybrid qubit. The flux regime is defined as the regime in which the absolute value of the ratio of the Josephson energy to the charging energy of the hybrid qubit (such as the qubit 800) is approximately less than or equal to unity. The charge regime is defined as the regime in which the absolute value of the ratio of the Josephson energy to the charging energy of the hybrid qubit (such as the qubit 800) is approximately greater than or equal to unity.
In some embodiments, the tunneling amplitude of the qubit 800 can be controlled by the voltage gate source 809. The dependence of the tunneling on the gate voltage Vg provided by gate voltage source 809 is via a cosine function:
Δ=2Δ0 cos(CgVgπ/2e)
where Δ0 is the tunneling rate in the absence of a voltage. The tunneling rate is sign- and magnitude-tunable. Moreover, changing gate voltage Vg does not affect the classical potential and therefore the persistent current of the qubit 800. Therefore, the gate voltage Vg and associated off-diagonal term can be changed without affecting other tunable parameters.
In operation of qubit 800, the total flux bias is defined by the presence or absence of a full flux quantum inside the loop of superconducting material 801. The flux quantum can enter or leave the superconducting loop 801 via Josephson junction 802 and/or Josephson junction 803. Josephson junctions 802 and 803 are considered weak links in the loop 801.
For Ne=2m, where m is an integer, there is constructive interference and no change to the phase of the flux quantum. For Ne=m+½, there is destructive interference and the flux qubit will not be able to change state. For Ne=2m+1 there is again constructive interference, but with a change in phase to the flux quantum. See, J. R. Friedman, and D. V. Averin, 2002, “Aharonov-Casher-Effect Suppression of Macroscopic Tunneling of Magnetic Flux” Phys. Rev. Lett. 88, 050403 (preprint arXiv:cond-mat/0109544).
In operation, each of the first hybrid qubit 800a and the second hybrid qubit 800b are threaded by a flux of about one half flux quantum (not shown in
where εi, Jijyy and Jijzz are sign and magnitude tunable and Δi is sign- and magnitude-tunable.
System 900b further comprises a capacitive coupler 940 and an inductive coupler 950. Capacitive coupler 940 comprises a compound Josephson junction 941, fixed capacitor 942, and tunable capacitors 943 and 944 to which fixed capacitor 942 is coupled at node 903, and voltage source 945. Compound Josephson junction 941 is threaded by a flux 990. Inductive coupler 950 comprises a compound Josephson junction 951 threaded by a flux 994.
The system 900b can be a practical hybrid qubit architecture configurable to provide a scalable implementation of a universal adiabatic quantum computer.
The qubit 1000 includes a loop of superconducting material 1001 interrupted by two Josephson junctions 1002 and 1003 that define an island of superconducting material 1011. In some embodiments, Josephson junctions 1002 and 1003 can be compound Josephson junctions. The Josephson junctions 1002 and 1003 have intrinsic capacitances 1005 and 1006, respectively. A static amount of charge can be drawn onto the island from the loop of superconducting material 1001 via a gate voltage source 1009 (Vg) that is coupled to the island via a gate capacitor 1008 with capacitance Cg. The total capacitance of the island defines the charging energy of the hybrid qubit 1000. The loop of superconducting material 1001 can have a small but finite inductance 1012. Inductance 1012 can be less than inductance 812 of loop 801 in qubit 800. The states of the qubit 1000 are presence and absence of excess Cooper pairs on the island 1011. Therefore, the capacitive couplings (not shown in
The first hybrid qubit 1000a and the second hybrid qubit 1000b are also coupled via an inductive transformer 1120. The inductance 1120 is tunable by a compound Josephson junction 1122 that is controlled by interface 1151. This inductive coupling between qubits 1000a and 1000b provides for an off-diagonal coupling (XX) that is sign and magnitude tunable. A Hamilton for the coupled qubits 1100 can be expressed as:
where Δi, εi, Jijyy and Jijzz are sign and magnitude tunable.
In some embodiments, a pair of hybrid flux-charge qubits can be coupled with fixed capacitive coupling and/or fixed inductive coupling.
A pair of hybrid flux-charge qubits coupled with variable capacitive coupling and variable inductive coupling is illustrated above in
For the sake of clarity, only a single pair of coupled qubits is shown in
From a practical perspective, one of the attractive features of AQO is that the final state of the processor is always a localized spin state. It can be stated that the AQO algorithm is the measurement that collapses the quantum mechanical wavefunction of the system of coupled qubits. One can then raise the tunnel barriers of the individual qubits high enough such that backaction from the readout circuit becomes irrelevant. This makes it possible to build scalable AQO processor readout circuits that can operate to high precision.
Readout is likely more challenging in AQC than in GMQC. Within the latter paradigm, all qubits are isolated at the end of a computation. Consequently, one can independently read each qubit in a GMQC processor. In contrast, AQC terminates with the target Hamiltonian being asserted. When the Hamiltonian contains off-diagonal elements, read out for AQC can present a challenge. If the readout process requires the qubit register wavefunction to collapse, then that state will no longer be an eigenstate of the target Hamiltonian. Therefore, it is desirable to devise a method to simultaneously project the states of all qubits in an AQC processor in the presence of finite biases and couplings.
In operation, the bias line 1310 can be set to a dc level in qubit operation during AQC evolution. To read the states of the two or more qubits in the scalable processor, a fast step (fast compared to the qubit tunneling timescale) can be applied to the bias line 1310. The effect is to raise the effective critical current of all CJJs (such as 1303 and 1304) in the qubits sharing the bias line 1310 in the scalable processor, resulting in the qubits being localized in either one of the two basis states.
A quantum annealing processor readout scheme can be used to pass the final qubit states through a scalable shift register 1320 and then on to a small number of high fidelity readout devices (not shown in
In some embodiments, an in-situ compensation of the qubit body inductance (such as body inductance 1302 of
Digital computer 1401 may include at least one processing unit (such as, central processor unit 1410), at least one system memory 1420, and at least one system bus 1417 that couples various system components, including system memory 1420 to central processor unit 1410.
The digital processor may be any logic processing unit, such as one or more central processing units (“CPUs”), digital signal processors (“DSPs”), application-specific integrated circuits (“ASICs”), etc. Unless described otherwise, the construction and operation of the various blocks shown in
System bus 1417 can employ any known bus structures or architectures, including a memory bus with a memory controller, a peripheral bus, and a local bus. System memory 1420 may include non-volatile memory such as read-only memory (“ROM”) and volatile memory such as random access memory (“RAM”) (not shown). An basic input/output system (“BIOS”) 1421, which can form part of the ROM, contains basic routines that help transfer information between elements within digital computer 1401, such as during startup.
Digital computer 1401 may also include other non-volatile memory 1415. Non-volatile memory 1415 may take a variety of forms, including: a hard disk drive for reading from and writing to a hard disk, an optical disk drive for reading from and writing to removable optical disks, and/or a magnetic disk drive for reading from and writing to magnetic disks. The optical disk can be a CD-ROM or DVD, while the magnetic disk can be a magnetic floppy disk or diskette. Non-volatile memory 1415 may communicate with digital processor via system bus 1417 and may include appropriate interfaces or controllers 1416 coupled to system bus 1416. Non-volatile memory 1415 may serve as long-term storage for computer-readable instructions, data structures, program modules and other data for digital computer 1401. Although digital computer 1401 has been described as employing hard disks, optical disks and/or magnetic disks, those skilled in the relevant art will appreciate that other types of non-volatile computer-readable media may be employed, such a magnetic cassettes, flash memory cards, Bernoulli cartridges, Flash, ROMs, smart cards, etc.
Various program modules, application programs and/or data can be stored in system memory 1420. For example, system memory 1420 may store an operating system 1423, and server modules 1427. In some embodiments, server module 1427 includes instruction for communicating with remote clients and scheduling use of resources including resources on the digital computer 1401 and quantum computer 1451. For example, a Web server application and/or Web client or browser application for permitting digital computer 1401 to exchange data with sources via the Internet, corporate Intranets, or other networks, as well as with other server applications executing on server computers.
In some embodiments system memory 1420 may store one or more calculation modules 1431 to perform pre-processing, co-processing, and post-processing to quantum computer 1451. In accordance with the present systems and methods, system memory 1420 may store a set of quantum computer interface modules 1435 operable to interact with the quantum computer 1451. While shown in
The quantum computer 1451 is provided in an isolated environment (not shown) to shield the internal elements of the quantum computer from heat, magnetic field, and the like. The quantum computer includes a quantum processor 1440 including qubits (not shown in
In some embodiments, the digital computer 1401 can operate in a networking environment using logical connections to at least one client computer system. In some embodiments, the digital computer 1401 is coupled via logical connections to at least one database system. These logical connections may be formed using any means of digital communication, for example, through a network, such as a local area network (“LAN”) or a wide area network (“WAN”) including, for example, the Internet. The networking environment may include wired or wireless enterprise-wide computer networks, intranets, extranets, and/or the Internet. Other embodiments may include other types of communication networks such as telecommunications networks, cellular networks, paging networks, and other mobile networks. The information sent or received via the logical connections may or may not be encrypted. When used in a LAN networking environment, digital computer 1401 may be connected to the LAN through an adapter or network interface card (“NIC”) (communicatively linked to bus 1417). When used in a WAN networking environment, digital computer 1401 may include an interface and modem (not shown), or a device such as NIC, for establishing communications over the WAN. Non-networked communications may additionally, or alternatively be employed.
The above description of illustrated embodiments, including what is described in the Abstract, is not intended to be exhaustive or to limit the embodiments to the precise forms disclosed. Although specific embodiments of and examples are described herein for illustrative purposes, various equivalent modifications can be made without departing from the spirit and scope of the disclosure, as will be recognized by those skilled in the relevant art. The teachings provided herein of the various embodiments can be applied to other analog processors, not necessarily the exemplary quantum processors generally described above.
The various embodiments described above can be combined to provide further embodiments. To the extent that they are not inconsistent with the specific teachings and definitions herein, all of the U.S. patents, U.S. patent application publications, U.S. patent applications, referred to in this specification and/or listed in the Application Data Sheet including U.S. provisional patent application Ser. No. 61/894,267 filed on Oct. 22, 2013, and Ser. No. 61/832,645 filed Jun. 7, 2013 are incorporated herein by reference, in their entirety. Aspects of the embodiments can be modified, if necessary, to employ systems, circuits and concepts of the various patents, applications and publications to provide yet further embodiments.
These and other changes can be made to the embodiments in light of the above-detailed description. In general, in the following claims, the terms used should not be construed to limit the claims to the specific embodiments disclosed in the specification and the claims, but should be construed to include all possible embodiments along with the full scope of equivalents to which such claims are entitled. Accordingly, the claims are not limited by the disclosure.
Number | Name | Date | Kind |
---|---|---|---|
6605822 | Blais et al. | Aug 2003 | B1 |
6784451 | Amin et al. | Aug 2004 | B2 |
6791109 | Tzalenchuk et al. | Sep 2004 | B2 |
6838694 | Esteve et al. | Jan 2005 | B2 |
6897468 | Blais et al. | May 2005 | B2 |
6936841 | Amin et al. | Aug 2005 | B2 |
7002174 | Il et al. | Feb 2006 | B2 |
7135701 | Amin et al. | Nov 2006 | B2 |
7253654 | Amin | Aug 2007 | B2 |
7418283 | Amin | Aug 2008 | B2 |
7533068 | Maassen van den Brink et al. | May 2009 | B2 |
7605600 | Harris | Oct 2009 | B2 |
7613764 | Hilton et al. | Nov 2009 | B1 |
7843209 | Berkley | Nov 2010 | B2 |
7876248 | Berkley et al. | Jan 2011 | B2 |
8008942 | van den Brink et al. | Aug 2011 | B2 |
8018244 | Berkley | Sep 2011 | B2 |
8035540 | Berkley et al. | Oct 2011 | B2 |
8098179 | Bunyk et al. | Jan 2012 | B2 |
8102185 | Johansson et al. | Jan 2012 | B2 |
8164082 | Friesen | Apr 2012 | B2 |
8169231 | Berkley | May 2012 | B2 |
8190548 | Choi | May 2012 | B2 |
8195596 | Rose et al. | Jun 2012 | B2 |
8421053 | Bunyk et al. | Apr 2013 | B2 |
8504497 | Amin | Aug 2013 | B2 |
9059674 | Chow et al. | Jun 2015 | B2 |
20020121636 | Amin et al. | Sep 2002 | A1 |
20020190381 | Herr et al. | Dec 2002 | A1 |
20030173498 | Blais et al. | Sep 2003 | A1 |
20030207766 | Esteve | Nov 2003 | A1 |
20030224753 | Bremond et al. | Dec 2003 | A1 |
20040012407 | Amin et al. | Jan 2004 | A1 |
20040016918 | Amin et al. | Jan 2004 | A1 |
20040077503 | Blais et al. | Apr 2004 | A1 |
20050001209 | Hilton et al. | Jan 2005 | A1 |
20050062072 | Yamamoto et al. | Mar 2005 | A1 |
20050082519 | Amin et al. | Apr 2005 | A1 |
20050224784 | Amin | Oct 2005 | A1 |
20060097746 | Amin | May 2006 | A1 |
20070180586 | Amin | Aug 2007 | A1 |
20120094838 | Bunyk et al. | Apr 2012 | A1 |
20120278057 | Biamonte et al. | Nov 2012 | A1 |
20170256698 | Nayfeh et al. | Sep 2017 | A1 |
Number | Date | Country |
---|---|---|
2012064974 | May 2012 | WO |
2015103372 | Jul 2015 | WO |
Entry |
---|
Jones et al., Tunable electromagnetic environment for supercomputing, Jun. 13, 13, Scientific Reports, pp. 1-5 (Year: 2013). |
Abrams et al., “A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors,” arXiv:quant-ph/9807070v1, Jul. 24, 1998, 9 pages. |
Abrams et al., “Simulation of Many-Body Fermi Systems on a Universal Quantum Computer,” arXiv:quant-ph/9703054, Mar. 28, 1997, 10 pages. |
Averin et al., “Variable Electrostatic Transformer: Controllable Coupling of Two Charge Qubits,” Physical Review Letters 91(5):057003-1-057003-4, 2003. |
Berkley et al., “Systems and Methods for Operating a Quantum Processor to Determine Energy Eigenvalues of a Hamiltonian,” U.S. Appl. No. 61/832,645, filed Jun. 7, 2013, 51 pages. |
Biamonte et al., “Realizable Hamiltonians for universal adiabatic quantum computers,” arXiv:0704.1287v2, Jun. 17, 2008, 7 pages. |
Bocko et al., “Prospects for Quantum Coherent Computation Using Superconducting Electronics,” IEEE Transactions on Applied Superconductivity 7(2):3638-3641, Jun. 1997. |
Bravyi et al., “The Complexity of Stoquastic Local Hamiltonian Problems,” arXiv:quant-ph/0606140v4, Oct. 2, 2007, 21 pages. |
Devoret et al., “Superconducting Circuits for Quantum Information: An Outlook,” Science 339:1169-1174, Mar. 8, 2013. |
Devoret et al., “Superconducting Qubits: A Short Review,” arXiv:cond-mat/0411174v1, Nov. 7, 2004, 41 pages. |
Feynman, “Simulating Physics with Computers,” International Journal of Theoretical Physics 21(6/7):467-488, 1982, 12 total pages. |
Friedman et al., “Aharonov-Casher-Effect Suppression of Macroscopic Tunneling of Magnetic Flux,” arXiv:cond-mat/0109544v1, Sep. 28, 2001, 9 pages. |
Friedman et al., “Quantum superposition of distinct macroscopic states,” Nature 406:43-46, Jul. 6, 2000. |
Harris et al., “Experimental Demonstration of a Robust and Scalable Flux Qubit,” arXiv:0909.4321v1, Sep. 24, 2009, 20 pages. |
Harris et al., “Universal Adiabatic Quantum Computing With Superconducting Qubits,” U.S. Appl. No. 61/894,267, filed Oct. 22, 2013, 44 pages. |
Makhlin et al., “Quantum-state engineering with Josephson-junction devices,” Reviews of Modern Physics 73(2):357-400, Apr. 2001. |
Martinis, “Superconducting phase qubits,” Quantum Inf Process 8:81-103, 2009. |
Mooij et al., “Josephson Persistent-Current Qubit,” Science 285:1036-1039, Aug. 13, 1999. |
Orlando et al., “Superconducting persistent-current qubit,” Physical Review B 60(22): 15398-15413, Dec. 1, 1999. |
Zagoskin et al., “Superconducting Qubits,” La Physique au Canada 63(4):215-227, 2007. |
Blais et al., “Tunable Coupling of Superconducting Qubits,” arXiv:cond-mat/0207112v3 [cond-mat.mes-hall], Mar. 18, 2003, 4 pages. |
Makhlin et al., “Josephson—Junction Qubits”, Fortschritte der Physik 48, pp. 1043-1054, 2000. |
Berkley, et al., “Entangled Macroscopic Quantum States in Two Superconducting Qubits”, Science, Jun. 6, 2003. https://science.sciencemag.org/content/300/5625/1548. |
Blais, et al., Cavity Quantum Electrodynamics for Superconducting Electrical Circuits: An Architecture for Quantum Computation, Physical Review A 69(062320):1-14, 2004. |
Choi, M-S., “Geometric Quantum Computation on Solid-State Qubits,” arXiv:quant-ph/0111019v4, Sep. 29, 2003, 7 pages. |
Clarke, et al., “Superconducting quantum bits,” Nature 453:1031-1042, Jun. 19, 2008. |
Duty, et al., “Coherent Dynamics of a Josephson Charge Qubit,” Physical Review B 69(140503(R)):1-4, 2004. |
Hua, et al., “Microstrip Bandpass Filters Using Dual-Mode Resonators with Internal Coupled Lines,” Progress in Electromagnetics Research C, 21:99-111, 2011. |
Hutter, et al., “Inductively Coupled Charge Qubits with Asymmetric SQUIDs,” Jahrestagung der Deutschen Physikalischen Gesellschaft (DPG), 2005, 1 page—abstract only. |
Il'ichev, et al., “Radio-Frequency Method for Investigation of Quantum Properties of Superconducting Structures,” arXiv:cond-mat/0402559v3, Jun. 23, 2004, 10 pages. |
Levitov, et al., “Quantum Spin Chains and Majorana States in Arrays of Coupled Qubits,” arXiv:cond-mat/0108266v2 [cond-mat.mes-hall]. Aug. 19, 2001, 7 pages. |
Nakamura, et al., “Coherent control of macroscopic quantum states in a single-Cooper-pair-box,” Nature 398:786-788, Apr. 29, 1999. |
Pashkin, et al., “Quantum Oscillations in Two Coupled Charge Qubits,” Nature 421:823-826, Feb. 20, 2003. |
Wallquist, et al., “Superconducting Qubit Network with Controllable Nearest-Neighbor Coupling,” New Journal of Physics 7(178), 24 pages. 2005. |
Wang, et al., “Fast Entanglement of Two Charge-Phase Qubits Through Nonadiabatic Couling to a Large Josephson Junction,” Physical Review B 70:224515-1 224515-4, 2004. |
Wendin, et al., “Superconducting Quantum Circuits, Qubits and Computing,” arXiv:cond-mat/0508729, 2005, 60 pages. |
Wendin, et al., “Superconducting Quantum Circuits, Qubits and Computing,” arXiv:cond-mat/0508729v1 [cond-mat.supr-con], Aug. 30, 2005, 60 pages. |
Yamamoto, et al., “Demonstration of conditional gate operation using superconducting charge qubits”, Nature, Oct. 30, 2003. https://www.nature.com/articles/nature02015. |
You, et al., “Controllable Manipulation and Entanglement of Macroscopic Quantum States in Coupled Charge Qubits,” Physical Review B 68:024510-1-024510-8, 2003. |
You, et al., “Scalable Quantum Computing with Josephson Charge Qubits,” Physical Review Letters 89(19): 197902-1-197902-4, 2002. |
Zagoskin, et al., “Quantum Two-Level Systems in Josephson Junctions as Naturally Formed Qubits,” Physical Review Letters 97:077001-1-077001-4, 2006. |
Barends, R., et al., “Coherent Josephson qubit suitable for scalable quantum integrated circuits,” arXiv:1304.2322v1 [quant-ph], Apr. 8, 2013, 10 pages. |
Hutter, et al., “Tunable Coupling of qubits: nonadiabatic corrections”, arXiv:cond-mat/0602086v2, May 12, 2006. https://arxiv.org/abs/cond-mat/0602086. |
Number | Date | Country | |
---|---|---|---|
20180314970 A1 | Nov 2018 | US |
Number | Date | Country | |
---|---|---|---|
61894267 | Oct 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14520139 | Oct 2014 | US |
Child | 16029040 | US |