AI 中文总结
该研究明确虚部（Imaginarity）是QAOA获得非零梯度的必要资源，将其梯度约束扩展至三种噪声模型，并通过Max-Cut模拟完成数值对比，为QAOA的可训练性提供关键理论支撑。
AI 中文摘要
量子近似优化算法（QAOA）通过经典循环中调整量子电路来解决组合问题，通常以梯度为指导。我们证明，用于调整电路最终参数的梯度受虚部（Imaginarity）约束，该量通过电路连接候选解的强度以及问题对它们评分的差异来权衡候选解之间的相位关系。虚部（Imaginarity）是获得非零梯度的必要条件，但非充分条件。我们将该约束扩展到三种常见噪声模型，并在Max-Cut模拟中与梯度进行数值比较。
英文摘要
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.
