Quantum algorithm for linear differential equations with exponentially improved dependence on precision

D. W. Berry, A. M. Childs, A. Ostrander, G. Wang · 2017 · Commun. Math. Phys. 356, 1057

| 编号 QC030 | 主题 量子 PDE 求解 | 链接 arXiv:1701.03684 |

摘要

摘要保留原文（英文）

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

We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time. The complexity of the algorithm is polynomial in the logarithm of the inverse error, an exponential improvement over previous quantum algorithms for this problem. Our result builds upon recent advances in quantum linear systems algorithms by encoding the simulation into a sparse, well-conditioned linear system that approximates evolution according to the propagator using a Taylor series. Unlike with finite difference methods, our approach does not require additional hypotheses to ensure numerical stability.

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