Polynomial time and space quantum algorithm for the simulation of non-Markovian quantum dynamics

Abstract

In this work, we developed an efficient quantum algorithm for the simulation of non-Markovian quantum dynamics, based on the Feynman path integral formulation. The algorithm scales polynomially with the number of native gates and the number of qubits, and has no classical overhead. It demonstrates the quantum advantage by overcoming the exponential cost on classical computers. In addition, the algorithm is efficient regardless of whether the temporal entanglement due to non-Markovianity is low or high, making it a unified framework for simulating non-Markovian dynamics in open quantum system.