Article

Free access

A fast quantum mechanical algorithm for database search

Author:

Lov K. GroverAuthors Info & Claims

STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing

Pages 212 - 219

https://doi.org/10.1145/237814.237866

Published: 01 July 1996 Publication History

PDF eReader

References

[1]

C.H. Bennett, E. Bemstein, G. Brassard and U.Vazirani, Strengths and weaknesses of quantum computing, preprint, 1994.

Google Scholar

[2]

A. Berthiaume and G. Brassard, The quantum challenge to structural complexity theory, Proceedings 7th IEEE Conference on Structure in Complexity Theory, 1992, pp. 132-137.

Crossref

Google Scholar

[3]

P. Benioff, The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines, Journal of Statistical Physics, 22, pp. 563-591.

Crossref

Google Scholar

[4]

E. Bernstein and U. Vazirani, Quantum Complexity Theory, Proceedings 25th ACM Symposium on Theory of Computing, 1993, pp. 11-20.

Digital Library

Google Scholar

[5]

D. Deutsch, Quantum Theory, the Church-Turing principle and the universal quantum computer, Proceedings Royal Society London Ser. A, 400, pp. 96-117.

Google Scholar

[6]

D. Deutsch and R. Jozsa, Rapid solution of problems by quantum computation, Proceedings Royal Society of London, A400, pp. 73-90.

Google Scholar

[7]

K. Mulmuley, U. Vazirani and V. Vazirani, Matching is as easy as matrix inversion, Combinatorica, 7 (1987), pp. 105-131.

Digital Library

Google Scholar

[8]

R. Penrose, The Emperor's New Mind, Concerning Computers, Minds and the Laws of Physics. Oxford University Press, 1989, pp. 400-402.

Digital Library

Google Scholar

[9]

R. Penrose, Shadows of the mind,. Oxford University Press, 1994, pp. 348- 388.

Google Scholar

[10]

P.W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings, 35th Annual Symposium on Fundamentals of Computer Science (FOCS), 1994, pp. 124- 134.

Digital Library

Google Scholar

[11]

P.W. Shot, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A, Vol. 52, October 1995, pp. 2493-2496.

Crossref

Google Scholar

[12]

D. Simon, On the power of quantum computation, Proceedings, 35th Annual Symposium on Fundamentals of Computer Science (FOCS), 1994, pp. 116- 123.

Digital Library

Google Scholar

[13]

L.G. Valiant and V. Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science 47, 1986, pp. 85-93.

Digital Library

Google Scholar

[14]

A. Yao, Quantum circuit complexity, Proceedings 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 352-361.

Google Scholar

Cited By

View all

Grange CPoss MBourreau ET’kindt VPloton O(2025)Moderate exponential-time quantum dynamic programming across the subsets for scheduling problemsEuropean Journal of Operational Research10.1016/j.ejor.2024.09.005320:3(516-526)Online publication date: Feb-2025
https://doi.org/10.1016/j.ejor.2024.09.005
Minh Do COgata K(2024)Symbolic model checking quantum circuits in MaudePeerJ Computer Science10.7717/peerj-cs.209810(e2098)Online publication date: 20-Jun-2024
https://doi.org/10.7717/peerj-cs.2098
Quan DLü XZhang W(2024)Structure design and logical CNOT implementation of multi-logical-qubits surface codeActa Physica Sinica10.7498/aps.73.2023113873:4(040304)Online publication date: 2024
https://doi.org/10.7498/aps.73.20231138
Show More Cited By

Index Terms

A fast quantum mechanical algorithm for database search
1. Information systems
  1. Information retrieval
    1. Information retrieval query processing
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes

Recommendations

A review on quantum search algorithms

The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It is evident from the early invented quantum algorithms such as Deutsch's algorithm, ...
An efficient quantum search engine on unsorted database

