A Quantum Algorithm for Finding the Minimum (1996)
by
Christoph Dürr
,
Peter Høyer
| Venue: | in LANL e-print quantph/9607014, http://xxx.lanl.gov |
| Citations: | 24 - 0 self |
BibTeX
@INPROCEEDINGS{Dürr96aquantum,
author = {Christoph Dürr and Peter Høyer},
title = {A Quantum Algorithm for Finding the Minimum},
booktitle = {in LANL e-print quantph/9607014, http://xxx.lanl.gov},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Let T[0..N −1] be an unsorted table of N items, each holding a value from an ordered set. For simplicity, assume that all values are distinct. The minimum searching problem is to find the index y such that T[y]
Citations
| 734 | A fast quantum mechanical algorithm for database search - Grover - 1996 |
| 295 | U.Vazirani, Strengths and weaknesses of quantum computing - Bennett, Brassard - 1997 |
| 109 | Tight bounds on quantum searching”, Fortsch.Phys - Boyer, Brassard, et al. - 1998 |
| 11 | Umesh Vazirani, Strengths and weaknesses of quantum computing - Bennett, Bernstein, et al. - 1997 |
| 7 | Tight bounds on quantum searching", Fortschritte Der Physik, special issue on quantum computing and quantum cryptography - Boyer, Brassard, et al. - 1998 |
| 4 | Høyer and Alain Tapp, “Tight bounds on quantum searching”, Fortschritte Der Physik, special issue on quantum computing and quantum cryptography - Boyer, Brassard, et al. - 1998 |
| 3 | Brassard and Umesh Vazirani, "Strengths and weaknesses of quantum computing - Bennett, Bernstein, et al. - 1997 |
