Cited by 289Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Quantum Computers, Factoring, and Decoherence

Open access
Chuang, I. L., Laflamme, R., Shor, P. W., Zurek, W. H.·1995·Science

Abstract

It is known that quantum computers can dramatically speed up the task of finding factors of large numbers, a problem of practical significance for cryptographic applications. Factors of an L -digit number can be found in ∼ L 2 time [compared to ∼exp( L 1/3 ) time] by a quantum computer, which simultaneously follows all paths corresponding to distinct classical inputs, obtaining the solution from the coherent quantum interference of the alternatives. Here it is shown how the decoherence process degrades the interference pattern that emerges from the quantum factoring algorithm. For a quantum computer performing logical operations, an exponential decay of quantum coherence is inevitable. However, even in the presence of exponential decoherence, quantum computation can be useful as long as a sufficiently low decoherence rate can be achieved to allow meaningful results to be extracted from the calculation.

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.1126/science.270.5242.1633

Cites

18 of 18 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?

  • Gottesman showed that fault-tolerant procedures for the universal set of gates introduced by Shor can be constructed for any stabilizer code, using basically the same technique as Shor for CSS codes, generalized to qupits.

    “After the results were first published, it was shown by Gottesman[32] that fault tolerant procedures for the universal set of gates introduced by Shor can be constructed for any stabilizer code, using basically the same technique as presented by Shor for the CSS codes, a result which was generalized to qupits[33].”

    From Fault-Tolerant Quantum Computation with Constant Error Rate (2008) · cites this paper as [33]

  • Noise, decoherence, and manufacturing problems make constructing large-scale quantum computers difficult.

    “Noise, decoherence, and manufacturing problems make constructing large-scale quantum computers difficult 9-13 .”

    From Experimental realization of a quantum algorithm (1998) · cites this paper as [10]

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: 3

  1. [1][1] R.Graham, D.E.Knuth, and O.Patashnik. Concrete Mathematics . Addison Wesley, 1994. -
  2. [13][13] R. Landauer. Is Quantum Mechanically Coherent Computation Useful? In D.H.Feng and B-L. Hu, editors, Proc. of the Drexel-4 Symposium on quantum Nonintegrability Quantum Classical Correspondence , 1994. -
  3. [15][15] J. P. Paz. unpublished , 1994. Figure 1: Probability distribution for the measurement of c in the state given in Eq.(3) with N = 21, q = 128, x = 5, k = 3. The broadening of the peaks is a result of using discrete Fourier transform with q possible modes; a continuous Fourier transform would have given delta functions. Figure 2: Effect of decoherence on the probability distribution for the measurement of c . The state given by Eq.(8) once a if Fourier transformed. The decoherence parameter Eq.(9) has been taken to be ξ = 0 . 1. The dotted line shows the good agreement of our constant-beta approximation, taking β = 0 . 58. This figure "fig1-1.png" is available in "png" format from: [http://arxiv.org/ps/quant-ph/9503007v1](http://arxiv.org/ps/quant-ph/9503007v1) Figure 1 <!-- image --> This figure "fig1-2.png" is available in "png" format from: [http://arxiv.org/ps/quant-ph/9503007v1](http://arxiv.org/ps/quant-ph/9503007v1) Figure 2 <!-- image -->

Cited by

Sorted by citations

Authors
Chuang, I. L., Laflamme, R., Shor, P. W., & Zurek, W. H.
Affiliations
  • Stanford University (US)
  • Los Alamos National Laboratory (US)
  • AT&T (United States) (US)
Venue
Science
Published
1995-12-08
Volume
270
Issue
5242
Pages
1633-1635
ISSN
  • 0036-8075 (ISSN-L)
  • 1095-9203
OpenAlex
W2107050628
Cited by
289
References
18
Citations by year
2026: 7 · 2025: 8 · 2024: 11 · 2023: 5 · 2022: 10 · 2021: 4 · 2020: 4 · 2019: 3 · 2018: 5 · 2017: 3 · 2016: 3 · 2015: 8 · 2014: 1 · 2013: 8 · 2012: 4
FWCI
37.21
Type
journal article
Language
en
Open access
Locations
  • Science (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 Mechanics and Applications
Keywords
quantum computing hardware, quantum factoring, decoherence, Shor's algorithm, quantum interference, quantum coherence, cryptographic security, decoherence rate

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