Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 806

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

Quantum networks for elementary arithmetic operations

Open access
Vedral, Vlatko, Barenco, Adriano, Ekert, Artur·1996·Physical Review A

Abstract

Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most difficult (time and space consuming) part of Shor's quantum factorizing algorithm. We show that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorized. \textcopyright{} 1996 The American Physical Society.

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.1103/physreva.54.147

Cites

8 of 8 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

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

Show all 8 references

Research works printed but not linked: 11

  1. D. Deutsch, 1992, Proc. R. Soc. London A, 439, 553, 10.1098/rspa.1992.0167 · DOI · Paper page
  2. D. S. Simon, 1994, Proceedings of the 35th Annual Symposium on the Foundations of Computer Science
  3. P. W. Shor, Proceedings of the 35th Annual Symposium on the Theory of Computer Science
  4. D. Deutsch, The Fabric of Reality
  5. D. Deutsch, 1989, Proc. R. Soc. London A, 425, 73, 10.1098/rspa.1989.0099 · DOI · Paper page
  6. C. H Bennett, 1988, IBM J. Res. Dev., 32, 16, 10.1147/rd.321.0016 · DOI · Paper page
  7. T. Toffoli, 1981, Math. Syst. Theory, 14, 13, 10.1007/BF01752388 · DOI
  8. D. E. Knuth, 1981, The Art of Computer Programming, Volume 2: Seminumerical Algorithms
  9. A. Barenco, 1995, Proc. R. Soc. London A, 449, 679, 10.1098/rspa.1995.0066 · DOI · Paper page
  10. D. Deutsch, 1995, Proc. R. Soc. London A, 449, 669, 10.1098/rspa.1995.0065 · DOI · Paper page
  11. A. V. Aho, 1983, Data Structures and Algorithms

Cited by

See all 806

Metadata

Authors
Vedral, V., Barenco, A., & Ekert, A.
Venue
Physical Review A
Published
1996-07-01
Volume
54
Issue
1
Pages
147-153
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2035112473
Cited by
806
References
8
FWCI
15.38
Type
journal article
Language
en
Open access
green

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Quantum networks for elementary arithmetic operations. https://app.cochat.ai/papers/10.1103/physreva.54.147
The paper
Vedral, V., Barenco, A., & Ekert, A. (1996). Quantum networks for elementary arithmetic operations. Physical Review A. https://doi.org/10.1103/physreva.54.147

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.