A quantum lower bound for the collision problem
Samuel Kutin

TL;DR
This paper improves the understanding of quantum lower bounds for the collision problem by extending Shi's original bound to cases with smaller range sizes, providing a more general proof.
Contribution
The authors modify Shi's proof to remove the restriction on the range size, establishing a more general quantum lower bound for the collision problem.
Findings
Extended Shi's quantum lower bound to smaller range sizes
Provided a more general proof technique for the collision problem
Confirmed the tightness of the bound in broader cases
Abstract
We extend Shi's 2002 quantum lower bound for collision in -to-one functions with inputs. Shi's bound of is tight, but his proof applies only in the case where the range has size at least . We give a modified version of Shi's argument which removes this restriction.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Complexity and Algorithms in Graphs · Quantum Computing Algorithms and Architecture
