Optimizing Quantum Circuits for Arithmetic

Thomas Häner, Martin Roetteler, Krysta M. Svore · 2018 · arXiv quant-ph

| 编号 QNF007 | 主题 数值格式 | 链接 arXiv:1805.12445 |

摘要

摘要保留原文（英文）

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

Many quantum algorithms make use of oracles which evaluate classical functions on a superposition of inputs. In order to facilitate implementation, testing, and resource estimation of such algorithms, we present quantum circuits for evaluating functions that are often encountered in the quantum algorithm literature. This includes Gaussians, hyperbolic tangent, sine/cosine, inverse square root, arcsine, and exponentials. We use insights from classical high-performance computing in order to optimize our circuits and implement a quantum software stack module which allows to automatically generate circuits for evaluating piecewise smooth functions in the computational basis. Our circuits enable more detailed cost analyses of various quantum algorithms, allowing to identify concrete applications of future quantum computing devices. Furthermore, our resource estimates may guide future research aiming to reduce the costs or even the need for arithmetic in the computational basis altogether.

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