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

The DOI matches its Crossref record; 13 of the 15 references it cites were found in a registry or an index, and 2 are not checked yet; none of the 14 sources its claims cite is checked for support yet.

Quantum computers and dissipation

Open access
G. Massimo Palma, Kalle‐Antti Suominen, ARTUR K. EKERT·1996·Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences

Abstract

We analyse dissipation in quantum computation and its destructive impact on efficiency of quantum algorithms. Using a general model of decoherence, we study the time evolution of a quantum register of arbitrary length coupled with an environment of arbitrary coherence length. We discuss relations between decoherence and computational complexity and show that the quantum factorization algorithm must be modified in order to be regarded as efficient and realistic.

Checked 2026-10-06 · 2 references not checked yet

Overview

AI snapshot

Written from the paper’s full text.

TL;DR

The paper analyzes how dissipation/decoherence in quantum computers destroys quantum interference and entanglement, causing the probability of successful computation to decrease exponentially with input size \(L\). It argues that Shor’s factoring algorithm must be modified, e.g. supplemented with exponentially efficient quantum error correction, to be regarded as efficient and realistic.

Key findings

  • If environmental coupling makes the error rate grow as \(\epsilon(L)=1-A\exp(-\alpha L)\), then the required number of repetitions grows as \(k(L)\approx \exp(\alpha L)\), so the randomized factoring algorithm is no longer efficient.
  • In the independent-reservoir limit, the worst-case density-matrix elements decay as \(\exp\{-L\Gamma(t)\}\); for reservoirs with large coherence length, some off-diagonal elements decay as \(\exp\{-\mathrm{poly}(L)\Gamma(t)\}\), which can be more of a hindrance than a help unless selected coherences can be supported.
  • Single-qubit decoherence has three regimes: a “quiet” regime for \(t<\omega_c^{-1}\), a quantum regime for \(\omega_c^{-1}<t<T^{-1}\), and a thermal regime for \(t>T^{-1}\). In one dimension at low temperature, \(\Gamma(t)\sim \omega_c^2 t^2\), then \(\sim 2\ln \omega_c t\), then \(\sim Tt\); in three dimensions the decoherence saturates to a value determined by \(\eta=\omega_c/T\).
  • For two qubits, collective effects produce “subdecoherent” and “superdecoherent” states, with collective decay constants \(\Gamma_\pm(R,t)\); the paper distinguishes superdecoherence from superradiance and notes that some superradiant states are subdecoherent.

Methods

  • Theoretical study of an \(L\)-qubit quantum register coupled to a thermal reservoir, using a decoherence model with Hamiltonian \(H\) containing free qubit, free environment, and qubit-environment interaction terms.
  • Single-qubit decoherence is treated semiclassically via stochastic fluctuating fields and numerically simulated, then fully quantized using field modes, displacement operators, and exact expressions for the reduced density-matrix coherence.
  • The analysis is extended to two qubits and then to \(L\) qubits, comparing independent reservoirs with shared reservoirs and position-dependent couplings; complexity consequences are assessed through randomized-algorithm error amplification.

Limitations

  • The paper states that its model does not describe \(T_1\) processes: populations are unaffected and there is no energy exchange between qubit and environment; it notes that at longer timescales \(T_1\) processes would remove residual coherence in the three-dimensional case.
  • The paper states that the semiclassical approach excludes quantum features, most notably qubit-environment entanglement, and that a fully quantum approach is needed for thermal and vacuum fluctuations.
  • Evident from the text: the conclusion that any thermal-reservoir decoherence model leads to the same complexity conclusion is presented as a plausibility argument, not a proof; the analysis assumes specific coupling/density-of-states forms and does not include direct two-qubit interactions.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1098/rspa.1996.0029

Cites

13 of 15 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

0 of 14 cited sources checked · 0 supported · 0 flagged

Show all 53 claims

  • It may state two separate claims as one. 25
  • Probably not a substantial claim. 7
