Variational quantum algorithms for nonlinear problems

M. Lubasch, J. Joo, P. Moinier, M. Kiffner, D. Jaksch · 2020 · Phys. Rev. A 101, 010301(R)

| 编号 QC026 | 主题 量子 PDE 求解 | 链接 arXiv:1907.09032 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

We show that nonlinear problems including nonlinear partial differential equations can be efficiently solved by variational quantum computing. We achieve this by utilizing multiple copies of variational quantum states to treat nonlinearities efficiently and by introducing tensor networks as a programming paradigm. The key concepts of the algorithm are demonstrated for the nonlinear Schrödinger equation as a canonical example. We numerically show that the variational quantum ansatz can be exponentially more efficient than matrix product states and present experimental proof-of-principle results obtained on an IBM Q device.

本站词条在引用该文献时，会以 wikilink（sources/QC026）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。