Skip to main content

How Quantum Computing Can Help with (Continuous) Optimization

  • Chapter
  • First Online:
Decision Making under Constraints

Part of the book series: Studies in Systems, Decision and Control ((SSDC,volume 276))

Abstract

It is known that the use of quantum computing can reduce the time needed for a search in an unsorted array: from the original non-quantum time T to a much smaller quantum computation time \(T_q\sim \sqrt{T}\). In this paper, we show that for a continuous optimization problem, with quantum computing, we can reach almost the same speed-up: namely, we can reduce the non-quantum time T to a much shorter quantum computation time \(\sqrt{T}\cdot \ln (T)\).

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Similar content being viewed by others

References

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

    Google Scholar 

  2. Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325–328 (1997)

    Article  Google Scholar 

  3. Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    Google Scholar 

Download references

Acknowledgements

This work was supported in part by the US National Science Foundation grant HRD-1242122 (Cyber-ShARE Center of Excellence).

The authors are thankful for all the participants of the NMSU/UTEP Workshop on Mathematics, Computer Science, and Computational Science (Las Cruces, New Mexico, April 6, 2019) for valuable suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vladik Kreinovich .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ayub, C., Ceberio, M., Kreinovich, V. (2020). How Quantum Computing Can Help with (Continuous) Optimization. In: Ceberio, M., Kreinovich, V. (eds) Decision Making under Constraints. Studies in Systems, Decision and Control, vol 276. Springer, Cham. https://doi.org/10.1007/978-3-030-40814-5_2

Download citation

Publish with us

Policies and ethics