Fault-tolerant computing with biased-noise superconducting qubits: a case study

We present a universal scheme of pulsed operations suitable for the IBM oscillator-stabilized flux qubit comprising the controlled-σz (cphase) gate, single-qubit preparations and measurements. Based on numerical simulations, we argue that the error rates for these operations can be as low as about 0.5% and that noise is highly biased, with phase errors being stronger than all other types of errors by a factor of nearly 103. In contrast, the design of a controlled-σx (cnot) gate for this system with an error rate of less than about 1.2% seems extremely challenging. We propose a special encoding that exploits the noise bias allowing us to implement a logicalcnot gate where phase errors and all other types of errors have nearly balanced rates of about 0.4%. Our results illustrate how the design of an encoding scheme can be adjusted and optimized according to the available physical operations and the particular noise characteristics of experimental devices.

[1]  Andrew W. Cross,et al.  A comparative code study for quantum fault tolerance , 2007, Quantum Inf. Comput..

[2]  A. Kerman,et al.  High-fidelity quantum operations on superconducting qubits in the presence of noise. , 2008, Physical review letters.

[3]  John Preskill,et al.  Fault-tolerant quantum computation against biased noise , 2007, 0710.1301.

[4]  David P. DiVincenzo,et al.  Efficient one- and two-qubit pulsed gates for an oscillator-stabilized Josephson qubit , 2007, 0709.1478.

[5]  John Preskill,et al.  Accuracy threshold for postselected quantum computation , 2007, Quantum Inf. Comput..

[6]  M. Ben-Or,et al.  Fault-Tolerant Quantum Computation with Constant Error Rate , 1996, SIAM J. Comput..

[7]  Ben Reichardt,et al.  Fault-Tolerant Quantum Computation , 2016, Encyclopedia of Algorithms.

[8]  R. Fazio,et al.  Robust optimal quantum gates for Josephson charge qubits. , 2006, Physical review letters.

[9]  R. Raussendorf,et al.  Fault-tolerant quantum computation with high threshold in two dimensions. , 2006, Physical review letters.

[10]  Barbara M. Terhal,et al.  Fault-tolerant quantum computation for local leakage faults , 2005, Quantum Inf. Comput..

[11]  A. Kitaev,et al.  Protected qubit based on a superconducting current mirror , 2006, cond-mat/0609441.

[12]  M. Steffen,et al.  Measurement of the Entanglement of Two Superconducting Qubits via State Tomography , 2006, Science.

[13]  D. DiVincenzo,et al.  Decoherence rates in complex Josephson qubit circuits , 2006 .

[14]  D. DiVincenzo,et al.  Experimental demonstration of an oscillator stabilized Josephson flux qubit. , 2006, Physical review letters.

[15]  F. Nori,et al.  Superconducting Circuits and Quantum Information , 2005, quant-ph/0601121.

[16]  D. DiVincenzo,et al.  Efficient evaluation of decoherence rates in complex Josephson circuits , 2005, cond-mat/0510843.

[17]  D. DiVincenzo,et al.  Low-bandwidth control scheme for an oscillator-stabilized Josephson qubit , 2004, cond-mat/0411380.

[18]  E. Knill Quantum computing with realistically noisy devices , 2004, Nature.

[19]  S. Girvin,et al.  Strong coupling of a single photon to a superconducting qubit using circuit quantum electrodynamics , 2004, Nature.

[20]  Yasunobu Nakamura,et al.  Coherent Quantum Dynamics of a Superconducting Flux Qubit , 2003, Science.

[21]  J. Martinis,et al.  Rabi oscillations in a large Josephson-junction qubit. , 2002, Physical review letters.

[22]  M. Devoret,et al.  Manipulating the Quantum State of an Electrical Circuit , 2002, Science.

[23]  Y. Pashkin,et al.  Coherent control of macroscopic quantum states in a single-Cooper-pair box , 1999, Nature.

[24]  E. Knill,et al.  Resilient quantum computation: error models and thresholds , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[25]  M. Ben-Or,et al.  Fault-tolerant quantum computation with constant error , 1996, STOC '97.

[26]  Peter W. Shor,et al.  Fault-tolerant quantum computation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.