Q-CHOP: Quantum constrained Hamiltonian optimization
<|reference_start|>Q-CHOP: Quantum constrained Hamiltonian optimization: Combinatorial optimization problems that arise in science and industry typically have constraints. Yet the presence of constraints makes them challenging to tackle using both classical and quantum optimization algorithms. We propose a new quantum algorithm for constrained optimization, which we call quantum constrained Hamiltonian optimization (Q-CHOP). Our algorithm leverages the observation that for many problems, while the best solution is difficult to find, the worst feasible (constraint-satisfying) solution is known. The basic idea is to to enforce a Hamiltonian constraint at all times, thereby restricting evolution to the subspace of feasible states, and slowly "rotate" an objective Hamiltonian to trace an adiabatic path from the worst feasible state to the best feasible state. We additionally propose a version of Q-CHOP that can start in any feasible state. Finally, we benchmark Q-CHOP against the commonly-used adiabatic algorithm with constraints enforced using a penalty term and find that Q-CHOP performs consistently better on a wide range of problems, including textbook problems on graphs, knapsack, combinatorial auction, as well as a real-world financial use case, namely bond exchange-traded fund basket optimization.<|reference_end|>
@article{perlin2024q-chop:,
    title={Q-CHOP: Quantum constrained Hamiltonian optimization},
    author={Michael A. Perlin, Ruslan Shaydulin, Benjamin P. Hall, Pierre Minssen,
  Changhao Li, Kabir Dubey, Rich Rines, Eric R. Anschuetz, Marco Pistoia,
  Pranav Gokhale},
    journal={arXiv preprint arXiv:2403.05653},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.05653},
    primaryClass={quant-ph cs.ET}
}