2023/01/26 by Reyhaneh Aghaei Saem, Saem, Reyhaneh Aghaei, Ali Hamed Moosavian +1
Computer Science · Physics and Astronomy · #Computational Physics and Python Applications #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2301.11420
openalex publication_date 2023/01/26 · openalex created_date 2023/01/31 · openalex updated_date 2026/07/28
Simulating physical systems has been an important application of classical and quantum computers. In this article we present an efficient classical algorithm for simulating time-dependent quantum mechanical Hamiltonians over constant periods of time. The algorithm presented here computes the mean value of an observable over the output state of such short-time Hamiltonian evolutions. In proving the performance of this algorithm we use Lieb-Robinson type bounds to limit the evolution of local operators within a lightcone. This allows us to divide the task of simulating a large quantum system into smaller systems that can be handled on normal classical computers.