arXiv · 2610.32693
Elementary proofs of quantum lower bounds for element distinctness and k-sum
Abstract
We give elementary proofs of the $Ω(n^{2/3})$ quantum query lower bound for element distinctness and the $Ω(n^{k/(k+1)})$ lower bound for the $k$-sum problem, for fixed $k$ and sufficiently large groups. The proofs use only basic properties of quantum states and linear algebra, analyzing the differences of algorithm states on different inputs.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Andris Ambainis, Martins Kokainis. 2026-10-23. Elementary proofs of quantum lower bounds for element distinctness and k-sum. https://arxiv.org/abs/2610.32693
Cite the original work for its findings. Save a collection to share your selection of sources.