CoChat
Sign Up
Cited by 79Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

Noise thresholds for optical cluster-state quantum computation

Open access
Dawson, Christopher M., Haselgrove, Henry L., Nielsen, Michael A.·2006·Physical Review A
DOI 10.1103/physreva.73.052306
Open this paper in CoChat — free accountOpen PDF

Abstract

In this paper we do a detailed numerical investigation of the fault-tolerant threshold for optical cluster-state quantum computation. Our noise model allows both photon loss and depolarizing noise, as a general proxy for all types of local noise other than photon loss noise. We obtain a threshold region of allowed pairs of values for the two types of noise. Roughly speaking, our results show that scalable optical quantum computing is possible in the combined presence of both noise types, provided that the loss probability is less than $3\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}3}$ and the depolarization probability is less than ${10}^{\ensuremath{-}4}$. Our fault-tolerant protocol involves a number of innovations, including a method for syndrome extraction known as telecorrection, whereby repeated syndrome measurements are guaranteed to agree. This paper is an extended version of Dawson et al. [Phys. Rev. Lett. 96, 020501 (2006)].

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreva.73.052306

Cites

34 of 34 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Nielsen and Dawson (2005) have shown that the thresholds are respectively <3×10^-3 and <10^-4 for photon loss and depolarizing noise.

    “Nielsen and Dawson (2005) have shown that the thresholds are respectively < 3 × 10 -3 and < 10 -4 for photon loss and depolarizing noise (see also Dawson et al. 2006).”

    From Multiphoton entanglement and interferometry (2012) · cites this paper as Dawson et al. 2006

  • The 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 [70]

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

Flagged first, then by citations

Research works printed but not linked: 18

  1. [25]M. Varnava, D. E. Browne, and T. Rudolph, arXiv:quant-ph/0507036 (2005). · arXiv
  2. [26]T. C. Ralph, A. J. F. Hayes, and A. Gilchrist, Phys. Rev. Lett. 95 , 100501 (2005), arXiv:quant-ph/0501184. · arXiv
  3. [28]M. A. Nielsen, arXiv:quant-ph/0504097 (2005), to appear in Rev. Math. Phys. · arXiv
  4. [29]X. Zhou, D. W. Leung, and I. L. Chuang, Phys. Rev. A 62 , 052316 (2000), arXiv:quant-ph/0002039. · arXiv
  5. [30]E. Knill, R. Laflamme, and W. H. Zurek, Proc. Roy. Soc. A 454 , 365 (1998), arXiv:quant-ph/9702058. · arXiv
  6. [31]P. W. Shor, in Proceedings, 35th Annual Symposium on Fundamentals of Computer Science (IEEE Press, Los Alamitos, 1996), pp. 56-65.
  7. [33]D. Aharonov and M. Ben-Or, arXiv:quant-ph/9906129 (1999). · arXiv
  8. [34]P. Aliferis, D. Gottesman, and J. Preskill, arXiv:quant-ph/0504218 (2005). · arXiv
  9. [35]D. Gottesman, Phys. Rev. A 57 , 127 (1998), arXiv:quant-ph/9702029. · arXiv
  10. [36]D. Gottesman, Ph.D. thesis, California Institute of Technology, Pasadena, CA (1997), arXiv:quant-ph/9705052. · arXiv
  11. [37]J. Preskill, Proc. Roy. Soc. A: Math., Phys. and Eng. 454 , 385 (1998).
  12. [38]B. W. Reichardt, arXiv:quant-ph/0509203 (2005). · arXiv
  13. [40]B. M. Terhal and G. Burkard, Phys. Rev. A 71 , 012336 (2004), arXiv:quant-ph/0402104. · arXiv
  14. [41]A. Steane, arXiv:quant-ph/0202036 (2002). · arXiv
  15. [44]B. W. Reichardt, arXiv:quant-ph/0406025 (2004). · arXiv
  16. [45]K. M. Svore, B. M. Terhal, and D. P. DiVincenzo, Phys. Rev. A 72 , 022317 (2005), arXiv:quant-ph/0410047. · arXiv
  17. [46]K. M. Svore, A. W. Cross, I. L. Chuang, and A. V. Aho, arXiv:quant-ph/0508176 (2005). · arXiv
  18. [47]S. D. Barrett and P. Kok, Phys. Rev. A 71 , 060310 (2005), arXiv:quant-ph/0408040. · arXiv

Cited by

Sorted by citations

Related

Authors
Dawson, C. M., Haselgrove, H. L., & Nielsen, M. A.
Affiliations
  • The University of Queensland (AU)
  • Defence Science and Technology Group (AU)
ORCID
Nielsen, Michael A.
Venue
Physical Review A
Publisher
American Physical Society (APS)
Published
2006-05-09
Volume
73
Issue
5
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
DOI
10.1103/physreva.73.052306
OpenAlex
W1976963132
Cited by
79
References
34
Citations by year
2026: 1 · 2025: 3 · 2024: 3 · 2023: 1 · 2022: 3 · 2021: 2 · 2020: 3 · 2017: 4 · 2016: 4 · 2015: 4 · 2013: 3 · 2012: 4
FWCI
11.77
Type
journal article
Language
en
Open access
Licence
link.aps.org/licenses/aps-default-license (vor)
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
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
fault-tolerant threshold, quantum computing, depolarizing noise, noise threshold, syndrome extraction, scalable quantum computing, noise models

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