Gilles Brassard, Peter Høyer, Michele Mosca, Alain Tapp  Home/Search
Context Related
| cacr.uwaterloo.ca/tech...corr200044.ps brics.dk/~hoyer/pa...BHMT00amplampl.ps 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: cacr.uwaterloo.ca/tech_reports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Consider a Boolean function : X ! f0; 1g that partitions set X between its good and bad elements, where x is good if (x) = 1 and bad otherwise. Consider also a quantum algorithm A such that Aj0i = P x2X x jxi is a quantum superposition of the elements of X , and let a denote the probability that a good element is produced if Aj0i is measured. If we repeat the process of running A, measuring the output, and using to check the validity of the result, we shall expect to repeat 1=a... (Update)
Context of citations to this paper: More
.... and eigenvalues also provides an alternative analysis of the searching and amplitude amplification algorithms as detailed in [8] and summarised in Section 5. Section 5 also shows how to combine the quantum counting algorithm of Section 4 with exact searching methods...
...can be 2 n; thus the probability that the right partition has been chosen is . By method of quantum amplitude amplification [2], if a quantum algorithm running once gives some result with probablity , then running the algorithm O( p) times giving the same result with...
Cited by: More
Towards Quantum Template Matching - Daniel Curtis And (Correct)
The Geometry Of Quantum Learning - Hunziker, Meyer, Park, Pommersheim.. (2003) (Correct)
From Monte Carlo to Quantum Computation - Heinrich (Correct)
Active bibliography (related documents): More All
0.5: Quantum Lower Bounds by Polynomials - Beals, Buhrman, Cleve, Mosca, de.. (1998) (Correct)
0.3: Counting by Quantum Eigenvalue Estimation - Mosca (Correct)
0.2: Grover's Algorithm for Multiobject Search in Quantum Computing - Chen, Fulling, Scully (Correct)
Similar documents based on text: More All
0.9: Stochastic Learning of Strategic Equilibria for Auctions - Bengio, Bengio (1999) (Correct)
0.8: Modular Temporal Logic - Baziramwabo, McKenzie, Thérien (1998) (Correct)
0.7: Diversification Strategies in Local Search for A.. - Gendron, Potvin, Soriano (Correct)
Related documents from co-citation: More All
11: A fast quantum mechanical algorithm for database search - Grover - 1996
8: Strengths and weaknesses of quantum computing - Charles, Ethan et al.
7: Tight bounds on quantum searching - Boyer, Brassard et al. - 1998
BibTeX entry: (Update)
G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. Forthcoming. http://citeseer.ist.psu.edu/brassard00quantum.html More
@misc{ brassard-quantum,
author = "G. Brassard and P. Hoyer and M. Mosca and A. Tapp",
title = "Quantum amplitude amplification and estimation",
text = "G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification
and estimation. Forthcoming.",
url = "citeseer.ist.psu.edu/brassard00quantum.html" }
Citations (may not include all citations):210 A fast quantum mechanical algorithm for database search - Lov - 1996 ACM DBLP
164 Polynomial-time algorithms for prime factorization and discr.. - Peter - 1997 ACM DBLP
50 Quantum algorithms revisited - Richard, Ekert et al. - 1998
49 Quantum lower bounds by polynomials - Robert, Buhrman et al. - 1998 ACM DBLP
48 Quantum mechanics helps in searching for a needle in a hayst.. (context) - Lov - 1997
46 An exact quantum polynomialtime algorithm for Simon's proble.. - Gilles, yer - 1997
25 Notes on the history of reversible computation (context) - Charles - 1988 ACM DBLP
15 The quantum query complexity of approximating the median and.. - Ashwin, Wu - 1999
7 Quantum searching and counting by eigenvector analysis (context) - Michele - 1998
5 Quantum database searching by a single query (context) - DongPyo, Kim - 1998
4 Quantum computers can search rapidly by using almost any tra.. (context) - Lov - 1998
2 Conjugated operators in quantum algorithms - yer - 1999 ACM
1 special issue on quantum computing and quantum cryptography (context) - Michel, Brassard et al. - 1998
1 Available at Los Alamos e-Print archive as <http://arXiv (context) - Kitaev - 1995
1 yer and Alain Tapp (context) - Gilles - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cacr.uwaterloo.ca/tech_reports.html): More
Linear Complexity versus Pseudorandomness: On Beth and Dai's Result - Wang (1999) (Correct)
A Conjecture on Binary Sequences with the "Trinomial Property" - Cusick, Gong (1999) (Correct)
Unconditionally Secure Proactive Secret Sharing Scheme with.. - Stinson, Wei (1999) (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