arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.09333quant-ph
收藏

基于最小potential energy的变分量子算法求解Poisson方程

Variational quantum algorithm based on the minimum potential energy for solving the Poisson equation

Yuki Sato, Ruho Kondo, Satoshi Koide, Hideki Takamatsu, Nobuyuki Imoto

摘要:

计算机辅助工程技术在现代工程发展中是不可缺少的。特别是,偏微分方程通常用于模拟物理现象的动力学,但非常大的系统通常在合理的计算时间内难以处理,即使使用超级计算机。为了克服经典计算的固有局限性,我们提出了一种求解泊松方程的变分量子算法,该算法可以在有噪声的中等规模量子器件中实现。该方法将泊松方程的总势能定义为哈密顿量,并将其分解为泡利算子和简单观测量的线性组合。然后,相对于参数化的量子态,使哈密顿量的期望值最小化。由于分解项的数量与问题的大小无关,因此该方法需要相对较少的量子测量。数值实验表明,与经典计算方法和变分量子方法相比,该方法具有更快的计算速度。我们相信,我们的方法使量子计算机辅助技术更接近未来工程开发中的应用。代码可在https://github.com/ToyotaCRDL/VQAPoisson上获得。

英文摘要:

Computer-aided engineering techniques are indispensable in modern engineering developments. In particular, partial differential equations are commonly used to simulate the dynamics of physical phenomena, but very large systems are often intractable within a reasonable computation time, even when using supercomputers. To overcome the inherent limit of classical computing, we present a variational quantum algorithm for solving the Poisson equation that can be implemented in noisy intermediate-scale quantum devices. The proposed method defines the total potential energy of the Poisson equation as a Hamiltonian, which is decomposed into a linear combination of Pauli operators and simple observables. The expectation value of the Hamiltonian is then minimized with respect to a parameterized quantum state. Because the number of decomposed terms is independent of the size of the problem, this method requires relatively few quantum measurements. Numerical experiments demonstrate the faster computing speed of this method compared with classical computing methods and a previous variational quantum approach. We believe that our approach brings quantum computer-aided techniques closer to future applications in engineering developments. Code is available at https://github.com/ToyotaCRDL/VQAPoisson.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