Improving Quantum Optimization Algorithms by Constraint Relaxation

Abstract

Quantum optimization is a significant area of quantum computing research with anticipated near-term quantum advantages. Current quantum optimization algorithms, most of which are hybrid variational-Hamiltonian-based algorithms, struggle to present quantum devices due to noise and decoherence. Existing techniques attempt to mitigate these issues through employing different Hamiltonian encodings or Hamiltonian clause pruning, but they often rely on optimistic assumptions rather than a deep analysis of the problem structure. We demonstrate how to formulate the problem Hamiltonian for a quantum approximate optimization algorithm that satisfies all the requirements to correctly describe the considered tactical aircraft deconfliction problem, achieving higher probabilities for finding solutions compared to previous works. Our results indicate that constructing Hamiltonians from an unconventional, quantum-specific perspective with a high degree of entanglement results in a linear instead of exponential number of entanglement gates instead and superior performance compared to standard formulations. Specifically, we achieve a higher probability of finding feasible solutions: finding solutions in nine out of nine instances compared to standard Hamiltonian formulations and quadratic programming formulations known from quantum annealers, which only found solutions in seven out of nine instances. These findings suggest that there is substantial potential for further research in quantum Hamiltonian design and that gate-based approaches may offer superior optimization performance over quantum annealers in the future.

Keywords

• quantum computing
• quantum optimization
• quantum approximate optimization algorithm
• tactical aircraft deconfliction problem
• quadratic unconstrained binary optimization
• Hamiltonian