Christoph Dürr, Peter Høyer  Home/Search
Context
Related
| brics.dk/~hoyer/papers/DH96.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brics.dk/~hoyer/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: > c 1 be any constant. By measuring after a total number of O(c p N ) iterations, the algorithm given below finds (the index of a item holding) the minimum value with probability at least 1 \Gamma 1 2 c . We first give the minimum searching algorithm, and then the proof of its optimality. Supported in part by the ISI Foundation. y LRI, bat 490, F--91405 Orsay, France. durr@lri.fr, http://www.lri.fr/~durr. z Supported by the alcom-it Research Programme of the EU and the ISI... (Update)
Active bibliography (related documents): More All
0.0: A Quantum Decoding Algorithm of the Simplex Code - Barg, Zhou (1998) (Correct)
0.0: Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998) (Correct)
0.0: Average-Case Quantum Query Complexity - Ambainis, de Wolf (2000) (Correct)
Similar documents based on text: More All
0.1: Almost-Everywhere Superiority for Quantum Computing - Hemaspaandra, Hemaspaandra.. (1999) (Correct)
0.1: Quantum Algorithms for Element Distinctness - Buhrman, Dürr, Heiligman.. (2000) (Correct)
0.1: Quantum Counting - Brassard, Høyer, Tapp (1998) (Correct)
BibTeX entry: (Update)
@misc{ rr-quantum,
author = "Christoph Dürr and Peter Høyer",
title = "A Quantum Algorithm for Finding the Minimum",
url = "citeseer.ist.psu.edu/17273.html" }
Citations (may not include all citations):210 A fast quantum mechanical algorithm for database search - Lov - 1996
102 Strengths and weaknesses of quantum computing - Charles, Ethan et al. - 1995
73 Tight bounds on quantum searching - Michel, Brassard et al. - 1996
Documents on the same site (http://www.brics.dk/~hoyer/papers/): More
Tight Bounds on Quantum Searching - Boyer, Brassard, Høyer, Tapp (1998) (Correct)
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem - Brassard, Høyer (1997) (Correct)
Quantum Cryptanalysis of Hash and Claw-Free Functions - Brassard, Høyer, Tapp (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC