Software Pauli Tracking for Quantum Computation

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. Instead, byproduct operators 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. We formulate this work based on quantum gate sets that are compatible with all major forms of quantum error correction and demonstrate the completeness of the algorithm.

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

[2]  A. Politi,et al.  Shor’s Quantum Factoring Algorithm on a Photonic Chip , 2009, Science.

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

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

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

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

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

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

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

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

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

[12]  Israel Koren,et al.  Fault-Tolerant Systems , 2007 .

[13]  Andrew S. Dzurak,et al.  A single-atom electron spin qubit in silicon , 2012, Nature.

[14]  R. Blatt,et al.  Entangled states of trapped atomic ions , 2008, Nature.

[15]  Ronald Hanson,et al.  Coherent manipulation of single spins in semiconductors , 2008, Nature.

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

[17]  Thaddeus D. Ladd,et al.  Complete quantum control of a single quantum dot spin using ultrafast optical pulses , 2008, Nature.

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

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

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

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

[22]  E. Lucero,et al.  Computing prime factors with a Josephson phase qubit quantum processor , 2012, Nature Physics.

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