Quantum Algorithms and Circuits for Scientific Computing

Mihir K. Bhaskar, Stuart Hadfield, Anargyros Papageorgiou, Iasonas Petras · 2015 · Quantum Inf. Comput. 16(3&4):197-236

| 编号 QNF005 | 主题 数值格式 | 链接 arXiv:1511.08253 |

摘要

摘要保留原文（英文）

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

Quantum algorithms for scientific computing require modules implementing fundamental functions, such as the square root, the logarithm, and others. We require algorithms that have a well-controlled numerical error, that are uniformly scalable and reversible (unitary), and that can be implemented efficiently. We present quantum algorithms and circuits for computing the square root, the natural logarithm, and arbitrary fractional powers. We provide performance guarantees in terms of their worst-case accuracy and cost. We further illustrate their performance by providing tests comparing them to the respective floating point implementations found in widely used numerical software.

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