Software-based Pauli tracking in fault-tolerant quantum circuits

The realisation of large-scale quantum computing is no longer simply a hardware question. The rapid development of quantum technology has resulted in dozens of control and programming problems that should be directed towards the classical computer science and engineering community. One such problem is known as Pauli tracking. Methods for implementing quantum algorithms that are compatible with crucial error correction technology utilise extensive quantum teleportation protocols. These protocols are intrinsically probabilistic and result in correction operators that occur as byproducts of teleportation. These byproduct operators do not need to be corrected in the quantum hardware itself, but are tracked through the circuit and output results reinterpreted. This tracking is routinely ignored in quantum information as it is assumed that tracking algorithms will eventually be developed. In this work we help fill this gap and present an algorithm for tracking byproduct operators through a quantum computation.

[1]  Howard E. Brandt,et al.  Quantum computation and information : AMS Special Session Quantum Computation and Information, January 19-21, 2000, Washington, D.C. , 2002 .

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

[3]  Olga Smirnova,et al.  Nature in London , 2016 .

[4]  Igor L. Markov,et al.  Synthesis and optimization of reversible circuits—a survey , 2011, CSUR.

[5]  A. V. Gorshkov,et al.  Scalable architecture for a room temperature solid-state quantum information processor , 2010, Nature Communications.

[6]  Simon J. Devitt,et al.  Synthesis of topological quantum circuits , 2012, 2012 IEEE/ACM International Symposium on Nanoscale Architectures (NANOARCH).

[7]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[8]  Simone Severini,et al.  Translation Techniques Between Quantum Circuit Architectures , 2007 .

[9]  W. Munro,et al.  Architectural design for a topological cluster state quantum computer , 2008, 0808.1782.

[10]  Tracy Larrabee,et al.  Test pattern generation using Boolean satisfiability , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[12]  W. Munro,et al.  Quantum error correction for beginners , 2009, Reports on progress in physics. Physical Society.

[13]  Robert Wille,et al.  Synthesis of quantum circuits for linear nearest neighbor architectures , 2011, Quantum Inf. Process..

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

[15]  Robert Raussendorf,et al.  Topological fault-tolerance in cluster state quantum computation , 2007 .

[16]  R. V. Meter,et al.  DISTRIBUTED QUANTUM COMPUTATION ARCHITECTURE USING SEMICONDUCTOR NANOPHOTONICS , 2009, 0906.2686.

[17]  R. V. Meter,et al.  A Layered Architecture for Quantum Computing Using Quantum Dots , 2010 .

[18]  Bernd Becker,et al.  Implication Graph Compression inside the SMT Solver iSAT3 , 2014, MBMV.

[19]  Kae Nemoto,et al.  Requirements for fault-tolerant factoring on an atom-optics quantum computer , 2012, Nature Communications.

[20]  Bernd Becker,et al.  Accurate Multi-cycle ATPG in Presence of X-Values , 2013, 2013 22nd Asian Test Symposium.

[21]  Amílcar Sernadas,et al.  Quantum Computation and Information , 2006 .

[22]  C. M. Chandrashekar,et al.  Quantum information processing using nuclear and electron magnetic resonance: review and prospects , 2007, 0710.1447.