Software Pauli Tracking for Quantum Computation
arXiv:1401.5872 · doi:10.7873/DATE2014.137
Abstract
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.
arXiv comment5 Pages, 1 figure, Accepted for Design, Automation and Test In Europe (DATE'2014)
References in corpus (11)
- Surface codes: Towards practical large-scale quantum computation
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- A single-atom electron spin qubit in silicon
- Quantum Error Correction for Beginners
- Topological fault-tolerance in cluster state quantum computation
- Shor's quantum factoring algorithm on a photonic chip
- Computing prime factors with a Josephson phase qubit quantum processor
- Synthesis and Optimization of Reversible Circuits - A Survey
- Scalable Architecture for a Room Temperature Solid-State Quantum Information Processor
- Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
- Requirements for fault-tolerant factoring on an atom-optics quantum computer
Cited by in corpus (5)
- Performing Quantum Computing Experiments in the Cloud
- Combining Topological Hardware and Topological Software: Color Code Quantum Computing with Topological Superconductor Networks
- Braiding by Majorana Tracking and Long-Range CNOT Gates with Color Codes
- A Regular Representation of Quantum Circuits
- Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems