Fault Tolerance with Noisy and Slow Measurements and Preparation
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
It is not so well known that measurement-free quantum error correction protocols can be designed to achieve fault-tolerant quantum computing. Despite their potential advantages in terms of the relaxation of accuracy, speed, and addressing requirements, they have usually been overlooked since they are expected to yield a very bad threshold. We show that this is not the case. We design fault-tolerant circuits for the 9-qubit Bacon-Shor code and find an error threshold for unitary gates and preparation of p((p,g)thresh)=3.76×10(-5) (30% of the best known result for the same code using measurement) while admitting up to 1/3 error rates for measurements and allocating no constraints on measurement speed. We further show that demanding gate error rates sufficiently below the threshold pushes the preparation threshold up to p((p)thresh)=1/3.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525
Multiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Science · doi:10.1126/science.279.5349.342 · Cited by 663
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Operator quantum error-correcting subsystems for self-correcting quantum memories
Bacon, D. (2006) · Physical Review A · doi:10.1103/physreva.73.012340 · Cited by 486
High-Fidelity Readout of Trapped-Ion Qubits
Myerson, A. H., Szwer, D. J., Webster, S. C., Allcock, D. T. C., Curtis, M. J., Imreh, G., Sherman, J. A., Stacey, D. N., Steane, A. M., & Lucas, D. M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.200502 · Cited by 334
Three-body interactions with cold polar molecules
Büchler, H. P., Micheli, A., & Zoller, P. (2007) · Nature Physics · doi:10.1038/nphys678 · Cited by 277
Cited by
Quantum simulation and computing with Rydberg-interacting qubits
Morgado, M., & Whitlock, S. (2021) · AVS Quantum Science · doi:10.1116/5.0036562 · Cited by 370
“Premakumar, Saffman, and Joynt 315 recently showed that measurement free error correction 316,317 could be efficiently implemented using C k NOT gates (controlled by ancilla qubits) which are native to the Rydberg platform.”
MethodExperimental Repetitive Quantum Error Correction
Schindler, P., Barreiro, J. T., Monz, T., Nebendahl, V., Nigg, D., Chwalla, M., Hennrich, M., & Blatt, R. (2011) · Science · doi:10.1126/science.1203329 · Cited by 356
A crossbar network for silicon quantum dot qubits
Li, R., Petit, L., Franke, D. P., Dehollain, J. P., Helsen, J., Steudtner, M., Thomas, N. K., Yoscovits, Z. R., Singh, K. J., Wehner, S., et al. (2018) · Science Advances · doi:10.1126/sciadv.aar3960 · Cited by 274
Quantum Attacks on Bitcoin, and How to Protect Against Them
Aggarwal, D., Brennen, G., Lee, T., Santha, M., & Tomamichel, M. (2018) · Ledger · doi:10.5195/ledger.2018.127 · Cited by 231
Self-citationEfficient fault-tolerant code switching via one-way transversal CNOT gates
Heußen, S., & Hilder, J. (2025) · Quantum · doi:10.22331/q-2025-09-03-1846 · Cited by 12
Metadata
- Authors
- Paz-Silva, G. A., Brennen, G. K., & Twamley, J.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2010-08-30
- Volume
- 105
- Issue
- 10
- Pages
- 100501-100501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1582825789
- Cited by
- 37
- References
- 10
- FWCI
- 2.72
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.