Searching an Ordered List on a Quantum Computer

Simple item page
dc.creatorRoehrig, Hein
dc.date1998-12-22
dc.date1999-04-22
dc.date.accessioned2026-07-07T06:15:57Z
dc.date.available2026-07-07T06:15:57Z
dc.descriptionWithdrawn by the author due to irreparable errors. We present a quantum algorithm that in the black-box model performs a search in an ordered list of N elements. Using 3/4 log N + O(1) queries, it achieves a success probability of at least 1/2, whereas classically, log N - O(1) queries are needed to obtain constant success probability. Moreover, our algorithm employs the Haar transform and thus differs substantially from Grover's search algorithm and from algorithms relying on the quantum Fourier transform.
dc.descriptionWithdrawn by the author due to irreparable errors
dc.identifierhttps://arxiv.org/abs/quant-ph/9812061
dc.identifierhttp://arxiv.org/abs/quant-ph/9812061
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93916
dc.subjectQuantum Physics
dc.titleSearching an Ordered List on a Quantum Computer
dc.typetext

Files

Collections

arXiv