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

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

Quantum Walk Algorithm for Element Distinctness

Ambainis, Andris·2007·SIAM Journal on Computing

Abstract

We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element distinctness (the problem of finding two equal items among N given items), we get an $O(N^{2/3})$ query quantum algorithm. This improves the previous $O(N^{3/4})$ quantum algorithm of Buhrman et al. [SIAM J. Comput., 34 (2005), pp. 1324–1330] and matches the lower bound of Aaronson and Shi [J. ACM, 51 (2004), pp. 595–605]. We also give an $O(N^{k/(k+1)})$ query quantum algorithm for the generalization of element distinctness in which we have to find k equal items among N items.

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.1137/s0097539705447311

Cites

28 of 28 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 28 references

Research works printed but not linked: 15

  1. Aaronson S., 2005, Theory Comput., 1, 147
  2. Preliminary version in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, 2003, pp. 200–209.
  3. D. Aharonov, Quantum computation—a review , in Annual Reviews of Computational Physics, vol. VI, D. Stauffer, ed., World Scientific, River Edge, NJ, 1999, pp. 259–346.
  4. 10.4086/toc.2005.v001a003 · doi:10.4086/toc.2005.v001a003
  5. A. Ambainis, Quantum query algorithms and lower bounds , in Classical and New Paradigms of Computation and Their Complexity Hierarchies, Trends Log. Stud. Log. Libr. 23, Kluwer, Dordrecht, The Netherlands, 2004, pp. 15–32.
  6. 10.1145/636865.636867 · doi:10.1145/636865.636867
  7. Preliminary version in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 169–179.
  8. P. Benioff, Space Searches with a Quantum Robot , in Quantum Computation and Information: A Millennium Volume, Contemp. Math. 305, AMS, Providence, RI, 2002, pp. 1–12.
  9. H. Buhrman and R. Špalek, Quantum verification of matrix products , in Proceedings of the 17th Annual ACM–SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2006, pp. 880–889.
  10. G. Brassard, P. Høyer, M. Mosca, and A. Tapp, Quantum amplitude amplification and estimation , in Quantum Computation and Information: A Millennium Volume, Contemp. Math. 305, AMS, Providence, RI, 2002, pp. 53–74.
  11. T. Itoh, T. Nagatani, and J. Tarui, Explicit construction of k ‐wise nearly random permutations by Feistel transform , in Workshop on Randomness and Computation, Sendai, Japan, 2005, pp. 15–16.
  12. 10.4086/toc.2005.v001a002 · doi:10.4086/toc.2005.v001a002
  13. F. Magniez, M. Santha, and M. Szegedy, Quantum algorithms for the triangle problem , in Proceedings of the 16th Annual ACM–SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2005, pp. 1109–1117.
  14. 10.1137/S0097539793250767 · doi:10.1137/s0097539793250767
  15. A. Yao, Near‐optimal time‐space tradeoff for element distinctness , in Proceedings of the 29th Annual Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1988, pp. 91–97.

Cited by

See all 703

Metadata

Authors
Ambainis, A.
Venue
SIAM Journal on Computing
Published
2007-01
Volume
37
Issue
1
Pages
210-239
ISSN
  • 0097-5397 (ISSN-L)
  • 1095-7111
OpenAlex
W2058286540
Cited by
703
References
28
FWCI
24.82
Type
journal article
Language
en
Open access
closed

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 Walk Algorithm for Element Distinctness. https://app.cochat.ai/papers/10.1137/s0097539705447311
The paper
Ambainis, A. (2007). Quantum Walk Algorithm for Element Distinctness. SIAM Journal on Computing. https://doi.org/10.1137/s0097539705447311

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.