论文标题
多发QAOA和高级搅拌机
Multi-round QAOA and advanced mixers on a trapped-ion quantum computer
论文作者
论文摘要
图表上的组合优化问题在科学和工程中具有广泛的应用。量子近似优化算法（QAOA）是一种通过应用多个变化电路在量子计算机上解决这些问题的方法。但是，存在一些挑战，限制了QAOA的现实应用。在本文中，我们在一台被困的量子计算机上演示了QAOA的结果，随着多个任意图上的多个问题的回合数量而有所改善。我们还展示了一种先进的混合哈密顿量，该混合允许对所有最佳溶液进行预定权重采样。我们的结果是将量子算法应用于现实世界问题的一步。
Combinatorial optimization problems on graphs have broad applications in science and engineering. The Quantum Approximate Optimization Algorithm (QAOA) is a method to solve these problems on a quantum computer by applying multiple rounds of variational circuits. However, there exist several challenges limiting the real-world applications of QAOA. In this paper, we demonstrate on a trapped-ion quantum computer that QAOA results improve with the number of rounds for multiple problems on several arbitrary graphs. We also demonstrate an advanced mixing Hamiltonian that allows sampling of all optimal solutions with predetermined weights. Our results are a step towards applying quantum algorithms to real-world problems.
