Grover, L.K. (1997), Quantum mechanics helps in searching for a needle in a haystack, Physical Review Letters 79:325-328. Home/Search Document Not in Database Summary APS Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Converting the Flavor of a Quantum Bit - Commitment Frederic Legare (Correct)
.... not depend on any computational assumption) On the other, quantum computation provided cryptanalysts with powerful tools such as an algorithm to factor or compute discrete logarithm e#ciently [23] Another remarkable result for quantum cryptanalysis was the quadratic speed up for database search [13]. Researchers learned the hard way that quantum cryptography had also its limitations. In the beginning of the 90s, the scientific community was convince that bit commitment could be achieved with security relying solely on laws of quantum mechanics [5] A bit commitment scheme is a cryptographic ....
Grover, L. K., "Quantum mechanics helps in searching for a needle in a haystack", Physical Review Letters, vol. 79, no 2, 1997, pp. 325 -- 328. 49
Epistemic Motion in Quantum Searching - Keye Martin Oxford (2003) (Correct)
....v = 1 x is not a variable for majorization: For n = 3, v(1=2; 1=4; 1=4) v(1=2; 1=2; 0) despite the fact that (1=2; 1=4; 1=4) 1=2; 1=2; 0) Finally, let us get to why absolute maxima of epistemic curves are good things to know how to calculate. 6 Quantum searching Grover s algorithm [4][7] searches a list L of length n (which is a power of two) for an element k known to occur in L precisely m times with n m 1. The register begins in the pure state j i = XII and k iterations of the Grover operator G takes it to sin(2k ) L(i) k jii cos(2k ) L(i)6=k ....
L. K. Grover. Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 78:325, 1997. XV
A Partial Order on Classical and Quantum States - Bob Coecke And (2002) (Correct)
.... with each iteration, move up in the Bayesian order, and a possible connection between quantum algorithms that provide a significant complexity speedup over their classical counterparts, on the one hand, and those which can be shown to obey a qualitative law (like moving up in the Bayesian order) [8], on the other. We can also use the informatic derivative to measure the effect of noise on classical channels, or study its effect on quantum states, and in the case of the latter, the especially rigid nature of the spectral order on turns out to be quite valuable. The moral is this: It is ....
L. K. Grover. Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 78:325, 1997.
Epistemic Motion In Quantum Searching - Martin (2003) (Correct)
....v = 1 x is not a variable for majorization: For n = 3, v(1=2; 1=4; 1=4) v(1=2; 1=2; 0) despite the fact that (1=2; 1=4; 1=4) 1=2; 1=2; 0) Finally, let us get to why absolute maxima of epistemic curves are good things to know how to calculate. 5 Quantum searching Grover s algorithm [4][7] searches a list L of length n (which is a power of two) for an element k known to occur in L precisely m times with n m 1. The register begins in the pure state j i = and k iterations of the Grover operator G takes it to sin(2k ) L(i) k jii cos(2k ) L(i)6=k ....
L. K. Grover. Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 78:325, 1997.
Entangling Dipole-Dipole Interactions with Neutral Atoms . . . - Brennen (Correct)
....of quantum algorithms that show dramatic speed up over their classical counterparts. Two key discoveries were Shor s [19] polynomial time algorithm for factoring large numbers which gives a quasi exponential speed up over the best known classical algorithms, and the search algorithm of Grover [20] which gives a N speedup over classical algorithms for searching an unstructured database of size N. Other algorithms, which are hybrids of these two, have been discovered and there is numerical evidence for polynomial simulation of a NP complete problem on a quantum computer [21] but proving ....
L. K. Grover, "Quantum Mechanics Helps in Searching for a Needle in a Haystack", Phys. Rev. Lett. 79, 325 (1997).
Fast Quantum Algorithms for Handling.. - Martinez.. (2003) (Correct)
....to drastically speed up computations (in spite of quantum noise) For example, without using quantum effects, we need in the worst case at least N computational steps to search for a desired element in an unsorted list of size N . A quantum computing algorithm proposed by Grover (see, e.g. [5, 6, 17]) can find this element much faster in O( N) time. Several other quantum algorithms have been proposed. What we are planning to do. How can this be of use to fuzzy data processing community In many application areas ranging from geosciences to bioinformatics to largescale simulations of ....
L. K. Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett., 79(2):325-- 328, 1997.
Dynamical Aspects of Information Storage in Quantum-Mechanical.. - Raginsky (2002) (Correct)
....Then, since each channel U i is bistochastic as well, the sequence f n g converges exponentially fast to the maximally mixed state 1I=d, where d = dimH . Also, if the computation employs a static algorithm, i.e. U i = U for all i (this is true, e.g. in the case of Grover s search algorithm [55]) then the channel S : T U is also strictly contractive, and k(S) k(T ) by unitary invariance of the trace norm. Denoting the xed point of S by S , we then have k n S k 1 = kS ( 0 ) S ( S )k 1 k(T ) k 0 S k 1 ; i.e. the output state of any suciently lengthy ....
L.K. Grover, \Quantum mechanics helps in searching for a needle in a haystack," Phys. Rev. Lett. 79, 325 (1997).
Software Geography: Physical and Economic - Aspects Vaughan Pratt (Correct)
....membership in an NP complete set is via an algorithm that converts any classical (deterministic or probabilistic) algorithm for testing membership in any set into a faster quantum algorithm for membership in that set. Grover has given a quadratic quantum speedup for any such classical algorithm [Gro97]. On the lower bound side, several people have shown that Grover s speedup is optimal. But all that shows about membership in an NP complete set is that a good quantum algorithm based on such an approach has to capitalize somehow on the fact that the set is in NP. Any method that works for the ....
L. Grover. Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 79(2), 1997.
Grover's Algorithm Applied to the Molecular Distance.. - Lavor, Liberti, Maculan (2005) Self-citation (Grover) (Correct)
No context found.
Grover, L.K. (1997), Quantum mechanics helps in searching for a needle in a haystack, Physical Review Letters 79:325-328.
High-Level Methods for Quantum Computation and Information - Samson Abramsky Oxford Self-citation (Grover) (Correct)
No context found.
L. K. Grover. Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters 79, 325--328 (1997).
Gate-Level Simulation of Quantum Circuits - Viamontes, Rajagopalan, Markov, .. (2003) Self-citation (Grover) (Correct)
No context found.
L. Grover, "Quantum Mechanics Helps In Searching For a Needle in a Haystack", Phys. Rev. Lett. 79:325-328, 1997.
COCOON'01 Submission - Title Deterministic Application Self-citation (Grover) (Correct)
No context found.
L.K. Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys.Rev.Lett 79, 325--328 (1997).
Can Quantum Computers Be Useful When There Are Not Yet.. - Longpré, Kreinovich (2003) Self-citation (Grover) (Correct)
....Science University of Texas at El Paso 500 W. University El Paso, TX 79968, USA flongpre,vladikg cs.utep.edu Formulation of the problem. Quantum computers (see, e.g. 5] have a potential of speeding up computations in many important problems. For example: ffl By using Grover s algorithm [3, 4], for any given error probability e 0 , we can search for an item in an n item (un sorted) database in Theta( n) steps (where checking that a given element is the desired one is counted as a single step) By contrast, the best possible probabilistic algorithm that locates an item with an error ....
L. K. Grover, "Quantum mechanics helps in searching for a needle in a haystack", Phys. Rev. Lett., 1997, Vol. 79, No. 2, pp. 325--328.
Adiabatic Quantum State Generation and Statistical Zero.. - Aharonov, Ta-Shma (2003) (5 citations) (Correct)
No context found.
L. Grover, Quantum Mechanics helps in searching for a needle in a haystack, Phys. Rev. Letters, July 14, 1997
High-Performance QuIDD-based Simulation of Quantum Circuits - Viamontes, Markov, Hayes (Correct)
No context found.
L. Grover, "Quantum mechanics helps in searching for a needle in a haystack," Phys. Rev. Lett. (79), pp. 325-8, 1997.
Quantum Modeling - Goldstein (Correct)
No context found.
L. Grover, \Quantum mechanics helps in searching for a needle in a haystack," Phys. Rev. Lett. 79(2), p. 325, 1997. arXive e-print quant-ph/9706033.
Adiabatic Quantum State Generation and Statistical Zero.. - Aharonov, Ta-Shma (2003) (5 citations) (Correct)
No context found.
L. Grover, Quantum Mechanics helps in searching for a needle in a haystack, Phys. Rev. Letters, July 14, 1997
Is Quantum Search Practical? - George Viamontes Igor (Correct)
No context found.
L. K. Grover, "Quantum mechanics helps in searching for a needle in a haystack," Phys. Rev. Lett. 79, p. 325, 1997.
Graph-Based Simulation of Quantum Computation in the.. - Viamontes, Markov, Hayes (Correct)
No context found.
L. Grover, "Quantum mechanics helps in searching for a needle in a haystack," Phys. Rev. Lett. 79, 325-328, 1997.
Training a Quantum Neural Network - Bob Ricks Brigham (2003) (Correct)
No context found.
Lov K. Grover. Quantum mechanics helps in searching for a needle in a haystack. In Physical Review Letters, volume 78, pages 325--328, 1997.
Quantum Computing - And Shor's Factoring (Correct)
No context found.
L. K. Grover. Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79 (1997), 325--328.
Converting the Flavor of a Quantum Bit Commitment - Legare (2000) (Correct)
No context found.
Grover, L. K., "Quantum mechanics helps in searching for a needle in a haystack", Physical Review Letters, vol. 79, no 2, 1997, pp. 325 -- 328. 49
Quantum Computation - Aharonov (1998) (1 citation) (Correct)
No context found.
Grover L K, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 79, 325-328 1997.
Quantum Information Theory - an Invitation - Werner (2001) (2 citations) (Correct)
No context found.
L. Grover: "Quantum mechanics helps in searching for a needle in a haystack,", Phys. Rev. Lett. 79 (1997) 325 (quant-ph/9706033).
Structure and Interpretation of Quantum Mechanics - a.. - Karczmarczuk (2003) (1 citation) (Correct)
No context found.
L.K. Grover, Quantum Mechanics Helps In Searching For a Needle in a Haystack, Phys. Rev. Lett. 79, (1997.
First 50 documents
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