A Polynomial-Time Quantum Algorithm for Collision Problem

Simple item page
dc.creatorChi, Dong Pyo
dc.creatorKim, Jinsoo
dc.date1997-07-04
dc.date1997-07-15
dc.date.accessioned2026-07-07T09:05:14Z
dc.date.available2026-07-07T09:05:14Z
dc.descriptionIn 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.
dc.descriptionThis paper was withdrawn because of gaps in this paper
dc.identifierhttps://arxiv.org/abs/quant-ph/9707011
dc.identifierhttp://arxiv.org/abs/quant-ph/9707011
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/149645
dc.subjectQuantum Physics
dc.titleA Polynomial-Time Quantum Algorithm for Collision Problem
dc.typetext

Files

Collections

arXiv