L. DiCarlo

Protecting quantum entanglement from leakage and qubit errors via repetitive parity measurements

C. C. Bultink [1,2,3], T. E. O'Brien, R. Vollmer [1,2], N. Muthusubramanian [1,2], M. W. Beekman [1,2], M. A. Rol [1,2], X. Fu [1], B. Tarasinski [1,2], V. Ostroukh [1,2], B. Varbanov [1,2], A. Bruno [1,2], L. DiCarlo [1,2]

Abstract

Protecting quantum information from errors is essential for large-scale quantum computation. Quantum error correction (QEC) encodes information in entangled states of many qubits, and performs parity measurements to identify errors without destroying the encoded information. However, traditional QEC cannot handle leakage from the qubit computational space. Leakage affects leading experimental platforms, based on trapped ions and superconducting circuits, which use effective qubits within many-level physical systems. We investigate how two-transmon entangled states evolve under repeated parity measurements, and demonstrate the use of hidden Markov models to detect leakage using only the record of parity measurement outcomes required for QEC. We show the stabilization of Bell states over up to 26 parity measurements by mitigating leakage using postselection, and correcting qubit errors using Pauli-frame transformations. Our leakage identification method is computationally efficient and thus compatible with real-time leakage tracking and correction in larger quantum processors.

Detecting bit-flip errors in a logical qubit using stabilizer measurements

D. Ristè, S. Poletto [1], M. -Z. Huang [1,2], A. Bruno [1], V. Vesterinen [1], O. -P. Saira [1], L. DiCarlo [1]

Abstract

Quantum data is susceptible to decoherence induced by the environment and to errors in the hardware processing it. A future fault-tolerant quantum computer will use quantum error correction (QEC) to actively protect against both. In the smallest QEC codes, the information in one logical qubit is encoded in a two-dimensional subspace of a larger Hilbert space of multiple physical qubits. For each code, a set of non-demolition multi-qubit measurements, termed stabilizers, can discretize and signal physical qubit errors without collapsing the encoded information. Experimental demonstrations of QEC to date, using nuclear magnetic resonance, trapped ions, photons, superconducting qubits, and NV centers in diamond, have circumvented stabilizers at the cost of decoding at the end of a QEC cycle. This decoding leaves the quantum information vulnerable to physical qubit errors until re-encoding, violating a basic requirement for fault tolerance. Using a five-qubit superconducting processor, we realize the two parity measurements comprising the stabilizers of the three-qubit repetition code protecting one logical qubit from physical bit-flip errors. We construct these stabilizers as parallelized indirect measurements using ancillary qubits, and evidence their non-demolition character by generating three-qubit entanglement from superposition states. We demonstrate stabilizer-based quantum error detection (QED) by subjecting a logical qubit to coherent and incoherent bit-flip errors on its constituent physical qubits. While increased physical qubit coherence times and shorter QED blocks are required to actively safeguard quantum information, this demonstration is a critical step toward larger codes based on multiple parity measurements.

Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor

L. DiCarlo [1], J. M. Chow [1], J. M. Gambetta [2], Lev S. Bishop [1], B. R. Johnson [1], D. I. Schuster [1], J. Majer [3], A. Blais [4], L. Frunzio [1], S. M. Girvin [1], R. J. Schoelkopf [1]

Abstract

By harnessing the superposition and entanglement of physical states, quantum computers could outperform their classical counterparts in solving problems of technological impact, such as factoring large numbers and searching databases. A quantum processor executes algorithms by applying a programmable sequence of gates to an initialized register of qubits, which coherently evolves into a final state containing the result of the computation. Simultaneously meeting the conflicting requirements of long coherence, state preparation, universal gate operations, and qubit readout makes building quantum processors challenging. Few-qubit processors have already been shown in nuclear magnetic resonance, cold ion trap and optical systems, but a solid-state realization has remained an outstanding challenge. Here we demonstrate a two-qubit superconducting processor and the implementation of the Grover search and Deutsch-Jozsa quantum algorithms. We employ a novel two-qubit interaction, tunable in strength by two orders of magnitude on nanosecond time scales, which is mediated by a cavity bus in a circuit quantum electrodynamics (cQED) architecture. This interaction allows generation of highly-entangled states with concurrence up to 94%. Although this processor constitutes an important step in quantum computing with integrated circuits, continuing efforts to increase qubit coherence times, gate performance and register size will be required to fulfill the promise of a scalable technology.