Effective fault-tolerant quantum computation with slow measurements
David P. DiVincenzo, Panos Aliferis
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.
Create a lesson
Related papers
Marginal spectral distributions on regular bipartite unitary orbits
Lin Zhang
Quantum Imaginary Time Evolution on an Infinite 1D Chain
Hao-Ti Hung, Tung Tsao, Ying-Jer Kao
Exact quantum splitting and the structure of finite algebras
Muhammad Imran
Quantum-interference metrology of dissipative Kerr solitons
Yun-Ru Fan, Yong Geng, Ji Liu et al.
Indirect stabilization of N -level quantum systems
Francesca Carlotta Chittaro
Best Annealing Path of Quantum Annealing via Efficient Adiabatic Phase Transition
Kiyotaka Murashima