Michele Mosca  Home/Search
Context
Related
| cacr.math.uwaterloo.ca...tcscounting.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.math.uwaterlo...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: For every "computation" there corresponds the physical task of manipulating a starting state into an output state with a desired property. As the classical theory of physics has been replaced by quantum physics, it is interesting to consider the capabilities of a computer that can exploit the distinctively quantum features of nature. The extra capabilities seem enormous. For example, with only an expected O( p N ) evaluations of a function f : f0; 1; : : : ; N \Gamma 1g ! f0; 1g, we can... (Update)
Similar documents (at the sentence level):
10.9%: Quantum Searching, Counting and Amplitude Amplification by.. - Moscafi (1998) (Correct)
Active bibliography (related documents): More All
0.3: Quantum Amplitude Amplification and Estimation - Brassard, Høyer, Mosca, .. (2000) (Correct)
0.2: Quantum Computation - Chi, Kim (1997) (Correct)
0.2: Quantum Counting - Brassard, Høyer, Tapp (1998) (Correct)
Similar documents based on text: More All
0.3: The Hidden Subgroup Problem and Eigenvalue Estimation on a.. - Mosca, Ekert (1998) (Correct)
0.3: Quantum Lower Bounds by Polynomials - Beals, Buhrman, Cleve, Mosca, de.. (1998) (Correct)
0.2: Epistemic Motion In Quantum Searching - Martin (2003) (Correct)
BibTeX entry: (Update)
@article{ mosca01counting,
author = "Michele Mosca",
title = "Counting by quantum eigenvalue estimation",
journal = "Theoretical Computer Science",
volume = "264",
number = "1",
pages = "139--153",
year = "2001",
url = "citeseer.ist.psu.edu/490380.html" }
Citations (may not include all citations):1065 Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1996
837 Cambridge University Press (context) - Motwani, Raghavan et al. - 1995
210 A fast quantum mechanical algorithm for database search - Grover
173 Quantum Complexity Theory - Bernstein, Vazirani
168 Algorithms for quantum computation: Discrete logarithms and .. - Shor
145 Random Generation of Combinatorial Structures from a Uniform.. (context) - Jerrum, Valiant et al. - 1986
144 the Power of Quantum Computation - Simon
126 Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992
116 Simulating physics with computers - Feynman - 1982
102 Strengths and weaknesses of quantum computing - Bennett, Bernstein et al. - 1997
73 Tight Bounds on Quantum Searching - Boyer, Brassard et al.
50 Quantum Algorithms Revisited - Cleve, Ekert et al. - 1998
49 Quantum lower bounds by polynomials - Beals, Buhrman et al. - 1998
48 Quantum-theory, the Church-Turing principle and the universa.. - Deutsch - 1985
46 An exact quantum polynomial-time algorithm for Simon's probl.. - Brassard, Hyer - 1997
40 Quantum measurements and the Abelian Stabilizer Problem (context) - Kitaev - 1995
30 Quantum counting - Brassard, Hyer et al. - 1998
25 Notes on the history of reversible computation (context) - Bennett - 1988
23 The Hidden Subgroup Problem and Eigenvalue Estimation on a Q.. - Mosca, Ekert - 1998
22 A framework for fast quantum mechanical algorithms (context) - Grover - 1998
11 Quantum Amplitude Amplification and Estimation - Brassard, Hyer et al.
7 Generalized Grover Search Algorithm for Arbitrary Initial Am.. (context) - Biron, Biham et al. - 1998
5 Quantum database searching by a single query (context) - Chi, Kim - 1998
1 Quantum Searching, Counting and Amplitude Amplification by E.. - Mosca - 1998
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