We consider the problem of finding one or more desired items out of an unsorted database. Patel has shown that if the database permits quantum queries, then mere digitization is sufficient for efficient search for one desired item. The algorithm, called ...
A Proposal of a Quantum Search Algorithm
ICCIT '09: Proceedings of the 2009 Fourth International Conference on Computer Sciences and Convergence Information Technology

For searching an unsorted database with N items, a classical computer requires O(N) steps but Grover's quantum searching algorithm requires only O(√N) steps. However, it is also known that Grover's algorithm is effective in the case where the initial ...

Comments

Information & Contributors

Information

Published In

STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing

July 1996

661 pages

ISBN:0897917855

DOI:10.1145/237814

Chairman:
Gary L. Miller

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC96

Sponsor:

SIGACT

STOC96: ACM Symposium on Theory of Computing

May 22 - 24, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

STOC '96 Paper Acceptance Rate 74 of 201 submissions, 37%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4,157
Total Citations
View Citations
16,308
Total Downloads

Downloads (Last 12 months)4,761
Downloads (Last 6 weeks)688

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Grange CPoss MBourreau ET’kindt VPloton O(2025)Moderate exponential-time quantum dynamic programming across the subsets for scheduling problemsEuropean Journal of Operational Research10.1016/j.ejor.2024.09.005320:3(516-526)Online publication date: Feb-2025
https://doi.org/10.1016/j.ejor.2024.09.005
Minh Do COgata K(2024)Symbolic model checking quantum circuits in MaudePeerJ Computer Science10.7717/peerj-cs.209810(e2098)Online publication date: 20-Jun-2024
https://doi.org/10.7717/peerj-cs.2098
Quan DLü XZhang W(2024)Structure design and logical CNOT implementation of multi-logical-qubits surface codeActa Physica Sinica10.7498/aps.73.2023113873:4(040304)Online publication date: 2024
https://doi.org/10.7498/aps.73.20231138
Bhaumik RChailloux AFrixons PMennink BNaya-Plasencia M(2024)Block Cipher Doubling for a Post-Quantum WorldIACR Communications in Cryptology10.62056/av4fvua5vOnline publication date: 7-Oct-2024
https://doi.org/10.62056/av4fvua5v
Chen JLiu QFan YWu LLi BWang M(2024)New SAT-based Model for Quantum Circuit Decision Problem: Searching for Low-Cost Quantum ImplementationIACR Communications in Cryptology10.62056/anmmp-4c2hOnline publication date: 9-Apr-2024
https://doi.org/10.62056/anmmp-4c2h
Alnahawi NMüller JOupický JWiesmaier A(2024)A Comprehensive Survey on Post-Quantum TLSIACR Communications in Cryptology10.62056/ahee0iucOnline publication date: 8-Jul-2024
https://doi.org/10.62056/ahee0iuc
Schrottenloher AStevens M(2024)Quantum Procedures for Nested Search ProblemsIACR Communications in Cryptology10.62056/aee0fhbmoOnline publication date: 7-Oct-2024
https://doi.org/10.62056/aee0fhbmo
Filho DSilva TLópez J(2024)Efficient isochronous fixed-weight sampling with applications to NTRUIACR Communications in Cryptology10.62056/a6n59qgxqOnline publication date: 8-Jul-2024
https://doi.org/10.62056/a6n59qgxq
Alagic GBai CPoremba AShi K(2024)On the Two-sided Permutation Inversion ProblemIACR Communications in Cryptology10.62056/a0qj89n4eOnline publication date: 9-Apr-2024
https://doi.org/10.62056/a0qj89n4e
Throapologius A(2024)Quantum computing in anthropological research: An interdisciplinary approachInformation System and Smart City10.59400/issc.v4i1.13834:1(1383)Online publication date: 19-Jun-2024
https://doi.org/10.59400/issc.v4i1.1383
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A review on quantum search algorithms

An efficient quantum search engine on unsorted database

A Proposal of a Quantum Search Algorithm

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

A review on quantum search algorithms

An efficient quantum search engine on unsorted database

A Proposal of a Quantum Search Algorithm

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations