Quantum Integer Programming (QuIP) 47-779: Lecture Notes
arXiv:2012.11382
Abstract
This lecture series on Quantum Integer Programming (QuIP) -- created by Professor Sridhar Tayur, David E. Bernal, and Dr. Davide Venturelli, a collaboration between CMU and USRA, with the support from Amazon Braket during Fall 2020 -- is intended for students and researchers interested in Integer Programming and the potential of near term quantum and quantum-inspired computing in solving optimization problems. Originally created for Tepper School of Business course 47-779 (at CMU), these were also used for the course ID5840 (at IIT-Madras, by Professors Anil Prabhakar and Prabha Mandayam) whose students (listed at the beginning of each lecture) were scribes. Dr. Vikesh Siddhu, post-doc in CMU Quantum Computing Group, assisted during the lectures, student projects, and with proof-reading this scribe. Through these lectures one will learn to formulate a problem and map it to a Quadratic Unconstrained Binary Optimization (QUBO) problem, understand various mapping and techniques like the Ising model, Graver Augmented Multiseed Algorithm (GAMA), Simulated or Quantum Annealing and QAOA, and ideas on how to solve these Integer problems using these quantum and classical methods.
The course website (with lecture videos and Google Colab notebooks): https://bernalde.github.io/QuIP/
References in corpus (21)
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- A Quantum Approximate Optimization Algorithm
- Adiabatic Quantum Computing
- Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Quantum Annealing and Analog Quantum Computation
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- Size dependence of the minimum excitation gap in the Quantum Adiabatic Algorithm
- Prime factorization using quantum annealing and computational algebraic geometry
- A polynomial oracle-time algorithm for convex integer minimization
- Emulating the coherent Ising machine with a mean-field algorithm
- A Performance Study of the 2D Ising Model on GPUs
- Evaluating Ising Processing Units with Integer Programming
- A Novel Algebraic Geometry Compiling Framework for Adiabatic Quantum Computations
- Graver Bases via Quantum Annealing with Application to Non-Linear Integer Programs
- GAMA: A Novel Algorithm for Non-Convex Integer Programs
- Minimizing polynomial functions on quantum computers
- Highly parallel algorithm for the Ising ground state searching problem
- Knuth-Bendix Completion Algorithm and Shuffle Algebras For Compiling NISQ Circuits