Effective fault-tolerant quantum computation with slow measurements

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 1,000 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.

9 pages, 11 figures. v2: small changes and reference additions

References in corpus (1)

• Introduction to Quantum Computation

Cited by in corpus (11)

• Distributed Quantum Computation Based-on Small Quantum Registers
• Two-dimensional cavity grid for scalable quantum computation with superconducting circuits
• Fault-tolerant quantum computation versus Gaussian noise
• Asymmetric quantum error correction via code conversion
• Error correction optimisation in the presence of X/Z asymmetry
• Long-range coupling and scalable architecture for superconducting flux qubits
• Error-detection-based quantum fault tolerance against discrete Pauli noise
• Hamiltonian Formulation of Quantum Error Correction and Correlated Noise: The Effects Of Syndrome Extraction in the Long Time Limit
• Fault-tolerant linear optics quantum computation by error-detecting quantum state transfer
• Message passing in fault tolerant quantum error correction
• Quantum serial turbo-codes