Quantum algorithms based on quantum trajectories (2509.10425v1)

Abstract: Quantum simulation has emerged as a key application of quantum computing, with significant progress made in algorithms for simulating both closed and open quantum systems. The simulation of open quantum systems, particularly those governed by the Lindblad master equation, has received attention recently with the current state-of-the-art algorithms having an input model query complexity of $O(T \mathrm{polylog}(T/\epsilon))$, where $T$ and $\epsilon$ are the requested time and precision of the simulation respectively. For the Hamiltonian simulation problem it has been show that the optimal Hamiltonian query complexity is $O(T + \log(1/\epsilon))$, additive in nature between the two parameter, but for Lindbladian simulation this question remains open. In this work we show that the additive complexity of $O(T + \log(1/\epsilon))$ is reachable for the simulation of a large class of Lindbladian by constructing a novel quantum algorithm based on quantum trajectories.