期刊
PHYSICAL REVIEW X
卷 11, 期 1, 页码 -出版社
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevX.11.011020
关键词
-
资金
- U.S. Department of Energy (DOE), Office of Science, Office of Advanced Scientific Computing Research, Quantum Algorithms Teams program
- U.S. Department of Energy (DOE), Office of Science, Office of Advanced Scientific Computing Research, Accelerated Research in Quantum Computing program
- Army Research Office (MURI Grant) [W911NF-16-1-0349]
- National Science Foundation [CCF-1813814]
- Google Ph.D. Fellowship program
- DOE BES QIS program [DE-SC0019449]
- NSF PFCQC program
- DOE ASCR Quantum Testbed Pathfinder program [DE-SC0019040]
- AFOSR
- ARL CDQI
- NSF PFC at JQI
- Google Quantum Research Award
- NSF CAREER Grant [CCF-1845125]
The Lie-Trotter formula and its higher-order generalizations offer a direct approach to decomposing the exponential of a sum of operators, with a theory of Trotter error developed to provide tighter error bounds. This theory, which exploits the commutativity of operator summands, has applications in digital quantum simulation and quantum Monte Carlo methods, improving algorithms for various systems and simulations. The analysis shows that product formulas can preserve the locality of the simulated system, allowing for simulations of local observables with complexity independent of system size for power-law interacting systems.
The Lie-Trotter formula, together with its higher-order generalizations, provides a direct approach to decomposing the exponential of a sum of operators. Despite significant effort, the error scaling of such product formulas remains poorly understood. We develop a theory of Trotter error that overcomes the limitations of prior approaches based on truncating the Baker-Campbell-Hausdorff expansion. Our analysis directly exploits the commutativity of operator summands, producing tighter error bounds for both real- and imaginary-time evolutions. Whereas previous work achieves similar goals for systems with geometric locality or Lie-algebraic structure, our approach holds, in general. We give a host of improved algorithms for digital quantum simulation and quantum Monte Carlo methods, including simulations of second-quantized plane-wave electronic structure, k-local Hamiltonians, rapidly decaying power-law interactions, clustered Hamiltonians, the transverse field Ising model, and quantum ferromagnets, nearly matching or even outperforming the best previous results. We obtain further speedups using the fact that product formulas can preserve the locality of the simulated system. Specifically, we show that local observables can be simulated with complexity independent of the system size for power-law interacting systems, which implies a Lieb-Robinson bound as a by-product. Our analysis reproduces known tight bounds for first- and second-order formulas. Our higher-order bound overestimates the complexity of simulating a one-dimensional Heisenberg model with an even-odd ordering of terms by only a factor of 5, and it is close to tight for power-law interactions and other orderings of terms. This result suggests that our theory can accurately characterize Trotter error in terms of both asymptotic scaling and constant prefactor.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据