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

Dodis YGuan JHall PLin A(2025)HELP: Everlasting Privacy through Server-Aided RandomnessIACR Communications in Cryptology10.62056/a3w7tr-10k1:4Online publication date: 13-Jan-2025
https://doi.org/10.62056/a3w7tr-10k
Rosenfeld R(2025)Notas sobre complejidad computacionalNotes on Computational ComplexityRevista Abierta de Informática Aplicada10.59471/raia20242108:1(109-139)Online publication date: 31-Jan-2025
https://doi.org/10.59471/raia2024210
Arunraju Chinnaraju (2025)Quantum Computing in Consumer Behavior: A Theoretical Framework for Market Prediction and Decision AnalyticsInternational Journal of Advanced Research in Science, Communication and Technology10.48175/IJARSCT-23352(339-371)Online publication date: 22-Feb-2025
https://doi.org/10.48175/IJARSCT-23352
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%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4,467
Total Citations
View Citations
18,151
Total Downloads

Downloads (Last 12 months)5,154
Downloads (Last 6 weeks)700

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dodis YGuan JHall PLin A(2025)HELP: Everlasting Privacy through Server-Aided RandomnessIACR Communications in Cryptology10.62056/a3w7tr-10k1:4Online publication date: 13-Jan-2025
https://doi.org/10.62056/a3w7tr-10k
Rosenfeld R(2025)Notas sobre complejidad computacionalNotes on Computational ComplexityRevista Abierta de Informática Aplicada10.59471/raia20242108:1(109-139)Online publication date: 31-Jan-2025
https://doi.org/10.59471/raia2024210
Arunraju Chinnaraju (2025)Quantum Computing in Consumer Behavior: A Theoretical Framework for Market Prediction and Decision AnalyticsInternational Journal of Advanced Research in Science, Communication and Technology10.48175/IJARSCT-23352(339-371)Online publication date: 22-Feb-2025
https://doi.org/10.48175/IJARSCT-23352
Faisal GAbbood S(2025)Integrating Quantum Computing and Predictive Analytics and Their Role in Reducing Costs and Achieving Sustainable Development GoalsJournal of Lifestyle and SDGs Review10.47172/2965-730X.SDGsReview.v5.n03.pe055735:3(e05573)Online publication date: 27-Feb-2025
https://doi.org/10.47172/2965-730X.SDGsReview.v5.n03.pe05573
Andronikos TSirokofskich A(2025)A Novel Two- and Three-Player Scheme for Quantum Direct CommunicationSymmetry10.3390/sym1703037917:3(379)Online publication date: 2-Mar-2025
https://doi.org/10.3390/sym17030379
Karuppasamy KPuram VJohnson SThomas J(2025)A Comprehensive Review of Quantum Circuit Optimization: Current Trends and Future DirectionsQuantum Reports10.3390/quantum70100027:1(2)Online publication date: 1-Jan-2025
https://doi.org/10.3390/quantum7010002
Zhang MWang JLai JDong MZhu ZMa RYang J(2025)Research on Development Progress and Test Evaluation of Post-Quantum CryptographyEntropy10.3390/e2702021227:2(212)Online publication date: 18-Feb-2025
https://doi.org/10.3390/e27020212
Oliveira Santos VCosta Rocha PThé JGharabaghi B(2025)Optimizing the Architecture of a Quantum–Classical Hybrid Machine Learning Model for Forecasting Ozone Concentrations: Air Quality Management Tool for Houston, TexasAtmosphere10.3390/atmos1603025516:3(255)Online publication date: 23-Feb-2025
https://doi.org/10.3390/atmos16030255
Ярмолатій АЧеремісіна ЛБогом’я В(2025)ЗАГРОЗИ КВАНТОВИХ ОБЧИСЛЕНЬ ДЛЯ КЛАСИЧНИХ КРИПТОГРАФІЧНИХ АЛГОРИТМІВVodnij transport10.33298/2226-8553.2025.1.42.27(248-257)Online publication date: 3-Feb-2025
https://doi.org/10.33298/2226-8553.2025.1.42.27
Murayama KMoriyama YIimura INakayama S(2025)Fundamental Research on Applying Artificial Bee Colony Algorithm to an Optimizer in Variational Quantum EigensolverJournal of Signal Processing10.2299/jsp.29.129:1(1-10)Online publication date: 1-Jan-2025
https://doi.org/10.2299/jsp.29.1
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

Upcoming Conference

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

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations