Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2210.05293 · Physical Review A

Probabilistic imaginary-time evolution algorithm based on nonunitary quantum circuits

Hao-Nan Xie, Shi-Jie Wei, Fan Yang, Zheng‐An Wang, Chi-Tong Chen, Heng Fan, Gui‐Lu Long

Published May 9, 2024• 19 citations
arXivHTMLPDF

Abstract

Imaginary-time evolution is a powerful tool in the study of quantum physics. However, existing classical algorithms for simulating imaginary-time evolution suffer from high computational complexity as the dimension of the quantum system increases. In this study we propose a quantum algorithm for implementing imaginary-time evolution using nonunitary quantum circuits with one ancillary qubit. The success probability of our algorithm is a polynomial function of the output error and can be enhanced by reorganizing the terms of the Hamiltonian. To illustrate the practicality of our algorithm on current quantum devices, we conduct a demonstration on superconducting and trapped-ion quantum processors to calculate the ground-state energy and determine the most stable molecular structure of ${\mathrm{H}}_{2}$. Additionally, we validate the feasibility of our algorithm by numerically simulating the ground-state energies of LiH molecules and the quantum Ising chain. In contrast to existing algorithms, our method provides a systematic approach to construct the required nonunitary circuits using universal quantum gates, making it suitable for experimental implementation. Our algorithm opens up possibilities for exploring other physical phenomena such as finite-temperature properties and non-Hermitian systems.

DOI
10.1103/physreva.109.052414

Related papers

A probabilistic quantum algorithm for imaginary-time evolution based on Taylor expansion

Xin Yi, Jingyu Huo, Guanhua Liu +3 more

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.

EPJ Quantum Technology•Apr 3, 2025•18 citations

Quantum imaginary-time evolution with polynomial resources in evolution time

Lei Zhang, Jizhe Lai, Xian Wu +1 more

Abstract Imaginary-time evolution is fundamental for analyzing quantum many-body systems, with applications spanning quantum chemistry, condensed matter physics, and quantum field theory, yet classical simulation requires exponentially growing resources in both system size and evolution time. While quantum approaches reduce the system-size scaling, existing methods rely on heuristic techniques with measurement precision or success probability that deteriorates as evolution time increases. We present a quantum algorithm that prepares normalized imaginary-time evolved states using an adaptive normalization factor to maintain a stable success probability over long imaginary-time intervals. Our algorithm approximates the target state with error polynomially small in the inverse imaginary time using a polynomial number of elementary quantum gates and a single ancilla qubit, with success probability close to one. When the initial state has reasonable overlap with the ground state, this algorithm also achieves polynomial query complexity in the system size. To our knowledge, this is the first quantum algorithm for imaginary-time evolution with provably polynomial resource scaling in evolution time. Numerical experiments validate our theoretical analysis for evolution time up to 50, demonstrating the algorithm’s effectiveness for long-time evolution. Building on this technique, we further develop imaginary-time-evolution-based algorithms for ground-state-related problems and for simulating open quantum systems. These algorithms can reduce circuit depth in certain regimes compared with existing methods, at the expense of higher total query complexity, advancing the practical feasibility of quantum simulation on early fault-tolerant devices.

arXiv:2507.00908•Quantum Science and Technology•Jun 10, 2026•6 citations

Quasiprobabilistic Imaginary-Time Evolution on Quantum Computers

Annie Ray, Esha Swaroop, Ningping Cao +2 more

Abstract Imaginary-time evolution plays an important role in algorithms for computing ground-state and thermal equilibrium properties of quantum systems, but can be challenging to simulate on classical computers. Many quantum algorithms for imaginary-time evolution have resource requirements that are prohibitive for current quantum devices and face performance issues due to noise. Here, we propose a new algorithm for computing imaginary-time evolved expectation values on quantum computers, inspired by probabilistic error cancellation, an error-mitigation technique. Our algorithm works by decomposing a Trotterization of imaginary-time evolution into a probabilistic linear combination of operations, each of which is then implemented on a quantum computer. The measurement data is then classically post-processed to obtain the expectation value of the imaginary-time evolved state. Our algorithm requires no ancillary qubits and can be made noise-resilient without additional error-mitigation. It is well-suited for estimating thermal expectation values by making use of the notion of a thermal pure quantum state. We demonstrate our algorithm by performing numerical simulations of thermal pure quantum state preparation for the 1D Heisenberg Hamiltonian on 8 qubits, and by using an IBM quantum computer to estimate the energy of the same Hamiltonian on 2 qubits. We observe promising results compared to the exact values, illustrating the potential of our algorithm for probing the physics of quantum many-body systems on current hardware.

arXiv:2505.06343•Quantum Information and Computation•Mar 1, 2026•3 citations

Imaginary-time evolution using forward and backward real-time evolution with a single ancilla: First-quantized eigensolver algorithm for quantum chemistry

