A fast quantum mechanical algorithm for database search
Explore this paper's citation graph
Summary
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
- Type
- article
- Published
- 1996-05-29
- Cited by
- 10,283
- References
- 23
- Access
- Open access
- OpenAlex
- https://openalex.org/W2084652510
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:207198067
Keywords
Citation, Computer science, Information retrieval, Database, Algorithm
References
- A fast quantum mechanical algorithm for estimating the median
- Oracle Quantum Computing
- Matching is as easy as matrix inversion
- Quantum complexity theory
- Scheme for reducing decoherence in quantum computer memory.
- Strengths and Weaknesses of Quantum Computing
- NP is as easy as detecting unique solutions
- Tight bounds on quantum searching
- QUANTUM SEEING IN THE DARK
- Rapid solution of problems by quantum computation
- The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- The Emperor's New Mind
- Quantum mechanical interaction-free measurements
- Efficient networks for quantum factoring.
- On the power of quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- A Quantum Algorithm for Finding the Minimum
- The quantum challenge to structural complexity theory
- Quantum Circuit Complexity
- Algorithms for quantum computation: discrete logarithms and factoring
Cited by
- Dynamics of bright solitary matter-waves
- Efficient Color Transformations on Quantum Images
- Quantum Algorithms in Hilbert Database
- Quantum random walks on congested lattices and the effect of dephasing
- Discussing the explanation of the quantum speed up
- Quantum Fourier transforms for extracting hidden linear structures in finite fields
- Characterization Of Single Defects In Zinc Oxide
- Design of Reversible/Quantum Ternary Comparator Circuits
- The vectorial λ-calculus
- White Noise in Quantum Random Walk Search Algorithm
- Towards optical quantum information processing using Rydberg dark-state polaritons
- Collapsing a Perfect Superposition to a Chosen Quantum State without Measurement
- Adiabatic Quantum Simulation of Quantum Chemistry
- Extreme Quantum Advantage when Simulating Classical Systems with Long-Range Interaction
- One-out-of-two Quantum Oblivious Transfer based on Nonorthogonal States
- A Quantum-Inspired Similarity Measure for the Analysis of Complete Weighted Graphs
- Computational perspectives on Bell Inequalities and many-body quantum correlations
- Cost analysis of hash collisions : will quantum computers make SHARCS obsolete?
- Investigation of Monolithic Erbium-Doped Resonators for Application in Cavity Quantum Electrodynamics
- Grover's Algorithm applied to the Molecular Distance Geometry Problem
Related papers
- Remarks on Algorithm 2, Algorithm 3, Algorithm 15, Algorithm 25 and Algorithm 26
- Remarks on Algorithm 332: Jacobi polynomials: Algorithm 344: student's t-distribution: Algorithm 351: modified Romberg quadrature: Algorithm 359: factoral analysis of variance
- Citation Form in Transition: The ALWD Citation Manual
- A Research on Citation Standard
- Citation Managers
- Remarks on algorithms 372 [A1]: An algorithm to produce complex primes, csieve and Algorithm 401 [A1]: an improved algorithm to produce complex primes
- Three Modes of Citation: Historical, Casuistic, and Literary Writing in Büchner
- The Evolution of Principia Mathematica; Bertrand Russell's Manuscripts and Notes for the Second Edition