Five Starter Problems: Solving Quadratic Unconstrained Binary Optimization Models on Quantum Computers (2401.08989v3)
Abstract: This tutorial offers a quick, hands-on introduction to solving Quadratic Unconstrained Binary Optimization (QUBO) models on currently available quantum computers and their simulators. We cover both IBM and D-Wave machines: IBM utilizes a gate-circuit architecture, and D-Wave is a quantum annealer. We provide examples of three canonical problems and two models from practical applications. The tutorial is structured to bridge the gap between theory and practice: we begin with an overview of QUBOs, explain their relevance and connection to quantum algorithms, introduce key quantum computing concepts, provide the foundations for two quantum heuristics, and provide detailed implementation guides. An associated GitHub repository provides the codes in five companion notebooks. In addition to reaching undergraduate and graduate students in computationally intensive disciplines, this article aims to reach working industry professionals seeking to explore the potential of near-term quantum applications. As our title indicates, this tutorial is intended to be a starting point in a journey towards solving more complex QUBOs on quantum computers.
- Quantum and quantum-inspired methods for de novo discovery of altered cancer pathways. bioRxiv, 2019.
- Amazon Web Services. Amazon Braket, 2020.
- Various authors. Qiskit Textbook. Github, 2023.
- Quantum Integer Programming (QuIP) 47-779: Lecture Notes, 2021.
- Mapping constrained optimization problems to quantum annealing with application to fault diagnosis. Frontiers in ICT, 3, 2016.
- Improved parameterized upper bounds for Vertex Cover. In Mathematical Foundations of Computer Science 2006, pages 238–249, Berlin, Heidelberg, 2006. Springer Berlin Heidelberg.
- Clayton W. Commander. Maximum cut problem, MAX-CUT, pages 1991–1999. Springer US, Boston, MA, 2009.
- IBM ILOG Cplex. V12. 1: User’s manual for cplex. International Business Machines Corporation, 46(53):157, 2009.
- An introduction to quantum annealing. RAIRO - Theoretical Informatics and Applications, 45, 07 2011.
- A quantum approximate optimization algorithm, 2014.
- Grover adaptive search for constrained polynomial binary optimization. Quantum, 5:428, April 2021.
- The unconstrained binary quadratic programming problem: a survey. Journal of Combinatorial Optimization, 28:58 – 81, 2014.
- Johnny Hooyberghs. Azure Quantum, pages 307–339. Apress, Berkeley, CA, 2022.
- A quantum-classical cloud platform optimized for variational hybrid algorithms. Quantum Science and Technology, 5(2):024003, April 2020.
- Optimization by simulated annealing. Science, 220(4598):671–680, 1983.
- Genomic and epigenomic landscapes of adult de novo acute myeloid leukemia. The New England journal of medicine, 368 22:2059–74, 2013.
- Andrew Lucas. Ising formulations of many NP problems. Frontiers in Physics, 2, 2014.
- Catherine C McGeoch. Adiabatic Quantum Computation and Quantum Annealing. Morgan&Claypool, Kenfield, CA, 2014.
- Stephan Mertens. Phase transition in the number partitioning problem. Phys. Rev. Lett., 81:4281–4284, Nov 1998.
- Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, New York, NY, USA, 2011.
- A variational eigenvalue solver on a photonic quantum processor. Nature Communications, 5(1), July 2014.
- Qiskit contributors. Qiskit: An open-source framework for quantum computing, 2023.
- Quantum Computing: A Gentle Introduction. The MIT Press, Cambridge, MA, 2014.
- Openqaoa – an sdk for qaoa, 2022.
- Make Your Business Quantum-Ready Today. Management and Business Review, 2023.
- Quantum Annealing Research at CMU: Algorithms, Hardware, Applications. Frontiers of Computer Science, 2024.