论文标题
调查量子近似优化算法在Bang-Bang协议下
Investigating Quantum Approximate Optimization Algorithms under Bang-bang Protocols
论文作者
论文摘要
量子近似优化算法（QAOA）被广泛视为可能使用噪声中间尺度量子（NISQ）设备的用法。我们将算法分析为具有固定总时间和随机贪婪优化方案的BANG-BANG协议。我们研究了Bang-Bang Qaoa在Max-2-Sat上的性能，发现相对于总时间的出现。随着总时间的增加，最佳的Bang-Bang协议会经历许多跳跃和高原性能，它们与标准QAOA公式中越来越多的开关相匹配。在很大程度上，找到全球最佳的Bang-Bang协议和表演遭受的困难变得更加困难。我们还研究了更改随机优化算法的初始条件的影响，并发现可以使用绝热初始化可以找到更好的局部优势。
The quantum approximate optimization algorithm (QAOA) is widely seen as a possible usage of noisy intermediate-scale quantum (NISQ) devices. We analyze the algorithm as a bang-bang protocol with fixed total time and a randomized greedy optimization scheme. We investigate the performance of bang-bang QAOA on MAX-2-SAT, finding the appearance of phase transitions with respect to the total time. As the total time increases, the optimal bang-bang protocol experiences a number of jumps and plateaus in performance, which match up with an increasing number of switches in the standard QAOA formulation. At large times, it becomes more difficult to find a globally optimal bang-bang protocol and performances suffer. We also investigate the effects of changing the initial conditions of the randomized optimization algorithm and see that better local optima can be found by using an adiabatic initialization.
