Simple proof of fault tolerance in the graph-state model
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
We consider the problem of fault tolerance in the graph-state model of quantum computation. Using the notion of composable simulations, we provide a simple proof for the existence of an accuracy threshold for graph-state computation by invoking the threshold theorem derived for quantum circuit computation. Lower bounds for the threshold in the graph-state model are then obtained from known bounds in the circuit model under the same noise process.
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
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
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
Quantum accuracy threshold for concatenated distance-3 code
Aliferis, P., Gottesman, D., & Preskill, J. (2006) · Quantum Information and Computation · doi:10.26421/qic6.2-1 · Cited by 412
Self-citationOverhead and noise threshold of fault-tolerant quantum error correction
Steane, A. M. (2003) · Physical Review A · doi:10.1103/physreva.68.042322 · Cited by 372
Resilient quantum computation: error models and thresholds
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0166 · Cited by 346
Valence-bond states for quantum computation
Verstraete, F., & Cirac, J. I. (2004) · Physical Review A · doi:10.1103/physreva.70.060302 · Cited by 333
Fault-tolerant quantum computation with cluster states
Nielsen, M. A., & Dawson, C. M. (2005) · Physical Review A · doi:10.1103/physreva.71.042323 · Cited by 161
Cited by
Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
Lewenstein, M., Sanpera, A., Ahufinger, V., Damski, B., Sen(De), A., & Sen, U. (2007) · Advances in Physics · doi:10.1080/00018730701223200 · Cited by 2,104
Universal Blind Quantum Computation
Broadbent, A., Fitzsimons, J., & Kashefi, E. (2009) · 2009 50th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.36 · Cited by 521
“Step 8 converts the fault-tolerant circuit to a measurement pattern; it is known that this transformation retains the fault-tolerance property [26], [4].”
BackgroundQuantum accuracy threshold for concatenated distance-3 code
Aliferis, P., Gottesman, D., & Preskill, J. (2006) · Quantum Information and Computation · doi:10.26421/qic6.2-1 · Cited by 412
Self-citationFault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States
Menicucci, N. C. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.120504 · Cited by 371
Proposal for Pulsed On-Demand Sources of Photonic Cluster State Strings
Lindner, N. H., & Rudolph, T. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.113602 · Cited by 339
Cluster-state quantum computation
Nielsen, M. A. (2006) · Reports on Mathematical Physics · doi:10.1016/s0034-4877(06)80014-5 · Cited by 315
Loss Tolerance in One-Way Quantum Computation via Counterfactual Error Correction
Varnava, M., Browne, D. E., & Rudolph, T. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.120501 · Cited by 203
Experimental demonstration of graph-state quantum secret sharing
Bell, B. A., Markham, D., Herrera-Martí, D. A., Marin, A., Wadsworth, W. J., Rarity, J. G., & Tame, M. S. (2014) · Nature Communications · doi:10.1038/ncomms6480 · Cited by 155
Early Fault-Tolerant Quantum Computing
Katabarwa, A., Gratsea, K., Caesura, A., & Johnson, P. D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020101 · Cited by 103
“For a specific quantum error correcting code and a noise model it is then left to prove and find error thresholds, with early works being [16–19]; this continues to be an active area of research [20–23].”
BackgroundFundamentals of universality in one-way quantum computation
Nest, M. V. D., Dür, W., Miyake, A., & Briegel, H. J. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/204 · Cited by 97
Quantum simulation of interacting high-dimensional systems: The influence of noise
Dür, W., Bremner, M. J., & Briegel, H. J. (2008) · Physical Review A · doi:10.1103/physreva.78.052325 · Cited by 41
Metadata
- Authors
- Aliferis, P., & Leung, D. W.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2006-03-08
- Volume
- 73
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2055429837
- Cited by
- 56
- References
- 12
- FWCI
- 8.04
- 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.