.png){kind=icon}
.png){kind=icon}
Return
A probabilistic quantum algorithm for imaginary-time evolution based on Taylor expansion
.png){kind=icon}
OA
AI
DOI：10.1140/epjqt/s40507-025-00347-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Imaginary-time evolution is a powerful tool for obtaining the ground state of a quantum system, but the complexity of classical algorithms designed for simulating imaginary-time evolution will increase significantly as the size of the quantum system becomes larger. Here, a probabilistic quantum algorithm based on Taylor expansion for implementing imaginary-time evolution is introduced. For Hamiltonians composed of Pauli product terms, the quantum circuit requires only a single ancillary qubit and is exclusively constructed using elementary single-qubit and two-qubit gates. Furthermore, similar principles are used to extend the algorithm to the case where the Hamiltonian takes a more general form. The algorithm only requires negligible precomputed numerical calculations, without the need for complex classical pre-mathematical calculations or optimization loops. We demonstrate the algorithm by solving the ground state energy of hydrogen molecules and Heisenberg Hamiltonians. Moreover, we conducted experiments on real quantum computers through the quantum cloud platform to find the ground state energy of Heisenberg Hamiltonians. Our work extends the methods for realizing imaginary-time evolution on quantum computers, and our algorithm exhibits potential for implementation on near-term quantum devices, particularly when the Hamiltonian consists of Pauli product terms.
Keywords:
Quantum algorithm
Linear combination of unitaries
Imaginary-time evolution
Ground state simulation
Journal
IF:
5.6
Papers:
529
Citations:
1.1K