Measurement-driven Quantum Approximate Optimization

TL;DR

This paper introduces a measurement-driven quantum algorithm for combinatorial optimization that generalizes imaginary-time evolution, adapts to constrained problems, and includes an adaptive variant to improve efficiency and avoid local minima.

Contribution

It extends non-unitary evolution algorithms to approximate and constrained optimization, proposing adaptive strategies and resource tradeoffs for quantum combinatorial problems.

Findings

Bounded success probability for measurement steps.

Effective handling of constrained optimization via feasibility-preserving methods.

Adaptive algorithm variant improves convergence and avoids local minima.

Abstract

Algorithms based on non-unitary evolution have attracted much interest for ground state preparation on quantum computers. One recently proposed method makes use of ancilla qubits and controlled unitary operators to implement weak measurements related to imaginary-time evolution. In this work we specialize and extend this approach to the setting of combinatorial optimization. We first generalize the algorithm from exact to approximate optimization, taking advantage of several properties unique to classical problems. In particular we show how to select parameters such that the success probability of each measurement step is bounded away from $1/2$. We then show how to adapt our paradigm to the setting of constrained optimization for a number of important classes of hard problem constraints. For this we compare and contrast both penalty-based and feasibility-preserving approaches, elucidating the significant advantages of the latter approach. Our approach is general and may be applied to easy-to-prepare initial states as a standalone algorithm, or deployed as a quantum postprocessing stage to improve performance of a given parameterized quantum circuit. We then propose a more sophisticated variant of our algorithm that adaptively applies a mixing operator or not, based on the measurement outcomes seen so far, as to speeds up the algorithm and helps the system evolution avoid slowing down or getting stuck suboptimally. In particular, we show that mixing operators from the quantum alternating operator ansatz can be imported directly, both for the necessary eigenstate scrambling operator and for initial state preparation, and discuss quantum resource tradeoffs.