On Finding Quantum Multi-Collisions

Explore groundbreaking research on quantum multi-collisions presented at EUROCRYPT 2019. Delve into the paper by Qipeng Liu and Mark Zhandry, which examines classical query complexity, k-collision finding, and introduces "The Reciprocal Plus 1" rule. Investigate classical lower bounds for 2-collision and 3-collision, compare classical and quantum approaches, and gain insights into quantum lazy sampling techniques. Uncover the intricacies of this 24-minute presentation that pushes the boundaries of quantum cryptography and collision finding algorithms.

Intro
Classical Query Complexity
(constant) k-collision Finding
Our results
"The Reciprocal Plus 1" Rule
Generalized to k-collision
Classical Lower Bound
2-collision lower bound
Classical Vs Quantum
3-collision lower bound
Technique Details
Quantum Lazy Sampling? . Even a single quantum query, looks like