Taichi Kosugi, Yusuke Nishiya, Hirofumi Nishi +1 more

Imaginary-time evolution (ITE) on a quantum computer is a promising formalism for obtaining the ground state of a quantum system. The probabilistic ITE (PITE) exploits measurements to implement nonunitary operations, and it can avoid the restriction of dynamics to a low-dimensional subspace imposed by variational parameters unlike other types of ITE. In this paper, we propose a PITE approach that uses only one ancillary qubit. Unlike the existing PITE approaches, the one proposed here constructs, under a practical approximation, the circuit from forward and backward real-time evolution (RTE) gates as black boxes for the original Hamiltonian. Thus all efficient unitary algorithms for RTE can be transferred to the ITE without any modifications. Our approach can be used to obtain the Gibbs state at a finite temperature and partition function. We validate the approach via several illustrative systems where the trial states are found to converge rapidly to the ground states. In addition, we discuss its applicability to quantum chemistry by focusing on the scaling of computational cost; this leads to the development of a framework referred to as a first-quantized eigensolver. The nonvariational generic approach will expand the scope of practical quantum computation for versatile objectives.

arXiv:2111.12471•Physical Review Research•Aug 11, 2022•75 citations

Non-unitary Trotter circuits for imaginary time evolution

Chiara Leadbeater, Nathan Fitzpatrick, David Muñoz Ramo +1 more

Abstract We propose an imaginary time equivalent of the well-established Pauli gadget primitive for Trotter-decomposed real time evolution, using mid-circuit measurements on a single ancilla qubit. Imaginary time evolution (ITE) is widely used for obtaining the ground state (GS) of a system on classical hardware, computing thermal averages, and as a component of quantum algorithms that perform non-unitary evolution. Near-term implementations on quantum hardware rely on heuristics, compromising their accuracy. As a result, there is growing interest in the development of more natively quantum algorithms. Since it is not possible to implement a non-unitary gate deterministically, we resort to the implementation of probabilistic ITE (PITE) algorithms, which rely on a unitary quantum circuit to simulate a block encoding of the ITE operator—that is, they rely on successful ancillary measurements to evolve the system non-unitarily. Compared with previous PITE proposals, the suggested block encoding in this paper results in shorter circuits and is simpler to implement, requiring only a slight modification of the Pauli gadget primitive. This scheme was tested on the transverse Ising model and the fermionic Hubbard model and is demonstrated to converge to the GS of the system.

arXiv:2304.07917•Quantum Science and Technology•Jun 4, 2024•21 citations

Quantum Imaginary Time Evolution on an Infinite 1D Chain

Hao-Ti Hung, Tung Tsao, Ying-Jer Kao

We introduce a quantum-circuit algorithm for performing imaginary-time evolution on infinite one-dimensional lattice systems. The method uses a parameterized quantum circuit to represent a uniform matrix product state ansatz. We derive the ITE algorithm using the time-dependent variational principle and employ the quantum Lanczos algorithm to improve the ground-state energy estimate. As a benchmark, we simulate the transverse-field Ising model using both classical simulators and IBM Quantum devices. Our analysis includes a statistical study of the distributions of the cost function and energy density obtained from quantum measurements, illustrating the effects of finite-sampling noise on convergence.

