Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Quantum Search on Structured Problems

  • Conference paper
  • First Online:
Quantum Computing and Quantum Communications (QCQC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1509))

Abstract

This paper shows how a basic property of unitary transformations can be used for meaningful computations. This approach immediately leads to search-type applications, where it improves the number of steps by a squareroot - a simple minded search that takes N steps, can be improved to approximately √N steps. The quantum search algorithm is one of several immediate consequences of this framework. Several novel search-related applications are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M. Boyer, G. Brassard, P. Hoyer & A. Tapp, Tight bounds on quantum searching, Proc., PhysComp 1996 (lanl e-print quant-ph/ 9605034).

    Google Scholar 

  2. E. Bernstein and U. Vazirani, Quantum complexity theory, Proc. 25th ACM Symposium on Theory of Computing, 1993; for full paper see-SIAM Journal on Computing, vol. 26, no. 5, Oct 1997.

    Google Scholar 

  3. C. H. Bennett, E. Bernstein, G. Brassard & U. Vazirani, Strengths and weaknesses of quantum computing, SIAM Journal on Computing, pp. 1510–1524, vol. 26, no. 5, October 1997.

    Article  MATH  MathSciNet  Google Scholar 

  4. D. Deutsch & R. Josza, Rapid solution of problems by quantum computation, Proc. Royal Society of London, A400, 1992, pp. 73–90.

    Google Scholar 

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

    Google Scholar 

  6. L. Grover, A framework for fast quantum mechanical algorithms, lanl e-print quant-ph/9711043, to be presented in ACM Symposium on Theory of Computation, May 1998 (STOC’ 98).

    Google Scholar 

  7. L. Grover, Quantum computers can search rapidly by using almost any transformation, lanl e-print quant-ph/9712011.

    Google Scholar 

  8. T. Hogg, A framework for structured quantum search, lanl e-print quant-ph/9701013.

    Google Scholar 

  9. G. Brassard, Searching a quantum phone book, Science, Jan. 31, 1997, 627–628.

    Google Scholar 

  10. C. H. Bennett, Space-Time trade-offs in reversible computing, SIAM Journal of Computing, vol. 18, pages 766–776, 1989.

    Article  MATH  Google Scholar 

  11. L. K. Grover, Quantum Mechanics helps in searching for a needle in a haystack, Phys. Rev. Letters, vol. 78(2), 1997, pages 325–328 (lanl e-print quant-ph/9605043).

    Article  Google Scholar 

  12. L. K. Grover, A fast quantum mechanical algorithm for database search, Proceedings 28th Annual Symposium on the Theory of Computing (STOC) 1996, pp. 212–219.

    Google Scholar 

  13. E. Farhi & S. Gutmann, Quantum mechanical square root speedup in a structured search problem, lanl e-print quant-ph/9711035.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. 3C-404A Bell Labs, 600 Mountain Avenue, Murray Hill, NJ, 07974

    Lov K. Grover

Authors
  1. Lov K. Grover
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Jet Propulsion Laboratory, California Institute of Technology Quantum Algorithms and Technologies Group Information and Computing Technologies Research Section, Mail Stop 126-347, Pasadena, CA, 91109-8099, USA

    Colin P. Williams

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grover, L.K. (1999). Quantum Search on Structured Problems. In: Williams, C.P. (eds) Quantum Computing and Quantum Communications. QCQC 1998. Lecture Notes in Computer Science, vol 1509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49208-9_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-49208-9_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65514-5

  • Online ISBN: 978-3-540-49208-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation