Quantum Simulation of Electronic Structure with Linear Depth and Connectivity

Ian D. Kivlichan, Jarrod McClean, Nathan Wiebe, Craig Gidney, Alán Aspuru-Guzik, Garnet Kin-Lic Chan, Ryan Babbush · 2018 · Physical Review Letters 120:110501

| 编号 QAPP004 | 主题 应用 | 链接 arXiv:1711.04789 |

摘要

摘要保留原文（英文）

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

As physical implementations of quantum architectures emerge, it is increasingly important to consider the cost of algorithms for practical connectivities between qubits. We show that by using an arrangement of gates that we term the fermionic swap network, we can simulate a Trotter step of the electronic structure Hamiltonian in exactly $N$ depth and with $N^2/2$ two-qubit entangling gates, and prepare arbitrary Slater determinants in at most $N/2$ depth, all assuming only a minimal, linearly connected architecture. We conjecture that no explicit Trotter step of the electronic structure Hamiltonian is possible with fewer entangling gates, even with arbitrary connectivities. These results represent significant practical improvements on the cost of most Trotter based algorithms for both variational and phase estimation based simulation of quantum chemistry.

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