29 of 29
  • The authors state this as an assumption.

    The environment or reservoir is modeled as a thermal reservoir.

    “When a quantum computer is in contact with an environment, here modeled as a thermal reservoir, the resulting dissipation destroys the coherences and changes the populations (the diagonal elements).”
  • The authors state this as an assumption.

    The quantised environment is modeled as a continuum of field modes.

    “The quantised environment is modeled as a continuum of field modes.”
  • The authors state this as an assumption.

    At time t = 0 the combined qubit-environment state is assumed to have a specified product form involving the thermal density matrix of each field mode.

    “The state of the combined system i.e. qubit + environment is described by a density operator ̺ ( t ) which at time t = 0 is assumed to be in the form”
  • The authors state this as an assumption.

    The dynamics of a single qubit plus environment is described by Hamiltonian (12).

    “We assume that the dynamics of a single qubit + environment is described by the following Hamiltonian”
  • The authors state this as an assumption.

    In the amplification argument, the error rate ǫ is independent of the input.

    “Assuming that ǫ is independent of the input the success probability of the algorithm can be amplified (boosted) arbitrarily close to 1 by repeating the computation several times.”
  • The authors state this as an assumption.

    The frequency dependence of the density of states and coupling is assumed to be (dk/dω)G(ω)|g(ω)|^2 ∝ ω^n e^{-ω/ωc}, with n depending on the number of dimensions.

    “Therefore we assume ( dk/dω ) G ( ω ) | g ( ω ) | 2 ∝ ω n e -ω/ω c .”
  • The authors state this as an assumption.

    All coherences are equally important.

    “Assuming that all coherences are equally important and that for the complexity analysis we choose the worst case (i.e. the off-diagonal element which decays at the fastest rate)”
  • The authors state this as an assumption.

    For the complexity analysis, the worst case is chosen, i.e. the off-diagonal element which decays at the fastest rate.

    “Assuming that all coherences are equally important and that for the complexity analysis we choose the worst case (i.e. the off-diagonal element which decays at the fastest rate)”
  • The authors state this as an assumption.

    All modes of the field are in thermal equilibrium.

    “We can formulate in more rigorous terms the analysis we have just sketched above by taking into account all the modes of the field in thermal equilibrium.”
  • The authors state this as an assumption.

    The position-dependent couplings have the form g_a k = g_k e^{i k·r_a} and g_b k = g_k e^{i k·r_b}.

    “If we suppose g a k = g k e i k · r a and g b k = g k e i k · r b , then, in the continuum limit, the collective decay rates are”
  • The authors state this as an assumption.

    There is no direct interaction between the two qubits.

    “In (25) we are not considering any direct interaction between the two qubits which would be necessary for the conditional dynamics (Barenco et al 1995).”
11 of 11

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

  • Conflicting year for the Deutsch and Jozsa citation

    Minor

    The text cites Deutsch and Jozsa as a 1992 work, but the corresponding reference lists 1989.

1 of 1

Citations

Cites

Flagged first, then by citations

Show all 15 references

Research works printed but not linked: 1

  1. Lenstra A. K. Lenstra H. W. Jr Manasse M. S. & Pollard J. M. 1990 Proc. 22th ACM Symp. j on the Theory of

Cited by

Sorted by citations

Items 501–600 of 878

Metadata

Authors
Palma, G. M., Suominen, K., & EKERT, A. K.
Affiliations
  • University of Oxford (GB)
  • University of Helsinki (FI)
Venue
Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
Published
1996-12-31
Volume
452
Issue
1946
Pages
567-584
ISSN
  • 1364-5021 (ISSN-L)
  • 1471-2946
OpenAlex
W2157754228
Cited by
899
References
15
Citations by year
2026: 10 · 2025: 25 · 2024: 22 · 2023: 26 · 2022: 29 · 2021: 22 · 2020: 23 · 2019: 32 · 2018: 34 · 2017: 35 · 2016: 38 · 2015: 31 · 2014: 29 · 2013: 37 · 2012: 25
FWCI
26.76
Type
journal article
Language
en
Open access
Locations
  • Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences (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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
quantum computing, energy dissipation, decoherence, quantum registers, environment coupling, computational complexity, quantum factoring, Shor's algorithm, algorithm efficiency

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.

A language model drew the claims from the paper on 2026-10-06, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-06 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

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