基于Woodbury恒等式的近期量子求解线性方程组算法
A near-term quantum algorithm for solving linear systems of equations based on the Woodbury identity
AI总结:
针对现有量子线性方程组求解算法对容错硬件要求高或优化易陷局部最优的问题,提出基于Woodbury恒等式的近期量子算法,仅用基本量子子程序在IBM量子计算机上以2%误差求解超1600万方程。
摘要:
求解线性方程组的量子算法因其潜在的加速优势和在众多应用中求解线性方程的重要性而备受关注。然而,应用这些算法可能具有挑战性。Harrow-Hassidim-Lloyd算法及其改进版本需要适用于容错硬件的复杂子程序,例如Hamiltonian simulation,这使其不适合当前的硬件。另一方面,变分算法涉及昂贵的优化循环,容易出现barren plateaus和局部最优。我们描述了一种求解线性方程组的量子算法,避免了这些问题。我们的算法基于Woodbury恒等式,该恒等式解析地描述了一个矩阵的逆,该矩阵是另一个(易于求逆的)矩阵的低秩修改。这种方法仅利用基本量子子程序,如Hadamard test或swap test,因此非常适合当前的硬件。没有优化循环,因此barren plateaus和局部最优不会构成问题。该恒等式的低秩特性使我们能够高效地向量子计算机传输信息以及从中提取信息。这种方法可以在当前硬件上产生准确的结果。作为证据,我们使用IBM的Auckland量子计算机,估计了一个涉及超过1600万个方程的系统的解的内积,误差为2%。据我们所知,此前从未在量子计算机上以这种精度求解过如此规模的方程组。
英文摘要:
Quantum algorithms for solving linear systems of equations have generated excitement because of the potential speed-ups involved and the importance of solving linear equations in many applications. However, applying these algorithms can be challenging. The Harrow-Hassidim-Lloyd algorithm and improvements thereof require complex subroutines suitable for fault-tolerant hardware such as Hamiltonian simulation, making it ill-suited to current hardware. Variational algorithms, on the other hand, involve expensive optimization loops, which can be prone to barren plateaus and local optima. We describe a quantum algorithm for solving linear systems of equations that avoids these problems. Our algorithm is based on the Woodbury identity, which analytically describes the inverse of a matrix that is a low-rank modification of another (easily-invertible) matrix. This approach only utilizes basic quantum subroutines like the Hadamard test or the swap test, so it is well-suited to current hardware. There is no optimization loop, so barren plateaus and local optima do not present a problem. The low-rank aspect of the identity enables us to efficiently transfer information to and from the quantum computer. This approach can produce accurate results on current hardware. As evidence of this, we estimate an inner product involving the solution of a system of more than 16 million equations with 2% error using IBM's Auckland quantum computer. To our knowledge, no system of equations this large has previously been solved to this level of accuracy on a quantum computer.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。