A Quantum Algorithm for Finding the Minimum

@misc{citeulike:935964, abstract = {We 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.}, author = {Durr, Christoph and Hoyer, Peter }, citeulike-article-id = {935964}, eprint = {quant-ph/9607014}, keywords = {algorithm, computing, minimum, quantum}, month = {Jan}, posted-at = {2006-11-08 01:08:47}, priority = {0}, title = {A Quantum Algorithm for Finding the Minimum}, url = {http://arxiv.org/abs/quant-ph/9607014}, year = {1999} }

TY - ELEC ID - citeulike:935964 L3 - citeulike-article-id:935964 TI - A Quantum Algorithm for Finding the Minimum N2 - We 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. KW - algorithm KW - computing KW - minimum KW - quantum AU - Durr, Christoph AU - Hoyer, Peter PY - 1999/Jan/07/ UR - http://arxiv.org/abs/quant-ph/9607014 ER -