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

The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.

On the role of entanglement in quantum-computational speed-up

Open access
Jozsa, Richard, Linden, Noah·2003·Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences

Abstract

For any quantum algorithm operating on pure states, we prove that the presence of multi‐partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an exponential speed‐up over classical computation. Furthermore, we prove that the algorithm can be efficiently simulated classically to within a prescribed tolerance η even if a suitably small amount of global entanglement is present. We explicitly identify the occurrence of increasing multi‐partite entanglement in Shor's algorithm. Our results do not apply to quantum algorithms operating on mixed states in general and we discuss the suggestion that an exponential computational speed‐up might be possible with mixed states in the total absence of entanglement. Finally, despite the essential role of entanglement for pure‐state algorithms, we argue that it is nevertheless misleading to view entanglement as a key resource for quantum‐computational power.

Overview

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.1098/rspa.2002.1097

Cites

20 of 20 references verified0 citation errors · 0 not checkable

Statistics

Verification

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?

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

Flagged first, then by citations

Show all 18 references

Research works printed but not linked: 12

  1. Ambainis A. Schulman L. & Vazirani U. 2000 Proc. 32nd Annual ACM Symp. Theory of Computing. New York: ACM Press.
  2. Bennett C. H., 1997, SIAM J, Computing, 26, 1510
  3. Bernstein E., 1997, SIAM J, Computing, 26, 1411
  4. Braunstein S., 2002, Quant, Informat. Computat., 2, 399
  5. Deutsch D., 1985, Proc, R. Soc. Lond. A, 400, 96
  6. Gottesman D. 1997 Stabiliser codes and quantum error correction. PhD thesis California Institute of Technology Pasadena CA.
  7. Jozsa R. 1998 The geometric universe (ed. S. Huggett L. Mason K. P. Tod S. T. Tsou & N. Woodhouse) pp. 369-379. Oxford University Press.
  8. Nielsen M. 2001 Universal quantum computation using only projective measurement quantum memory and preparation of the 0 state. (Available at http://xxx.arXiv.org/abs/quantph/0108020.)
  9. Nielsen M. & Chuang I. 2000 Quantum computation and quantum information. Cambridge University Press.
  10. Shor P., 1997, SIAM J, Computing, 26, 1484
  11. Simon D., 1997, SIAM J, Computing, 26, 1474
  12. Valiant L. 2001 Proc. 33rd Annual ACM Symp. Theory of Computing. New York: ACM Press.

Cited by

Sorted by citations

Items 201–300 of 837

Metadata

Authors
Jozsa, R., & Linden, N.
Affiliations
University of Bristol (GB)
Venue
Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
Published
2003-08-08
Volume
459
Issue
2036
Pages
2011-2032
ISSN
  • 1364-5021 (ISSN-L)
  • 1471-2946
OpenAlex
W2163036762
Cited by
839
References
18
Citations by year
2026: 30 · 2025: 71 · 2024: 55 · 2023: 61 · 2022: 56 · 2021: 48 · 2020: 46 · 2019: 33 · 2018: 40 · 2017: 33 · 2016: 33 · 2015: 40 · 2014: 36 · 2013: 45 · 2012: 20
FWCI
20.16
Type
journal article
Language
en
Open access
Locations
  • Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Explore Bristol Research (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • Cambridge University Engineering Department Publications Database (submittedVersion)
  • Bristol Research (University of Bristol) (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 entanglement, multipartite entanglement, global entanglement, Shor's algorithm, classical simulation of quantum algorithms, exponential speedup, mixed states

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