Quantum algorithms and the finite element method

A. Montanaro, S. Pallister · 2016 · Phys. Rev. A 93, 032324

| 编号 QC015 | 主题 量子算法工具箱 | 链接 10.1103/PhysRevA.93.032324 |

摘要

摘要保留原文（英文）

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

The finite element method is used to approximately solve boundary value problems for differential equations. The method discretises the parameter space and finds an approximate solution by solving a large system of linear equations. Here we investigate the extent to which the finite element method can be accelerated using an efficient quantum algorithm for solving linear equations. We consider the representative general question of approximately computing a linear functional of the solution to a boundary value problem, and compare the quantum algorithm’s theoretical performance with that of a standard classical algorithm – the conjugate gradient method. Prior work had claimed that the quantum algorithm could be exponentially faster, but did not determine the overall classical and quantum runtimes required to achieve a predetermined solution accuracy. Taking this into account, we find that the quantum algorithm can achieve a polynomial speedup, the extent of which grows with the dimension of the partial differential equation. In addition, we give evidence that no improvement of the quantum algorithm could lead to a super-polynomial speedup when the dimension is fixed and the solution satisfies certain smoothness properties.

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