quant-pharXiv:2608.30363•Sep 1, 2026•0 citations
Imaginary-time evolution is a powerful tool in the study of quantum physics. However, existing classical algorithms for simulating imaginary-time evolution suffer from high computational complexity as the dimension of the quantum system increases. In this study we propose a quantum algorithm for implementing imaginary-time evolution using nonunitary quantum circuits with one ancillary qubit. The success probability of our algorithm is a polynomial function of the output error and can be enhanced by reorganizing the terms of the Hamiltonian. To illustrate the practicality of our algorithm on current quantum devices, we conduct a demonstration on superconducting and trapped-ion quantum processors to calculate the ground-state energy and determine the most stable molecular structure of H2{\mathrm{H}}_{2}H2​. Additionally, we validate the feasibility of our algorithm by numerically simulating the ground-state energies of LiH molecules and the quantum Ising chain. In contrast to existing algorithms, our method provides a systematic approach to construct the required nonunitary circuits using universal quantum gates, making it suitable for experimental implementation. Our algorithm opens up possibilities for exploring other physical phenomena such as finite-temperature properties and non-Hermitian systems.
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.
Abstract Imaginary-time evolution is fundamental for analyzing quantum many-body systems, with applications spanning quantum chemistry, condensed matter physics, and quantum field theory, yet classical simulation requires exponentially growing resources in both system size and evolution time. While quantum approaches reduce the system-size scaling, existing methods rely on heuristic techniques with measurement precision or success probability that deteriorates as evolution time increases. We present a quantum algorithm that prepares normalized imaginary-time evolved states using an adaptive normalization factor to maintain a stable success probability over long imaginary-time intervals. Our algorithm approximates the target state with error polynomially small in the inverse imaginary time using a polynomial number of elementary quantum gates and a single ancilla qubit, with success probability close to one. When the initial state has reasonable overlap with the ground state, this algorithm also achieves polynomial query complexity in the system size. To our knowledge, this is the first quantum algorithm for imaginary-time evolution with provably polynomial resource scaling in evolution time. Numerical experiments validate our theoretical analysis for evolution time up to 50, demonstrating the algorithm’s effectiveness for long-time evolution. Building on this technique, we further develop imaginary-time-evolution-based algorithms for ground-state-related problems and for simulating open quantum systems. These algorithms can reduce circuit depth in certain regimes compared with existing methods, at the expense of higher total query complexity, advancing the practical feasibility of quantum simulation on early fault-tolerant devices.
Abstract Imaginary-time evolution plays an important role in algorithms for computing ground-state and thermal equilibrium properties of quantum systems, but can be challenging to simulate on classical computers. Many quantum algorithms for imaginary-time evolution have resource requirements that are prohibitive for current quantum devices and face performance issues due to noise. Here, we propose a new algorithm for computing imaginary-time evolved expectation values on quantum computers, inspired by probabilistic error cancellation, an error-mitigation technique. Our algorithm works by decomposing a Trotterization of imaginary-time evolution into a probabilistic linear combination of operations, each of which is then implemented on a quantum computer. The measurement data is then classically post-processed to obtain the expectation value of the imaginary-time evolved state. Our algorithm requires no ancillary qubits and can be made noise-resilient without additional error-mitigation. It is well-suited for estimating thermal expectation values by making use of the notion of a thermal pure quantum state. We demonstrate our algorithm by performing numerical simulations of thermal pure quantum state preparation for the 1D Heisenberg Hamiltonian on 8 qubits, and by using an IBM quantum computer to estimate the energy of the same Hamiltonian on 2 qubits. We observe promising results compared to the exact values, illustrating the potential of our algorithm for probing the physics of quantum many-body systems on current hardware.
Imaginary-time evolution (ITE) on a quantum computer is a promising formalism for obtaining the ground state of a quantum system. The probabilistic ITE (PITE) exploits measurements to implement nonunitary operations, and it can avoid the restriction of dynamics to a low-dimensional subspace imposed by variational parameters unlike other types of ITE. In this paper, we propose a PITE approach that uses only one ancillary qubit. Unlike the existing PITE approaches, the one proposed here constructs, under a practical approximation, the circuit from forward and backward real-time evolution (RTE) gates as black boxes for the original Hamiltonian. Thus all efficient unitary algorithms for RTE can be transferred to the ITE without any modifications. Our approach can be used to obtain the Gibbs state at a finite temperature and partition function. We validate the approach via several illustrative systems where the trial states are found to converge rapidly to the ground states. In addition, we discuss its applicability to quantum chemistry by focusing on the scaling of computational cost; this leads to the development of a framework referred to as a first-quantized eigensolver. The nonvariational generic approach will expand the scope of practical quantum computation for versatile objectives.
Abstract We propose an imaginary time equivalent of the well-established Pauli gadget primitive for Trotter-decomposed real time evolution, using mid-circuit measurements on a single ancilla qubit. Imaginary time evolution (ITE) is widely used for obtaining the ground state (GS) of a system on classical hardware, computing thermal averages, and as a component of quantum algorithms that perform non-unitary evolution. Near-term implementations on quantum hardware rely on heuristics, compromising their accuracy. As a result, there is growing interest in the development of more natively quantum algorithms. Since it is not possible to implement a non-unitary gate deterministically, we resort to the implementation of probabilistic ITE (PITE) algorithms, which rely on a unitary quantum circuit to simulate a block encoding of the ITE operator—that is, they rely on successful ancillary measurements to evolve the system non-unitarily. Compared with previous PITE proposals, the suggested block encoding in this paper results in shorter circuits and is simpler to implement, requiring only a slight modification of the Pauli gadget primitive. This scheme was tested on the transverse Ising model and the fermionic Hubbard model and is demonstrated to converge to the GS of the system.
We introduce a quantum-circuit algorithm for performing imaginary-time evolution on infinite one-dimensional lattice systems. The method uses a parameterized quantum circuit to represent a uniform matrix product state ansatz. We derive the ITE algorithm using the time-dependent variational principle and employ the quantum Lanczos algorithm to improve the ground-state energy estimate. As a benchmark, we simulate the transverse-field Ising model using both classical simulators and IBM Quantum devices. Our analysis includes a statistical study of the distributions of the cost function and energy density obtained from quantum measurements, illustrating the effects of finite-sampling noise on convergence.