Quantum Algorithm for the Collision Problem
Gilles Brassard, Peter Hoyer, Alain Tapp
Abstract
In this note, we give a quantum algorithm that finds collisions in arbitrary r-to-one functions after only O((N/r)(1/3)) expected evaluations of the function. Assuming the function is given by a black box, this is more efficient than the best possible classical algorithm, even allowing probabilism. We also give a similar algorithm for finding claws in pairs of functions. Furthermore, we exhibit a space-time tradeoff for our technique. Our approach uses Grover's quantum searching algorithm in a novel way.
Create a lesson
Related papers
Discovering state-of-the-art quantum circuits with large language models
Andi Gu, Alek H. Kemeny, Susanne F. Yelin et al.
Stability of Quantum LDPC States under Local Pauli Noise
Tai-Hsuan Yang, Andrew D. Kim, Akash Vijay et al.
Magic in quantum trajectory unravelings of noisy random quantum circuits
Sara Santos, Alessio Paviglianiti, Vincenzo Savona
Magna: simulating magic state factories as cheaply as Clifford circuits
Yifei Wang, Yingfei Gu
Classical Capacity of Single-Mode Bosonic Gaussian Channels
Gerardo Adesso, Ludovico Lami, Vittorio Giovannetti
SynDebug: A Framework to Debug Logic Bugs in Fault-Tolerant Quantum Computing Programs
Nicholas S. DiBrita, Jack Lange, Tirthak Patel