Skip to main content

Function Maximization with Dynamic Quantum Search

  • Conference paper
  • First Online:
Quantum Technology and Optimization Problems (QTOP 2019)

Abstract

Finding the maximum value of a function in a dynamic model plays an important role in many application settings, including discrete optimization in the presence of hard constraints. We present an iterative quantum algorithm for finding the maximum value of a function in which prior search results update the acceptable response. Our approach is based on quantum search and utilizes a dynamic oracle function to mark items in a specified input set. As a realization of function optimization, we verify the correctness of the algorithm using numerical simulations of quantum circuits for the Knapsack problem. Our simulations make use of an explicit oracle function based on arithmetic operations and a comparator subroutine, and we verify these implementations using numerical simulations up to 30 qubits.

T. S. Humble—This manuscript has been authored by UT-Battelle, LLC, under Contract No. DE-AC0500OR22725 with the U.S. Department of Energy. The United States Government retains and the publisher, by accepting the article for publication, acknowledges that the United States Government retains a non-exclusive, paid-up, irrevocable, world-wide license to publish or reproduce the published form of this manuscript, or allow others to do so, for the United States Government purposes. The Department of Energy will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan.

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja, A., Kapoor, S.: A quantum algorithm for finding the maximum, November 1999. arXiv:quant-ph/9911082

  2. Boyer, M., Brassard, G., Hoeyer, P., Tapp, A.: Tight bounds on quantum searching (1996). https://doi.org/10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P

  3. Chakrabarty, I., Khan, S., Singh, V.: Dynamic Grover search: applications in recommendation systems and optimization problems. Quant. Inf. Process. 16(6), 153 (2017). https://doi.org/10.1007/s11128-017-1600-4

    Article  MathSciNet  MATH  Google Scholar 

  4. Cuccaro, S., Draper, T., Kutin, S.: A new quantum ripple-carry addition circuit, October 2004. arXiv:quant-ph/0410184

  5. Durr, C., Hoyer, P.: A quantum algorithm for finding the minimum. arXiv preprint arXiv:quant-ph/9607014 (1996)

  6. Grover, L.K.: A fast quantum mechanical algorithm for database search (1996)

    Google Scholar 

  7. Muñoz-Coreas, E., Thapliyal, H.: T-count optimized design of quantum integer multiplication. CoRR abs/1706.05113 (2017)

    Google Scholar 

  8. Thapliyal, H., Ranganathan, N.: Design of efficient reversible logic-based binary and BCD adder circuits. J. Emerg. Technol. Comput. Syst. 9(3), 17:1–17:31 (2013). https://doi.org/10.1145/2491682

    Article  Google Scholar 

  9. Udrescu, M., Prodan, L., Vladutiu, M.: Implementing quantum genetic algorithms: a solution based on Grover’s algorithm. In: Conference on Computing Frontiers (2006)

    Google Scholar 

Download references

Acknowledgments

CM and HC acknowledge support from Total and TSH acknowledges support from the U.S. Department of Energy, Office of Science, Early Career Research Program. Access to the Atos Quantum Learning Machine was provided by the Quantum Computing Institute at Oak Ridge National Laboratory.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Charles Moussa .

Editor information

Editors and Affiliations

A Pseudo-code for the Knapsack Example

A Pseudo-code for the Knapsack Example

figure a

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Moussa, C., Calandra, H., Humble, T.S. (2019). Function Maximization with Dynamic Quantum Search. In: Feld, S., Linnhoff-Popien, C. (eds) Quantum Technology and Optimization Problems. QTOP 2019. Lecture Notes in Computer Science(), vol 11413. Springer, Cham. https://doi.org/10.1007/978-3-030-14082-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-14082-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-14081-6

  • Online ISBN: 978-3-030-14082-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics