Advertisement

Function Maximization with Dynamic Quantum Search

  • Charles MoussaEmail author
  • Henri Calandra
  • Travis S. Humble
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11413)

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.

Keywords

Maximization Quantum search Quantum optimization 

Notes

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.

Supplementary material

References

  1. 1.
    Ahuja, A., Kapoor, S.: A quantum algorithm for finding the maximum, November 1999. arXiv:quant-ph/9911082
  2. 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. 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-4MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Cuccaro, S., Draper, T., Kutin, S.: A new quantum ripple-carry addition circuit, October 2004. arXiv:quant-ph/0410184
  5. 5.
    Durr, C., Hoyer, P.: A quantum algorithm for finding the minimum. arXiv preprint arXiv:quant-ph/9607014 (1996)
  6. 6.
    Grover, L.K.: A fast quantum mechanical algorithm for database search (1996)Google Scholar
  7. 7.
    Muñoz-Coreas, E., Thapliyal, H.: T-count optimized design of quantum integer multiplication. CoRR abs/1706.05113 (2017)Google Scholar
  8. 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/2491682CrossRefGoogle Scholar
  9. 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

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.TOTAL American Services Inc.HoustonUSA
  2. 2.Oak Ridge National LaboratoryOak RidgeUSA
  3. 3.TOTAL SACourbevoieFrance

Personalised recommendations