arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/9705002quant-ph

Quantum Algorithm for the Collision Problem

Gilles Brassard, Peter Hoyer, Alain Tapp

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