The robustness of magic state distillation against errors in Clifford gates

Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the Clifford gate set and as such their usefulness for universal quantum computation is of great interest. Clifford group gates augmented by magic state preparation give the possibility of simulating universal quantum computation. However, experimentally one cannot expect to perfectly prepare magic states. Nonetheless, it has been shown that by repeatedly applying operations from the Clifford group and measurements in the Pauli basis, the fidelity of noisy prepared magic states can be increased arbitrarily close to a pure magic state [1]. We investigate the robustness of magic state distillation to perturbations of the initial states to arbitrary locations in the Bloch sphere due to noise. Additionally, we consider a depolarizing noise model on the quantum gates in the decoding section of the distillation protocol and demonstrate its effect on the convergence rate and threshold value. Finally, we establish that faulty magic state distillation is more efficient than fault-tolerance-assisted magic state distillation at low error rates due to the large overhead in the number of quantum gates and qubits required in a fault-tolerance architecture. The ability to perform magic state distillation with noisy gates leads us to conclude that this could be a realistic scheme for future small-scale quantum computing devices as fault-tolerance need only be used in the final steps of the protocol.

[1]  Daniel Gottesman,et al.  Stabilizer Codes and Quantum Error Correction , 1997, quant-ph/9705052.

[2]  Earl T. Campbell,et al.  On the Structure of Protocols for Magic State Distillation , 2009, TCQ.

[3]  Jingfu Zhang,et al.  Experimental magic state distillation for fault-tolerant quantum computing , 2011, Nature Communications.

[4]  M. B. Plenio,et al.  Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers , 2008, 0810.4340.

[5]  Ben Reichardt,et al.  Quantum universality by state distillation , 2006, Quantum Inf. Comput..

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

[7]  Shor,et al.  Scheme for reducing decoherence in quantum computer memory. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[8]  D. Browne,et al.  Qutrit magic state distillation , 2012, 1202.2326.

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

[10]  Scott Aaronson,et al.  Improved Simulation of Stabilizer Circuits , 2004, ArXiv.

[11]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[12]  M. Ben-Or,et al.  Limitations of Noisy Reversible Computation , 1996, quant-ph/9611028.

[13]  Mark Howard,et al.  Tight noise thresholds for quantum computation with perfect stabilizer operations. , 2009, Physical review letters.

[14]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

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

[16]  R. Laflamme,et al.  Randomized benchmarking of single- and multi-qubit control in liquid-state NMR quantum information processing , 2008, 0808.3973.

[17]  Steane,et al.  Error Correcting Codes in Quantum Theory. , 1996, Physical review letters.

[18]  Charles H. Bennett,et al.  Mixed-state entanglement and quantum error correction. , 1996, Physical review. A, Atomic, molecular, and optical physics.

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

[20]  Ben Reichardt,et al.  Quantum Universality from Magic States Distillation Applied to CSS Codes , 2005, Quantum Inf. Process..

[21]  D. Browne,et al.  Bound states for magic state distillation in fault-tolerant quantum computation. , 2009, Physical review letters.

[22]  Jonas T. Anderson On the Power of Reusable Magic States , 2012, 1205.0289.

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

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

[25]  E. Knill Fault-Tolerant Postselected Quantum Computation: Schemes , 2004, quant-ph/0402171.