A Quantum Algorithm for Finding the Minimum

Simple item page
dc.creatorDurr, Christoph
dc.creatorHoyer, Peter
dc.date1996-07-18
dc.date1999-01-07
dc.date.accessioned2026-07-07T09:08:55Z
dc.date.available2026-07-07T09:08:55Z
dc.descriptionWe give a quantum algorithm to find the index y in a table T of size N such that in time O(c sqrt N), T[y] is minimum with probability at least 1-1/2^c.
dc.description2 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/9607014
dc.identifierhttp://arxiv.org/abs/quant-ph/9607014
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/150896
dc.subjectQuantum Physics
dc.subjectData Structures and Algorithms
dc.titleA Quantum Algorithm for Finding the Minimum
dc.typetext

Files

Collections

arXiv