Fault Tolerant Quantum Computation with Nondeterministic Gates
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
In certain approaches to quantum computing the operations between qubits are nondeterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components; operations between components should be assumed to be failure prone. In the ultimate limit of this architecture each component contains only one qubit. Here we derive thresholds for fault-tolerant quantum computation under this extreme paradigm. We find that computation is supported for remarkably high failure rates (exceeding 90%) providing that failures are heralded; meanwhile the rate of unknown errors should not exceed 2 in 10(4) operations.
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
Entanglement of single-atom quantum bits at a distance
Moehring, D. L., Maunz, P., Olmschenk, S., Younge, K. C., Matsukevich, D. N., Duan, L.-M., & Monroe, C. (2007) · Nature · doi:10.1038/nature06118 · Cited by 820
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Resource-Efficient Linear Optical Quantum Computation
Browne, D. E., & Rudolph, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010501 · Cited by 790
Optical Quantum Computation Using Cluster States
Nielsen, M. A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040503 · Cited by 614
Proposal for Teleportation of an Atomic State via Cavity Decay
Bose, S., Knight, P. L., Plenio, M. B., & Vedral, V. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.5158 · Cited by 463
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397
Repeat-Until-Success Linear Optics Distributed Quantum Computing
Lim, Y. L., Beige, A., & Kwek, L. C. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.030505 · Cited by 268
Efficient Quantum Computation with Probabilistic Quantum Gates
Duan, L.-M., & Raussendorf, R. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.080503 · Cited by 185
Brokered graph-state quantum computation
Benjamin, S. C., Browne, D. E., Fitzsimons, J., & Morton, J. J. L. (2006) · New Journal of Physics · doi:10.1088/1367-2630/8/8/141 · Cited by 128
Self-citationScalable Generation of Graph-State Entanglement Through Realistic Linear Optics
Bodiya, T. P., & Duan, L.-M. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.143601 · Cited by 81
Optical generation of matter qubit graph states
Benjamin, S. C., Eisert, J., & Stace, T. M. (2005) · New Journal of Physics · doi:10.1088/1367-2630/7/1/194 · Cited by 50
Self-citation
Cited by
Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects
Monroe, C., Raussendorf, R., Ruthven, A., Brown, K. R., Maunz, P., Duan, L.-M., & Kim, J. (2014) · Physical Review A · doi:10.1103/physreva.89.022317 · Cited by 700
“Hypercell Construction I is based on the snowflake design [59, 60], as shown in Fig.”
BackgroundMethodA Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
Ultrafast and Fault-Tolerant Quantum Communication across Long Distances
Muralidharan, S., Kim, J., Lütkenhaus, N., Lukin, M. D., & Jiang, L. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.250501 · Cited by 290
Fault-tolerant thresholds for quantum error correction with the surface code
Stephens, A. M. (2014) · Physical Review A · doi:10.1103/physreva.89.022321 · Cited by 133
Independent high-purity photons created in domain-engineered crystals
Graffitti, F., Barrow, P., Proietti, M., Kundys, D., & Fedrizzi, A. (2018) · Optica · doi:10.1364/optica.5.000514 · Cited by 95
Metadata
- Authors
- Li, Y., Barrett, S. D., Stace, T. M., & Benjamin, S. C.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2010-12-14
- Volume
- 105
- Issue
- 25
- Pages
- 250502-250502
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1986041645
- Cited by
- 56
- References
- 11
- FWCI
- 6.12
- 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.