Q-CHOP: Quantum constrained Hamiltonian optimization

Understand

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.