Workshop on
Quantum Computing and Operations Research

Michael P. Friedlander, University of British Columbia: Large-scale convex optimization

Daniel Lidar, University of Southern California: Quantum adiabatic optimization

Ojas Parekh, Sandia National Laboratories: Quantum approximation algorithms

Carleton Coffrin, Los Alamos National Laboratory: Lessons learned in 5 years of benchmarking quantum annealing hardware

Sarah Powers, Oak Ridge National Laboratory: Mapping the applicability of the QAOA algorithm to the OR landscape

Eleanor Rieffel, NASA AMES: Quantum, quantum-classical hybrid, and distributed quantum algorithms for problems in operations research

Ruslan Shaydulin, JP Morgan Chase: Quantum optimization of financial problems

Eugene Tang, Massachusetts Institute of Technology: An overview of QAOA: applications and limitations of symmetry and locality

Tamas Terlaky, Lehigh University: On quantum interior point methods for linear and semidefinite optimization

Xiaodi Wu, University of Maryland: Quantum Hamiltonian descent

Tiago Andrade, PSR Inc.: JuMP To QUBO automatic reformulation

Cheng Chi, University of Toronto: Quantum graph partitioning for delaying cascade failures phase transition in financial markets

Reuben Tate, GeorgiaTech: Improving QAOA via classical warm-starts

Robin Brown, Stanford: Copositive optimization via Ising solvers

Friedrich Wagner, Fraunhofer IIC IIS: Improving quantum computation by optimized qubit routing

Oksana Pichugina, University of Toronto: New classes of polynomially solvable permutation-based problems with applications

Haesol Im, University of Waterloo: Robust interior point method for quantum key distribution computation

David E. Bernal Neira, NASA AMES: Benchmarking the operation of quantum heuristics and Ising machines: scoring parameter setting strategies on real-world optimization applications

Catherine McGeoch, DWave: Milestones on the quantum utility highway

Md Tabish Haque, IIT Kanpur: An application of quantum computing to the capacitated vehicle routing problem

Phillip Kerger, Johns Hopkins University: Quantum-accelerated distributed algorithms for the Steiner tree and directed minimum spanning tree problems

Jonas Jaeger, University of British Columbia: Universal expressiveness of quantum machine learning classifiers