Department of Physics , Imperial College London , London SW7 2AZ , United Kingdom.
Department of Physics , Tufts University , Medford , Massachusetts 02155 , United States.
J Chem Theory Comput. 2018 Nov 13;14(11):5617-5630. doi: 10.1021/acs.jctc.8b00450. Epub 2018 Oct 2.
The ability to perform classically intractable electronic structure calculations is often cited as one of the principal applications of quantum computing. A great deal of theoretical algorithmic development has been performed in support of this goal. Most techniques require a scheme for mapping electronic states and operations to states of and operations upon qubits. The two most commonly used techniques for this are the Jordan-Wigner transformation and the Bravyi-Kitaev transformation. However, comparisons of these schemes have previously been limited to individual small molecules. In this paper, we discuss resource implications for the use of the Bravyi-Kitaev mapping scheme, specifically with regard to the number of quantum gates required for simulation. We consider both small systems, which may be simulatable on near-future quantum devices, and systems sufficiently large for classical simulation to be intractable. We use 86 molecular systems to demonstrate that the use of the Bravyi-Kitaev transformation is typically at least approximately as efficient as the canonical Jordan-Wigner transformation and results in substantially reduced gate count estimates when performing limited circuit optimizations.
执行经典上难以处理的电子结构计算的能力通常被认为是量子计算的主要应用之一。为了支持这一目标,已经进行了大量的理论算法开发。大多数技术都需要一种将电子态和操作映射到量子位的态和操作的方案。为此,最常用的两种技术是 Jordan-Wigner 变换和 Bravyi-Kitaev 变换。然而,以前对这些方案的比较仅限于单个小分子。在本文中,我们讨论了使用 Bravyi-Kitaev 映射方案的资源影响,特别是对于模拟所需的量子门数量。我们考虑了两种系统:一种是可以在近期的量子设备上模拟的小型系统,另一种是对于经典模拟来说过于复杂的大型系统。我们使用 86 个分子系统证明,Bravyi-Kitaev 变换的使用通常至少与规范的 Jordan-Wigner 变换一样有效,并且在进行有限的电路优化时,会导致门计数估计值大大降低。