Quantum circuits for floating-point arithmetic
Thomas Häner, Mathias Soeken, Martin Roetteler, Krysta M. Svore · 2018 · arXiv quant-ph
| 编号 QNF001 | 主题 数值格式 | 链接 arXiv:1807.02023 |
摘要
摘要保留原文（英文）
摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。
Quantum algorithms to solve practical problems in quantum chemistry, materials science, and matrix inversion often involve a significant amount of arithmetic operations which act on a superposition of inputs. These have to be compiled to a set of fault-tolerant low-level operations and throughout this translation process, the compiler aims to come close to the Pareto-optimal front between the number of required qubits and the depth of the resulting circuit. In this paper, we provide quantum circuits for floating-point addition and multiplication which we find using two vastly different approaches. The first approach is to automatically generate circuits from classical Verilog implementations using synthesis tools and the second is to generate and optimize these circuits by hand. We compare our two approaches and provide evidence that floating-point arithmetic is a viable candidate for use in quantum computing, at least for typical scientific applications, where addition operations usually do not dominate the computation. All our circuits were constructed and tested using the software tools LIQ and RevKit.
本站词条在引用该文献时，会以 wikilink（sources/QNF001）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。