Preconditioned quantum linear system algorithm

B. D. Clader, B. C. Jacobs, C. R. Sprouse · 2013 · Phys. Rev. Lett. 110, 250504

| 编号 QC013 | 主题 量子算法工具箱 | 链接 10.1103/PhysRevLett.110.250504 |

摘要

摘要保留原文（英文）

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

We describe a quantum algorithm that generalizes the quantum linear system algorithm [Harrow et al., Phys. Rev. Lett. 103, 150502 (2009)] to arbitrary problem specifications. We develop a state preparation routine that can initialize generic states, show how simple ancilla measurements can be used to calculate many quantities of interest, and integrate a quantum-compatible preconditioner that greatly expands the number of problems that can achieve exponential speedup over classical linear systems solvers. To demonstrate the algorithm’s applicability, we show how it can be used to compute the electromagnetic scattering cross section of an arbitrary target exponentially faster than the best classical algorithm.

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