Loss Tolerance in One-Way Quantum Computation via Counterfactual Error Correction
Open accessAbstract
We introduce a scheme for fault tolerantly dealing with losses (or other "leakage" errors) in cluster state computation that can tolerate up to 50% qubit loss. This is achieved passively using an adaptive strategy of measurement--no coherent measurements or coherent correction is required. Since the scheme relies on inferring information about what would have been the outcome of a measurement had one been able to carry it out, we call this counterfactual error correction.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Ralph et al. (2005) and Varnava et al. (2006, 2008) designed loss-tolerant quantum computer schemes within the circuit-model and one-way model; the latter scheme can tolerate an overall optical loss, including source inefficiency and collection loss, up to 33%.
“For photon loss alone, Ralph et al. (2005) and Varnava et al. (2006) and(2008) have designed loss-tolerant quantum computer schemes within the circuit-model and one-way model; the latter scheme can tolerate an overall optical loss, including source inefficiency and collection loss, up to an impressive 33%.”
From Multiphoton entanglement and interferometry (2012) · cites this paper as Varnava et al. (2006)
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
Experimental — accuracy not yet measuredThe one-way quantum computer may be advantageously combined with the KLM scheme of optical quantum computation, and fault-tolerant schemes using photons have been developed.
“First, after it was realized 37,42,68 that the one-way quantum computer may be advantageously combined with the KLM scheme of optical quantum computation 7 and fault-tolerant schemes using photons were developed 69-71 .”
From Measurement-based quantum computation (2009) · cites this paper as [71]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
<i>Quantum Computation and Quantum Information</i>
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895 · see citing works
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 20,449 · see citing works
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880 · see citing works
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406 · see citing works
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477 · see citing works
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 · see citing works
Self-citationUniversal 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 · see citing works
Dieks, D. (1982) · Physics Letters A · doi:10.1016/0375-9601(82)90084-6 · Cited by 1,461 · see citing works
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · see citing works
Entanglement of Atoms via Cold Controlled Collisions
Jaksch, D., Briegel, H.-J., Cirac, J. I., Gardiner, C. W., & Zoller, P. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1975 · Cited by 795 · see citing works
Resource-Efficient Linear Optical Quantum Computation
Browne, D. E., & Rudolph, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010501 · Cited by 790 · see citing works
Self-citationOptical Quantum Computation Using Cluster States
Nielsen, M. A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040503 · Cited by 614 · see citing works
Efficient high-fidelity quantum computation using matter qubits and linear optics
Barrett, S. D., & Kok, P. (2005) · Physical Review A · doi:10.1103/physreva.71.060310 · Cited by 614 · see citing works
Quantum computation by measurement and quantum memory
Nielsen, M. A. (2003) · Physics Letters A · doi:10.1016/s0375-9601(02)01803-0 · Cited by 210 · see citing works
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 · see citing works
Noise Thresholds for Optical Quantum Computers
Dawson, C. M., Haselgrove, H. L., & Nielsen, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.020501 · Cited by 127 · see citing works
Simple proof of fault tolerance in the graph-state model
Aliferis, P., & Leung, D. (2006) · Physical Review A · doi:10.1103/physreva.73.032308 · Cited by 56 · see citing works
Thresholds for linear optics quantum computing with photon loss at the detectors
Silva, M. P. D., Rötteler, M., & Zalka, C. (2005) · Physical Review A · doi:10.1103/physreva.72.032307 · Cited by 14 · see citing works
Flagged first, then by citations
Research works printed but not linked: 2
- [18]D. Jaksch, H.J. Briegel, J.I. Cirac, C.W. Gardiner and P. Zoller, Phys. Rev. Lett. 82, 1975 (1999).
- [21]S. Bravyi and A. Kitaev, Phys. Rev. A 71, 022316 (2005).
Cited by
Sorted by citations
Multiphoton entanglement and interferometry
Pan, J.-W., Chen, Z.-B., Lu, C.-Y., Weinfurter, H., Zeilinger, A., & Żukowski, M. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.777 · Cited by 1,410 · see citing works
“Loss tolerance for optical quantum computing has been considered by Ralph et al. (2005) and Varnava et al. (2006).”
BackgroundMeasurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090 · see citing works
Self-citationExperimental entanglement of six photons in graph states
Lu, C.-Y., Zhou, X.-Q., Gühne, O., Gao, W.-B., Zhang, J., Yuan, Z.-S., Goebel, A., Yang, T., & Pan, J.-W. (2007) · Nature Physics · doi:10.1038/nphys507 · Cited by 683 · see citing works
Photonic quantum information processing: a concise review
Slussarenko, S., & Pryde, G. J. (2019) · Applied Physics Reviews · doi:10.1063/1.5115814 · Cited by 644 · see citing works
Efficient quantum memory for light
Hedges, M. P., Longdell, J. J., Li, Y., & Sellars, M. J. (2010) · Nature · doi:10.1038/nature09081 · Cited by 617 · see citing works
All-photonic quantum repeaters
Azuma, K., Tamaki, K., & Lo, H.-K. (2015) · Nature Communications · doi:10.1038/ncomms7787 · Cited by 583 · see citing works
Why I am optimistic about the silicon-photonic route to quantum computing
Rudolph, T. (2017) · APL Photonics · doi:10.1063/1.4976737 · Cited by 350 · see citing works
Self-citationVarnava, M., Browne, D. E., & Rudolph, T. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.060502 · Cited by 248 · see citing works
Self-citationPercolation, Renormalization, and Quantum Computing with Nondeterministic Gates
Kieling, K., Rudolph, T., & Eisert, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.130501 · Cited by 121 · see citing works
Self-citationCluster state preparation using gates operating at arbitrary success probabilities
Kieling, K., Gross, D., & Eisert, J. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/200 · Cited by 21 · see citing works
- Authors
- Varnava, M., Browne, D. E., & Rudolph, T.
- Affiliations
- Imperial College London (GB)
- ORCID
- Rudolph, Terry
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2006-09-20
- Volume
- 97
- Issue
- 12
- Pages
- 120501-120501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2102825574
- Cited by
- 203
- References
- 18
- Citations by year
- 2026: 16 · 2025: 13 · 2024: 12 · 2023: 21 · 2022: 13 · 2021: 14 · 2020: 12 · 2019: 11 · 2018: 8 · 2017: 8 · 2016: 1 · 2015: 11 · 2014: 5 · 2013: 7 · 2012: 5
- FWCI
- 10.65
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review Letters (publishedVersion)
- arXiv (Cornell University) (publishedVersion)
- PubMed (publishedVersion)
- UCL Discovery (University College London) (publishedVersion)
- UCL Discovery (University College London) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Engineering and Physical Sciences Research Council (GR/S51226/01)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- loss tolerance, one-way quantum computation, fault tolerance, leakage error, adaptive measurement, quantum error correction
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
