Author:
Babbush Ryan,Berry Dominic W.,McClean Jarrod R.,Neven Hartmut
Abstract
Abstract
We present a quantum algorithm for simulating quantum chemistry with gate complexity $$\tilde {\cal{O}}(N^{1/3}\eta ^{8/3})$$
O
̃
(
N
1
∕
3
η
8
∕
3
)
where η is the number of electrons and N is the number of plane wave orbitals. In comparison, the most efficient prior algorithms for simulating electronic structure using plane waves (which are at least as efficient as algorithms using any other basis) have complexity $$\tilde {\cal{O}}(N^{8/3}{\mathrm{/}}\eta ^{2/3})$$
O
̃
(
N
8
∕
3
∕
η
2
∕
3
)
. We achieve our scaling in first quantization by performing simulation in the rotating frame of the kinetic operator using interaction picture techniques. Our algorithm is far more efficient than all prior approaches when N ≫ η, as is needed to suppress discretization error when representing molecules in the plane wave basis, or when simulating without the Born-Oppenheimer approximation.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Statistical and Nonlinear Physics,Computer Science (miscellaneous)
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献