Effective Fault-Tolerant Quantum Computation with Slow Measurements
- 9 January 2007
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 98 (2), 020501
- https://doi.org/10.1103/physrevlett.98.020501
Abstract
How important is fast measurement for fault-tolerant quantum computation? Using a combination of existing and new ideas, we argue that measurement times as long as even 1000 gate times or more have a very minimal effect on the quantum accuracy threshold. This shows that slow measurement, which appears to be unavoidable in many implementations of quantum computing, poses no essential obstacle to scalability.Keywords
Other Versions
This publication has 11 references indexed in Scilit:
- Quantum computing with realistically noisy devicesNature, 2005
- Overhead and noise threshold of fault-tolerant quantum error correctionPhysical Review A, 2003
- Fault-tolerant quantum computation by anyonsAnnals of Physics, 2003
- Topological quantum memoryJournal of Mathematical Physics, 2002
- A Modular Functor Which is Universal¶for Quantum ComputationCommunications in Mathematical Physics, 2002
- A scheme for efficient quantum computation with linear opticsNature, 2001
- Demonstrating the viability of universal quantum computation using teleportation and single-qubit operationsNature, 1999
- Resilient quantum computation: error models and thresholdsProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Quantum computations: algorithms and error correctionRussian Mathematical Surveys, 1997
- Fault-Tolerant Error Correction with Efficient Quantum CodesPhysical Review Letters, 1996