Quantum simulation via randomized product formulas: Low gate complexity with accuracy guarantees
Quantum simulation via randomized product formulas: Low gate complexity with accuracy guarantees
复制标题
通过随机乘积公式进行量子模拟:门复杂度低,精度保证
DOI:
--
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
J. Tropp
中科院分区:
文献类型:
--
作者:
Chi;Hsin;R. Kueng;J. Tropp
Quantum simulation has wide applications in quantum chemistry and physics. Recently, scientists have begun exploring the use of randomized methods for accelerating quantum simulation. Among them, a simple and powerful technique, called qDRIFT, is known to generate random product formulas for which the average quantum channel approximates the ideal evolution. This work provides a comprehensive analysis of a single realization of the random product formula produced by qDRIFT. The main results prove that a typical realization of the randomized product formula approximates the ideal unitary evolution up to a small diamond-norm error. The gate complexity is independent of the number of terms in the Hamiltonian, but it depends on the system size and the sum of the interaction strengths in the Hamiltonian. Remarkably, the same random evolution starting from an arbitrary, but fixed, input state yields a much shorter circuit suitable for that input state. If the observable is also fixed, the same random evolution provides an even shorter product formula. The proofs depend on concentration inequalities for vector and matrix martingales. Numerical experiments verify the theoretical predictions.
登录
查看更多内容
影响因子:
6.4
作者:
Yingkai Ouyang;D. R. White;E. Campbell
通讯作者:
Yingkai Ouyang;D. R. White;E. Campbell
DOI:
10.1145/3498331
发表时间:
2022
期刊:
ACM Transactions on Quantum Computing
影响因子:
--
作者:
An, Dong;Lin, Lin
通讯作者:
Lin, Lin
影响因子:
1
作者:
Christofides D
通讯作者:
Christofides D
影响因子:
8.6
作者:
Campbell, Earl
通讯作者:
Campbell, Earl