IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v17y2019i4d10.1007_s10288-019-00424-y.html
   My bibliography  Save this article

Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models

Author

Listed:
  • Fred Glover

    (University of Colorado)

  • Gary Kochenberger

    (University of Colorado at Denver)

  • Yu Du

    (University of Colorado at Denver)

Abstract

Quantum Bridge Analytics relates generally to methods and systems for hybrid classical-quantum computing, and more particularly is devoted to developing tools for bridging classical and quantum computing to gain the benefits of their alliance in the present and enable enhanced practical application of quantum computing in the future. This is the first of a two-part tutorial that surveys key elements of Quantum Bridge Analytics and its applications, with an emphasis on supplementing models with numerical illustrations. In Part 1 (the present paper) we focus on the Quadratic Unconstrained Binary Optimization model which is presently the most widely applied optimization model in the quantum computing area, and which unifies a rich variety of combinatorial optimization problems.

Suggested Citation

  • Fred Glover & Gary Kochenberger & Yu Du, 2019. "Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models," 4OR, Springer, vol. 17(4), pages 335-371, December.
    • Handle: RePEc:spr:aqjoor:v:17:y:2019:i:4:d:10.1007_s10288-019-00424-y
    DOI: 10.1007/s10288-019-00424-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-019-00424-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10288-019-00424-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gary Kochenberger & Jin-Kao Hao & Fred Glover & Mark Lewis & Zhipeng Lü & Haibo Wang & Yang Wang, 2014. "The unconstrained binary quadratic programming problem: a survey," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 58-81, July.
    2. Wang, Yang & Lü, Zhipeng & Glover, Fred & Hao, Jin-Kao, 2012. "Path relinking for unconstrained binary quadratic programming," European Journal of Operational Research, Elsevier, vol. 223(3), pages 595-604.
    3. Michele Samorani & Yang Wang & Yang Wang & Zhipeng Lv & Fred Glover, 2019. "Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem," Journal of Heuristics, Springer, vol. 25(4), pages 629-642, October.
    4. Glover, Fred & Lewis, Mark & Kochenberger, Gary, 2018. "Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems," European Journal of Operational Research, Elsevier, vol. 265(3), pages 829-842.
    5. Elad Schneidman & Michael J. Berry & Ronen Segev & William Bialek, 2006. "Weak pairwise correlations imply strongly correlated network states in a neural population," Nature, Nature, vol. 440(7087), pages 1007-1012, April.
    6. Alidaee, Bahram & Kochenberger, Gary & Lewis, Karen & Lewis, Mark & Wang, Haibo, 2008. "A new approach for modeling and solving set packing problems," European Journal of Operational Research, Elsevier, vol. 186(2), pages 504-512, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fred Glover & Gary Kochenberger & Rick Hennig & Yu Du, 2022. "Quantum bridge analytics I: a tutorial on formulating and using QUBO models," Annals of Operations Research, Springer, vol. 314(1), pages 141-183, July.
    2. Camille Grange & Michael Poss & Eric Bourreau, 2023. "An introduction to variational quantum algorithms for combinatorial optimization problems," 4OR, Springer, vol. 21(3), pages 363-403, September.
    3. Yves Crama & Michel Grabisch & Silvano Martello, 2022. "Preface," Annals of Operations Research, Springer, vol. 314(1), pages 1-3, July.
    4. Alessio Troiani, 2024. "Probabilistic Cellular Automata Monte Carlo for the Maximum Clique Problem," Mathematics, MDPI, vol. 12(18), pages 1-16, September.
    5. Ajagekar, Akshay & You, Fengqi, 2022. "Quantum computing and quantum artificial intelligence for renewable and sustainable energy: A emerging prospect towards climate neutrality," Renewable and Sustainable Energy Reviews, Elsevier, vol. 165(C).
    6. Fred Glover & Gary Kochenberger & Moses Ma & Yu Du, 2020. "Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange," 4OR, Springer, vol. 18(4), pages 387-417, December.
    7. Christopher McMahon & Donald McGillivray & Ajit Desai & Francisco Rivadeneyra & Jean-Paul Lam & Thomas Lo & Danica Marsden & Vladimir Skavysh, 2022. "Improving the Efficiency of Payments Systems Using Quantum Computing," Staff Working Papers 22-53, Bank of Canada.
    8. Fu, Wei & Xie, Haipeng & Zhu, Hao & Wang, Hefeng & Jiang, Lizhou & Chen, Chen & Bie, Zhaohong, 2023. "Coordinated post-disaster restoration for resilient urban distribution systems: A hybrid quantum-classical approach," Energy, Elsevier, vol. 284(C).
    9. Yves Crama & Michel Grabisch & Silvano Martello, 2021. "4OR comes of age," 4OR, Springer, vol. 19(1), pages 1-13, March.
    10. Mark W. Lewis & Amit Verma & Todd T. Eckdahl, 2021. "Qfold: a new modeling paradigm for the RNA folding problem," Journal of Heuristics, Springer, vol. 27(4), pages 695-717, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fred Glover & Gary Kochenberger & Rick Hennig & Yu Du, 2022. "Quantum bridge analytics I: a tutorial on formulating and using QUBO models," Annals of Operations Research, Springer, vol. 314(1), pages 141-183, July.
    2. Mark W. Lewis & Amit Verma & Todd T. Eckdahl, 2021. "Qfold: a new modeling paradigm for the RNA folding problem," Journal of Heuristics, Springer, vol. 27(4), pages 695-717, August.
    3. Ricardo N. Liang & Eduardo A. J. Anacleto & Cláudio N. Meneses, 2022. "Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems," Journal of Heuristics, Springer, vol. 28(4), pages 433-479, August.
    4. Fred Glover & Gary Kochenberger & Moses Ma & Yu Du, 2022. "Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange," Annals of Operations Research, Springer, vol. 314(1), pages 185-212, July.
    5. Michele Samorani & Yang Wang & Yang Wang & Zhipeng Lv & Fred Glover, 2019. "Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem," Journal of Heuristics, Springer, vol. 25(4), pages 629-642, October.
    6. Xiaoyuan Liu & Hayato Ushijima-Mwesigwa & Avradip Mandal & Sarvagya Upadhyay & Ilya Safro & Arnab Roy, 2022. "Leveraging special-purpose hardware for local search heuristics," Computational Optimization and Applications, Springer, vol. 82(1), pages 1-29, May.
    7. Fred Glover & Jin-Kao Hao, 2016. "f-Flip strategies for unconstrained binary quadratic programming," Annals of Operations Research, Springer, vol. 238(1), pages 651-657, March.
    8. Yang Wang & Jin-Kao Hao & Fred Glover & Zhipeng Lü & Qinghua Wu, 2016. "Solving the maximum vertex weight clique problem via binary quadratic programming," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 531-549, August.
    9. Fred Glover & Gary Kochenberger & Moses Ma & Yu Du, 2020. "Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange," 4OR, Springer, vol. 18(4), pages 387-417, December.
    10. Fred Glover & Jin-Kao Hao, 2016. "f-Flip strategies for unconstrained binary quadratic programming," Annals of Operations Research, Springer, vol. 238(1), pages 651-657, March.
    11. Lipovetsky, Stan, 2018. "Quantum paradigm of probability amplitude and complex utility in entangled discrete choice modeling," Journal of choice modelling, Elsevier, vol. 27(C), pages 62-73.
    12. Mark L Ioffe & Michael J Berry II, 2017. "The structured ‘low temperature’ phase of the retinal population code," PLOS Computational Biology, Public Library of Science, vol. 13(10), pages 1-31, October.
    13. Katarína Bod’ová & Enikő Szép & Nicholas H Barton, 2021. "Dynamic maximum entropy provides accurate approximation of structured population dynamics," PLOS Computational Biology, Public Library of Science, vol. 17(12), pages 1-22, December.
    14. MohammadReza Zahedian & Mahsa Bagherikalhor & Andrey Trufanov & G. Reza Jafari, 2022. "Financial Crisis in the Framework of Non-zero Temperature Balance Theory," Papers 2202.03198, arXiv.org.
    15. Gary Kochenberger & Jin-Kao Hao & Fred Glover & Mark Lewis & Zhipeng Lü & Haibo Wang & Yang Wang, 2014. "The unconstrained binary quadratic programming problem: a survey," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 58-81, July.
    16. Gaëlle Desbordes & Jianzhong Jin & Chong Weng & Nicholas A Lesica & Garrett B Stanley & Jose-Manuel Alonso, 2008. "Timing Precision in Population Coding of Natural Scenes in the Early Visual System," PLOS Biology, Public Library of Science, vol. 6(12), pages 1-11, December.
    17. Yasser Roudi & Sheila Nirenberg & Peter E Latham, 2009. "Pairwise Maximum Entropy Models for Studying Large Biological Systems: When They Can Work and When They Can't," PLOS Computational Biology, Public Library of Science, vol. 5(5), pages 1-18, May.
    18. Punnen, Abraham P. & Wang, Yang, 2016. "The bipartite quadratic assignment problem and extensions," European Journal of Operational Research, Elsevier, vol. 250(3), pages 715-725.
    19. Wang, Yang & Lü, Zhipeng & Glover, Fred & Hao, Jin-Kao, 2012. "Path relinking for unconstrained binary quadratic programming," European Journal of Operational Research, Elsevier, vol. 223(3), pages 595-604.
    20. Maulana, Ardian & Situngkir, Hokky, 2015. "Korelasi Bebas-skala dalam Studi Geo-politik Pemilihan [Scale-free correlation within Geopolitics of Election Studies]," MPRA Paper 66351, University Library of Munich, Germany.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:aqjoor:v:17:y:2019:i:4:d:10.1007_s10288-019-00424-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.