Efficient quantum circuits for diagonal unitaries without ancillas
Welch, Jonathan, Greenbaum, Daniel, Mostame, Sarah, Aspuru-Guzik, Alan · 2014 · New Journal of Physics
| 编号 NA093 | 主题 线路综合与等价验证 | DOI 10.1088/1367-2630/16/3/033040 |
摘要
摘要保留原文（英文）
摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。
2014 · New Journal of Physics The accurate evaluation of diagonal unitary operators is often the most resource-intensive element of quantum algorithms such as real-space quantum simulation and Grover search. Efficient circuits have been demonstrated in some cases but generally require ancilla registers, which can dominate the qubit resources. In this paper, we point out a correspondence between Walsh functions and a basis for diagonal operators that gives a simple way to construct efficient circuits for diagonal unitaries without ancillas. This correspondence reduces the problem of constructing the minimal-depth circuit within a given error tolerance, for an arbitrary diagonal unitary in the basis, to that of finding the minimal-length Walsh-series approximation to the function . We apply this approach to the quantum simulation of the classical Eckart barrier problem of quantum chemistry, demonstrating that high-fidelity quantum simulations can be achieved with few qubits and low depth.
全文共 8 页；文本提取件位于 .extracted/papers/NA093.txt（不随站点发布）。
本站词条在引用该文献时，会以 wikilink（sources/NA093）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。