A Polynomial-Time Quantum Algorithm for Collision Problem
Quantum Physics
2008-02-03 v3
Abstract
In this paper, we give a quantum algorithm which solves collision problem in an expected polynomial time. Especially, when the function is two-to-one, we present a quantum algorithm which can find a collision with certainty in a worst-case polynomial time. We also give a quantum algorithm which solves claw problem with certainty in a worst-case polynomial time.
Keywords
Cite
@article{arxiv.quant-ph/9707011,
title = {A Polynomial-Time Quantum Algorithm for Collision Problem},
author = {Dong Pyo Chi and Jinsoo Kim},
journal= {arXiv preprint arXiv:quant-ph/9707011},
year = {2008}
}
Comments
This paper was withdrawn because of gaps in this paper