The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Quantum lower bounds for the collision and the element distinctness problems
Abstract
Given a function f as an oracle, the collision problem is to find two distinct indexes i and j such that f ( i ) = f ( j ), under the promise that such indexes exist. Since the security of many fundamental cryptographic primitives depends on the hardness of finding collisions, our lower bounds provide evidence for the existence of cryptographic primitives that are immune to quantum cryptanalysis. We prove that any quantum algorithm for finding a collision in an r -to-one function must evaluate the function Ω(( n / r ) 1/3 ) times, where n is the size of the domain and r | n . This matches an upper bound of Brassard, Høyer, and Tapp. No lower bound better than constant was previously known. Our result also implies a quantum lower bound of Ω( n 2/3 ) queries for the element distinctness problem, which is to determine whether n integers are all distinct. The best previous lower bound was Ω(√ n ) queries.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
DeVore, R. A., & Lorentz, G. G. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-02888-9 · Cited by 2,352
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
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
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Quantum Walk Algorithm for Element Distinctness
Ambainis, A. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447311 · Cited by 703
Quantum lower bounds by polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2001) · Journal of the ACM · doi:10.1145/502090.502097 · Cited by 639
Lower bounds for algebraic computation trees
Ben-Or, M. (1983) · Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 · doi:10.1145/800061.808735 · Cited by 521
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
Quantum Walk Algorithm for Element Distinctness
Ambainis, A. (2004) · 45th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.54 · Cited by 216
Quantum lower bounds by polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2002) · Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) · doi:10.1109/sfcs.1998.743485 · Cited by 179
Succinct quantum proofs for properties of finite groups
Watrous, J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892141 · Cited by 175
On the degree of polynomials that approximate symmetric Boolean functions (preliminary version)
Paturi, R. (1992) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/129712.129758 · Cited by 172
Quantum Lower Bounds by Polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9802049 · Cited by 164
Quantum lower bounds by quantum arguments
Ambainis, A. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335394 · Cited by 142
Quantum lower bound for the collision problem
Aaronson, S. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509907.509999 · Cited by 135
Self-citationQuantum lower bounds for the collision and the element distinctness problems
Shi, Y. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181975 · Cited by 121
Self-citationQuantum mechanical algorithms for the nonabelian hidden subgroup problem
Grigni, M., Schulman, L. J., Vazirani, M., & Vazirani, U. V. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380769 · Cited by 120
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
Available, N. A. N., Available, N. A. N., & Available, N. A. N. (2002) · Algorithmica · doi:10.1007/s00453-002-0976-3 · Cited by 95
Quantum algorithms for element distinctness
Buhrman, H., Dürr, C., Heiligman, M., Høyer, P., Magniez, F., Sántha, M., & de Wolf, R. (2002) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2001.933880 · Cited by 94
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
Ambainis, A. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0305179 · Cited by 33
A quantum lower bound for the collision problemPreprint
Kutin, S. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0304162 · Cited by 32
Quantum time-space tradeoffs for sorting
Klauck, H. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780553 · Cited by 29
Quantum Lower Bounds for Collision and Element Distinctness with Small RangePreprint
Ambainis, A. (2003) · arXiv (Cornell University) · Cited by 29
Cited by
Quantum Walk Algorithm for Element Distinctness
Ambainis, A. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447311 · Cited by 703
QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
AMBAINIS, A. (2003) · International Journal of Quantum Information · doi:10.1142/s0219749903000383 · Cited by 632
(2004) · doi:10.1109/focs.2004.53 · Cited by 599
Limits on fundamental limits to computation
Markov, I. L. (2014) · Nature · doi:10.1038/nature13570 · Cited by 494
Random Oracles in a Quantum World
Boneh, D., Dagdelen, Ö., Fischlin, M., Lehmann, A., Schaffner, C., & Zhandry, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_3 · Cited by 449
Metadata
- Authors
- Aaronson, S., & Shi, Y.
- Venue
- Journal of the ACM
- Published
- 2004-07
- Volume
- 51
- Issue
- 4
- Pages
- 595-605
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2034038586
- Cited by
- 328
- References
- 27
- FWCI
- 15.93
- 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.