Thresholds for Universal Concatenated Quantum Codes.

Quantum error correction and fault tolerance make it possible to perform quantum computations in the presence of imprecision and imperfections of realistic devices. An important question is to find the noise rate at which errors can be arbitrarily suppressed. By concatenating the 7-qubit Steane and 15-qubit Reed-Muller codes, the 105-qubit code enables a universal set of fault-tolerant gates despite not all of them being transversal. Importantly, the cnot gate remains transversal in both codes, and as such has increased error protection relative to the other single qubit logical gates. We show that while the level-1 pseudothreshold for the concatenated scheme is limited by the logical Hadamard gate, the error suppression of the logical cnot gates allows for the asymptotic threshold to increase by orders of magnitude at higher levels. We establish a lower bound of 1.28×10^{-3} for the asymptotic threshold of this code, which is competitive with known concatenated models and does not rely on ancillary magic state preparation for universal computation.

[1]  Jim Harrington,et al.  Gauge color codes in two dimensions , 2015, 1512.04193.

[2]  Ben Reichardt,et al.  Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code , 2011, Quantum Inf. Comput..

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

[4]  David Poulin,et al.  Fault-tolerant conversion between the Steane and Reed-Muller quantum codes. , 2014, Physical review letters.

[5]  Alfred V. Aho,et al.  A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing , 2006, Quantum Inf. Comput..

[6]  John Preskill,et al.  Quantum accuracy threshold for concatenated distance-3 codes , 2006, Quantum Inf. Comput..

[7]  Bryan Eastin,et al.  Restrictions on transversal encoded quantum gate sets. , 2008, Physical review letters.

[8]  H. Bombin,et al.  Dimensional Jump in Quantum Error Correction , 2014, 1412.5079.

[9]  Dorit Aharonov,et al.  Fault-tolerant quantum computation with constant error , 1997, STOC '97.

[10]  A. Kitaev,et al.  Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages) , 2004, quant-ph/0403025.

[11]  E. Knill,et al.  Resilient Quantum Computation , 1998 .

[12]  Andrew Steane,et al.  Active Stabilization, Quantum Computation, and Quantum State Synthesis , 1997 .

[13]  J. Preskill Reliable quantum computers , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[14]  Adam Paetznick,et al.  Universal fault-tolerant quantum computation with only transversal gates and error correction. , 2013, Physical review letters.

[15]  Stephen D. Bartlett,et al.  Stacked codes: Universal fault-tolerant quantum computation in a two-dimensional layout , 2015, 1509.04255.

[16]  M. Mariantoni,et al.  Surface codes: Towards practical large-scale quantum computation , 2012, 1208.0928.

[17]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

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

[19]  Borzoo Bonakdarpour,et al.  Active Stabilization , 2011, SSS.

[20]  Raymond Laflamme,et al.  Using concatenated quantum codes for universal fault-tolerant quantum gates. , 2013, Physical review letters.