Imaginarity as a necessary resource for trainability in QAOA

The quantum approximate optimization algorithm (QAOA) tackles combinatorial problems by tuning a quantum circuit in a classical loop, often guided by gradients. We show that the gradient used to tune the circuit's final parameter is bounded by imaginarity, which weights phase relationships between candidate solutions by how strongly the circuit connects them and how differently the problem scores them. Imaginarity is necessary but not sufficient for a nonzero gradient. We extend the bound to three common noise models and compare it numerically with the gradient in Max-Cut simulations.

Source: arXiv:2608.05093v1 - http://arxiv.org/abs/2608.05093v1 PDF: https://arxiv.org/pdf/2608.05093v1 Original Link: http://arxiv.org/abs/2608.05093v1