Cited By
View all- Paler ADevitt S(2015)An introduction into fault-tolerant quantum computingProceedings of the 52nd Annual Design Automation Conference10.1145/2744769.2747911(1-6)Online publication date: 7-Jun-2015
Software-based pauli tracking in fault-tolerant quantum circuits
Article No.: 124, Pages 1 - 4
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, 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.
References
[1]
T. D. Ladd, F. Jelezko, R. Laflamme, Y. Nakamura, C. Munro & J. L. O'Brien Quantum Computers. Nature (London) 464, 45--53 (2010)
[2]
Cheung, D., Maslov, D. & Severini, S. Translationt techniques between quantum circuit architectures. Workshop on Quantum Information (2013).
[3]
Paler, A. et al. Synthesis of topological quantum circuits. NANOARCH, (2012).
[4]
Saeedi, M. & Markov, I. Synthesis and optimization of reversible circuits---a survey. ACM Computing Surveys 45, 21--34 (2013).
[5]
Saeedi, M., Wille, R. & Drechsler, R. Synthesis of quantum circuits for linear nearest neighbor architectures. Quantum Information Processing 10, 355--377 (2011).
[6]
M. A. Nielsen and I. L. Chuang. Quantum Computation and Information. Cambridge University Press, second edition, 2000.
[7]
Lucero, S. J., Munro, W. J. & Nemoto, K. Quantum Error Correction for Beginners. Rep. Prog. Phys 76, 076001 (2013).
[8]
Bravyi, S. & Kitaev, A. Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A. 71, 022316 (2005).
[9]
Fowler, A., Mariantoni, M., Martinis, J. & Cleland, A. Surface Codes, Towards practical large-scale quantum computation. Phys. Rev. A. 86, 032324 (2012).
[10]
Baugh, J. et al. Quantum Information Processing using Nuclear and Electron Magnetic Resonance: Review and Prospects. Physics in Canada 63, 197--206 (2007).
[11]
Devitt, S. et al. Architectural design for a topological cluster state quantum computer. New. J. Phys. 11, 083032 (2009).
[12]
Yao, N. et al. Scalable Architecture for a Room Temperature Solid-State Quantum Information Processor. Nature Communications 3, 800 (2012).
[13]
Meter, R. V., Ladd, T., Fowler, A. & Yamamoto, Y. Distributed Quantum Computation Architecture Using Semiconductor Nonophotonics. Int. J. Quant. Inf. 8, 295--323 (2010).
[14]
Jones, N. C. et al. A Layered Architecture for Quantum Computing Using Quantum Dots. Phys. Rev. X. 2, 031007 (2012a).
[15]
Devitt, S. J., Stephens, A. M. Munro, W. J., & Nemoto, K. Requirements for fault-tolerant factoring on an atom-optics quantum computer. Nature (communications) 4, 2524, (2013).
[16]
Raussendorf, R., Harrington, J. & Goyal, K. Topological fault-tolerance in cluster state quantum computation. New J. Phys. 9, 199 (2007).
Index Terms
- Software-based pauli tracking in fault-tolerant quantum circuits
Recommendations
Nonclassicality of Dirac–Pauli quantum states
AbstractIn classical physics, a joint measurement of two compatible observables on an enlarged system–apparatus state usually implies that the joint statistics of the corresponding specific system observables are always separable. In this paper, we show ...
Fault-tolerant quantum computation
FOCS '96: Proceedings of the 37th Annual Symposium on Foundations of Computer ScienceIt has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties in realizing quantum computation is that ...
Comments
Information & Contributors
Information
Published In
Sponsors
- EDAA: European Design Automation Association
- ECSI
- EDAC: Electronic Design Automation Consortium
- IEEE Council on Electronic Design Automation (CEDA)
- The Russian Academy of Sciences: The Russian Academy of Sciences
In-Cooperation
Publisher
European Design and Automation Association
Leuven, Belgium
Publication History
Published: 24 March 2014
Check for updates
Qualifiers
- Research-article
Conference
DATE '14
Sponsor:
- EDAA
- EDAC
- The Russian Academy of Sciences
Acceptance Rates
Overall Acceptance Rate 518 of 1,794 submissions, 29%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 47Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025
Other Metrics
Citations
Cited By
View all- Paler ADevitt S(2015)An introduction into fault-tolerant quantum computingProceedings of the 52nd Annual Design Automation Conference10.1145/2744769.2747911(1-6)Online publication date: 7-Jun-2015
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in