Lov K. Grover  Home/Search
Context Related
Links: ACM DBLP | infidel.c.utokyo.ac.jp/...grover.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: infidel.c.utokyo....comp_seminar (more) (Enter author homepages) |
Rate this article:      (best)Excellent article View Comments (1) |
Abstract: ed Problem Let a system have N = 2 n states which are labelled S 1 ,S 2 ,...S N . These 2 n states are represented as n bit strings. Let there be a unique state, say S n , that satisfies the condition C(S n ) = 1, whereas for all other states S, C(S) = 0 (assume that for any state S, the condition C(S) can be evaluated in unit time). The problem is to identify the state S n . 3. Algorithm (i) Initialize the system to the distribution: , i.e. there is the same amplitude to be in each of... (Update)
Cited by: More
Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998) (Correct)
Quantum Lower Bounds by Polynomials - Robert Beals University (Correct)
Quantum Fourier transforms for extracting hidden - Linear Structures In (Correct)
Active bibliography (related documents): More All
0.5: Quantum Information Processing: Compression, Coding, and Related.. - Reif (1985) (Correct)
0.5: Alternative Computational Models: A Comparison of Biomolecular and .. - Reif (1998) (Correct)
0.4: Quantum Computation - Aharonov (1998) (Correct)
Similar documents based on text: More All
0.0: A Systematic Test of Time-to-Failure Analysis - Susanna Gross And (1998) (Correct)
0.0: Lattice Basis Reduction and Integer Programming - Aardal (1999) (Correct)
0.0: Proofs and Pictures Proving the Diamond Lemma with the.. - Barker-Plummer, Bailin (1995) (Correct)
Related documents from co-citation: More All
44: Polynomial-time algorithms for prime factorization and discrete logarithms on a .. - Shor - 1995
39: Strengths and weaknesses of quantum computing - Charles, Ethan et al.
36: the power of quantum computation - Simon - 1994
BibTeX entry: (Update)
L. K. Grover, A fast quantum mechanical algorithm for database search, Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, 212-219, Philadelphia, PA, (May, 1996). http://citeseer.ist.psu.edu/grover96fast.html More
@inproceedings{ grover96fast,
author = "Lov K. Grover",
title = "A fast quantum mechanical algorithm for database search",
pages = "212--219",
year = "1996",
url = "citeseer.ist.psu.edu/grover96fast.html" }
Citations (may not include all citations):173 Quantum Complexity Theory - Bernstein, Vazirani - 1993 ACM DBLP
168 Algorithms for quantum computation: discrete logarithms and .. - Shor - 1994 DBLP
163 NP is as easy as detecting unique solutions (context) - Valiant, Vazirani - 1986 ACM DBLP
144 the power of quantum computation - Simon - 1994
126 Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992 ACM
118 the Church-Turing principle and the universal quantum comput.. (context) - Deutsch, Theory - 1985
106 Matching is as easy as matrix inversion (context) - Mulmuley, Vazirani et al. - 1987 ACM DBLP
102 Strengths and weaknesses of quantum computing - Bennett, Bernstein et al. ACM DBLP
85 Quantum circuit complexity - Yao - 1993 DBLP
73 Tight bounds on quantum searching - Boyer, Brassard et al. - 1996 ACM
36 Oracle quantum computing - Berthiaume, Brassard - 1994
12 A quantum algorithm for finding the minimum - Durr, Hoyer
11 The computer as a physical system: A microscopic quantum mec.. (context) - Benioff - 1980
7 Quantum mechanical interaction free measurements (context) - Elitzur, Vaidman - 1993
7 A fast quantum mechanical algorithm for estimating the media.. (context) - Grover
4 Quantum seeing in the dark (context) - Kwiat, Weinfurter et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://infidel.c.u-tokyo.ac.jp/comp_seminar.html): More
Chaos Monte Carlo computation: a dynamical effect of random-number .. - Umeno (Correct)
Quantum Automata and Quantum Grammars - Moore, Crutchfield (Correct)
Predicting Lattice Gases is P-complete - Moore, Nordahl (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