The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Quantum Walk Algorithm for Element Distinctness
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Probability and computing: randomized algorithms and probabilistic analysis
Mitzenmacher, M., & Upfal, E. (2005) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,824
Quantum amplitude amplification and estimation
Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680
Bernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
Quantum random walks: An introductory overview
Kempe, J. (2003) · Contemporary Physics · doi:10.1080/00107151031000110776 · Cited by 1,413
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Quantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215
Skip lists: a probabilistic alternative to balanced trees
Pugh, W. (1990) · Communications of the ACM · doi:10.1145/78973.78977 · Cited by 1,165
Quantum random-walk search algorithm
Shenvi, N., Kempe, J., & Whaley, K. B. (2003) · Physical Review A · doi:10.1103/physreva.67.052307 · Cited by 1,150
Quantum random walks - an introductory overview
Kempe, J., & Einstein, A. (2003) · Cited by 1,035
Exponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780552 · Cited by 825
A fast and simple randomized parallel algorithm for the maximal independent set problem
Alon, N., Babai, L., & Itai, A. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90019-2 · Cited by 823
Spatial search by quantum walk
Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.022314 · Cited by 725
Complexity measures and decision tree complexity: a survey
Buhrman, H., & de Wolf, R. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00144-x · Cited by 665
Aharonov, D., Ambainis, A., Kempe, J., & Vazirani, U. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380758 · Cited by 654
Self-citationQUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
AMBAINIS, A. (2003) · International Journal of Quantum Information · doi:10.1142/s0219749903000383 · Cited by 632
Self-citation(2004) · doi:10.1109/focs.2004.53 · Cited by 599
An Example of the Difference Between Quantum and Classical Random Walks
Childs, A. M., Farhi, E., & Gutmann, S. (2002) · Quantum Information Processing · doi:10.1023/a:1019609420309 · Cited by 481
Quantum lower bounds for the collision and the element distinctness problems
Aaronson, S., & Shi, Y. (2004) · Journal of the ACM · doi:10.1145/1008731.1008735 · Cited by 328
Quantum cryptanalysis of hash and claw-free functions: Invited paper
Brassard, G., HØyer, P., & Tapp, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054319 · Cited by 251
Coins Make Quantum Walks Faster
Ambainis, A., Kempe, J., & Rivosh, A. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0402107 · Cited by 245
Self-citationSpatial search and the Dirac equation
Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.042312 · Cited by 146
Quantum Algorithms for Element Distinctness
Buhrman, H., Dürr, C., Heiligman, M., Høyer, P., Magniez, F., Sántha, M., & de Wolf, R. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539702402780 · Cited by 145
Quantum Random Walks Hit Exponentially FasterPreprint
Kempe, J. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0205083 · Cited by 141
A lower bound for randomized algebraic decision trees
Grigoriev, D. Y., Karpiński, M., der Heide, F. M. A., & Smolensky, R. (1996) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/237814.238011 · Cited by 36
Quantum algorithms for subset finding
Childs, A. M., & Eisenberg, J. M. (2005) · Quantum Information and Computation · doi:10.26421/qic5.7-7 · Cited by 36
Research works printed but not linked: 14
- Aaronson S., 2005, Theory Comput., 1, 147
- Preliminary version in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, 2003, pp. 200–209.
- 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.
- 10.4086/toc.2005.v001a003 · doi:10.4086/toc.2005.v001a003
- 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.
- 10.1145/636865.636867 · doi:10.1145/636865.636867
- Preliminary version in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 169–179.
- 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.
- 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.
- 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.
- 10.4086/toc.2005.v001a002 · doi:10.4086/toc.2005.v001a002
- 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.
- 10.1137/S0097539793250767 · doi:10.1137/s0097539793250767
- 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
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Universal Computation by Quantum Walk
Childs, A. M. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.180501 · Cited by 1,002
Universal Computation by Multiparticle Quantum Walk
Childs, A. M., Gosset, D., & Webb, Z. (2013) · Science · doi:10.1126/science.1229957 · Cited by 456
Discrete Single-Photon Quantum Walks with Tunable Decoherence
Broome, M. A., Fedrizzi, A., Lanyon, B. P., Kassal, I., Aspuru-Guzik, A., & White, A. G. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.153602 · Cited by 420
On the Relationship Between Continuous- and Discrete-Time Quantum Walk
Childs, A. M. (2010) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0930-1 · Cited by 411
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
- 29
- 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
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.