ABSTRACT
Quantum computing can become scalable through error correction, but logical error rates only decrease with system size when physical errors are sufficiently uncorrelated. During computation, unused high energy levels of the qubits can become excited, creating leakage states that are long-lived and mobile. Particularly for superconducting transmon qubits, this leakage opens a path to errors that are correlated in space and time. Here, we report a reset protocol that returns a qubit to the ground state from all relevant higher level states. We test its performance with the bit-flip stabilizer code, a simplified version of the surface code for quantum error correction. We investigate the accumulation and dynamics of leakage during error correction. Using this protocol, we find lower rates of logical errors and an improved scaling and stability of error suppression with increasing qubit number. This demonstration provides a key step on the path towards scalable quantum computing.
ABSTRACT
Leakage errors occur when a quantum system leaves the two-level qubit subspace. Reducing these errors is critically important for quantum error correction to be viable. To quantify leakage errors, we use randomized benchmarking in conjunction with measurement of the leakage population. We characterize single qubit gates in a superconducting qubit, and by refining our use of derivative reduction by adiabatic gate pulse shaping along with detuning of the pulses, we obtain gate errors consistently below 10^{-3} and leakage rates at the 10^{-5} level. With the control optimized, we find that a significant portion of the remaining leakage is due to incoherent heating of the qubit.
ABSTRACT
The creation of a quantum network requires the distribution of coherent information across macroscopic distances. We demonstrate the entanglement of two superconducting qubits, separated by more than a meter of coaxial cable, by designing a joint measurement that probabilistically projects onto an entangled state. By using a continuous measurement scheme, we are further able to observe single quantum trajectories of the joint two-qubit state, confirming the validity of the quantum Bayesian formalism for a cascaded system. Our results allow us to resolve the dynamics of continuous projection onto the entangled manifold, in quantitative agreement with theory.
ABSTRACT
A quantum computer can solve hard problems, such as prime factoring, database searching and quantum simulation, at the cost of needing to protect fragile quantum states from error. Quantum error correction provides this protection by distributing a logical state among many physical quantum bits (qubits) by means of quantum entanglement. Superconductivity is a useful phenomenon in this regard, because it allows the construction of large quantum circuits and is compatible with microfabrication. For superconducting qubits, the surface code approach to quantum computing is a natural choice for error correction, because it uses only nearest-neighbour coupling and rapidly cycled entangling gates. The gate fidelity requirements are modest: the per-step fidelity threshold is only about 99 per cent. Here we demonstrate a universal set of logic gates in a superconducting multi-qubit processor, achieving an average single-qubit gate fidelity of 99.92 per cent and a two-qubit gate fidelity of up to 99.4 per cent. This places Josephson quantum computing at the fault-tolerance threshold for surface code error correction. Our quantum processor is a first step towards the surface code, using five qubits arranged in a linear array with nearest-neighbour coupling. As a further demonstration, we construct a five-qubit Greenberger-Horne-Zeilinger state using the complete circuit and full set of gates. The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.
ABSTRACT
A fundamental challenge for quantum information processing is reducing the impact of environmentally induced errors. Here we demonstrate a quantum error detection and rejection protocol based on the idea of quantum uncollapsing, using this protocol to reduce the impact of energy relaxation owing to the environment in a three-qubit superconducting circuit. We encode quantum information in a target qubit, and use the other two qubits to detect and reject errors caused by energy relaxation. This protocol improves the storage time of a quantum state by a factor of roughly three, at the cost of a reduced probability of success. This constitutes the first experimental demonstration of the algorithm-based improvement in the lifetime of a quantum state stored in a qubit.
ABSTRACT
The act of measurement bridges the quantum and classical worlds by projecting a superposition of possible states into a single (probabilistic) outcome. The timescale of this 'instantaneous' process can be stretched using weak measurements, such that it takes the form of a gradual random walk towards a final state. Remarkably, the interim measurement record is sufficient to continuously track and steer the quantum state using feedback. Here we implement quantum feedback control in a solid-state system, namely a superconducting quantum bit (qubit) coupled to a microwave cavity. A weak measurement of the qubit is implemented by probing the cavity with microwave photons, maintaining its average occupation at less than one photon. These photons are then directed to a high-bandwidth, quantum-noise-limited amplifier, which allows real-time monitoring of the state of the cavity (and, hence, that of the qubit) with high fidelity. We demonstrate quantum feedback control by inhibiting the decay of Rabi oscillations, allowing them to persist indefinitely. Such an ability permits the active suppression of decoherence and enables a method of quantum error correction based on weak continuous measurements. Other applications include quantum state stabilization, entanglement generation using measurement, state purification and adaptive measurements.
ABSTRACT
The von Neumann architecture for a classical computer comprises a central processing unit and a memory holding instructions and data. We demonstrate a quantum central processing unit that exchanges data with a quantum random-access memory integrated on a chip, with instructions stored on a classical computer. We test our quantum machine by executing codes that involve seven quantum elements: Two superconducting qubits coupled through a quantum bus, two quantum memories, and two zeroing registers. Two vital algorithms for quantum computing are demonstrated, the quantum Fourier transform, with 66% process fidelity, and the three-qubit Toffoli-class OR phase gate, with 98% phase fidelity. Our results, in combination especially with longer qubit coherence, illustrate a potentially viable approach to factoring numbers and implementing simple quantum error correction codes.
ABSTRACT
We study noise-induced switching of a system close to bifurcation parameter values where the number of stable states changes. For non-Gaussian noise, the switching exponent, which gives the logarithm of the switching rate, displays a non-power-law dependence on the distance to the bifurcation point. This dependence is found for Poisson noise. Even weak additional Gaussian noise dominates switching sufficiently close to the bifurcation point, leading to a crossover in the behavior of the switching exponent.
ABSTRACT
Measurement is one of the fundamental building blocks of quantum-information processing systems. Partial measurement, where full wavefunction collapse is not the only outcome, provides a detailed test of the measurement process. We introduce quantum-state tomography in a superconducting qubit that exhibits high-fidelity single-shot measurement. For the two probabilistic outcomes of partial measurement, we find either a full collapse or a coherent yet nonunitary evolution of the state. This latter behavior explicitly confirms modern quantum-measurement theory and may prove important for error-correction algorithms in quantum computation.