paper

On quantum algorithms for the Schrödinger equation in the semi-classical regime

arXiv:2112.13279 · doi:10.22331/q-2022-06-17-739

Abstract

Solving the time-dependent Schrödinger equation is an important application area for quantum algorithms. We consider Schrödinger's equation in the semi-classical regime. Here the solutions exhibit strong multiple-scale behavior due to a small parameter , in the sense that the dynamics of the quantum states and the induced observables can occur on different spatial and temporal scales. Such a Schrödinger equation finds many applications, including in Born-Oppenheimer molecular dynamics and Ehrenfest dynamics. This paper considers quantum analogues of pseudo-spectral (PS) methods on classical computers. Estimates on the gate counts in terms of and the precision are obtained. It is found that the number of required qubits, , scales only logarithmically with respect to . When the solution has bounded derivatives up to order , the symmetric Trotting method has gate complexity provided that the diagonal unitary operators in the pseudo-spectral methods can be implemented with operations. When physical observables are the desired outcomes, however, the step size in the time integration can be chosen independently of . The gate complexity in this case is reduced to with again indicating the smoothness of the solution.

References in corpus (6)

Cited by in corpus (5)