(Enter summary)
Abstract: We study some extensions of Grover's quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic speedup obtained by the quantum searching algorithm over classical brute force can still be obtained for a large family of search problems for which good classical heuristics exist. Finally, as our main result, we combine ideas from Grover's and Shor's quantum algorithms to perform approximate... (Update)
Cited by: More
Quantum Lower Bounds by Polynomials - Robert Beals University
(Correct)
cs.CC/9904019 - Aug Bounds For
(Correct)
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John
(Correct)
Similar documents (at the sentence level):
8.7%: Quantum Amplitude Amplification and Estimation - Brassard, Høyer, Mosca, .. (2000)
(Correct)
Active bibliography (related documents): More All
0.7: Quantum Searching, Counting and Amplitude Amplification by.. - Moscafi (1998)
(Correct)
0.5: Efficient and Exact Quantum Compression and Molecular Scale O° K.. - Reif
(Correct)
0.2: Counting by Quantum Eigenvalue Estimation - Mosca
(Correct)
Similar documents based on text: More All
0.4: Quantum Cryptanalysis of Hash and Claw-Free Functions - Brassard, Høyer, Tapp (1997)
(Correct)
0.4: Tight Bounds on Quantum Searching - Boyer, Brassard, Høyer, Tapp (1998)
(Correct)
0.4: Quantum Algorithm for the Collision Problem - Brassard, Høyer, Tapp (1997)
(Correct)
Related documents from co-citation: More All
29: A fast quantum mechanical algorithm for database search
- Grover - 1996
19: Strengths and weaknesses of quantum computing
- Charles, Ethan et al.
18: Polynomial-time algorithms for prime factorization and discrete logarithms on a ..
- Shor - 1995
BibTeX entry: (Update)
G. Brassard, P. Høyer, and A. Tapp. Quantum counting. In Proceedings of 25th ICALP, volume 1443 of Lecture Notes in Computer Science, pages 820--831. Springer, 1998. quant-ph/9805082. http://citeseer.ist.psu.edu/brassard98quantum.html More
@article{ brassard98quantum,
author = "Gilles Brassard and Peter H{\o}yer and Alain Tapp",
title = "Quantum Counting",
journal = "Lecture Notes in Computer Science",
volume = "1443",
pages = "820+",
year = "1998",
url = "citeseer.ist.psu.edu/brassard98quantum.html" }
Citations (may not include all citations):
164
Polynomial-time algorithms for prime factorization and discr..
- Peter - 1997 ACM DBLP
102
Strengths and weaknesses of quantum computing
- Charles, Ethan et al. - 1997 ACM DBLP
73
Tight bounds on quantum searching
- Michel, Brassard et al. - 1996 ACM
50
Quantum algorithms revisited
- Richard, Ekert et al. - 1998
48
Quantum mechanics helps in searching for a needle in a hayst.. (context) - Lov - 1997
46
An exact quantum polynomial-time algorithm for Simon's probl..
- Gilles, Hoyer - 1997 ACM DBLP
16
A quantum jump in computer science (context) - Gilles - 1995 DBLP
8
Quantum physics and computers
- Adriano - 1996
5
Quantum database searching by a single query (context) - Dong-Pyo, Kim - 1998
2
New horizons in quantum information processing (context) - Gilles - 1998 ACM DBLP
2
Quantum computer algorithms and interferometry (context) - Michele - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/~hoyer/papers/): More
A Quantum Algorithm for Finding the Minimum - Dürr, Høyer (1996)
(Correct)
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)
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