pith. sign in

arxiv: quant-ph/0607047 · v2 · submitted 2006-07-06 · 🪐 quant-ph

Effective fault-tolerant quantum computation with slow measurements

classification 🪐 quant-ph
keywords quantummeasurementcomputationfault-tolerantslowtimesaccuracyappears
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.