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:2610.39600

Probabilistic imaginary-time evolution via compiled diagonal representations

Hengyue Li, Huazhe Lou, Yang Li, Mingyu Huang, Yusheng Yang, Jianyong Sheng, Jian Sun, Shenggang Ying

quant-phSubmitted Oct 29, 2026• Announced Oct 30, 2026• 0 citations
arXivHTMLPDF

Abstract

We introduce a probabilistic imaginary-time evolution scheme based on a compiled approximate diagonal representation of the Hamiltonian. A basis transformation is optimized offline. For a fixed compiled representation, the online circuit structure and gate count per attempt are independent of the imaginary time, and the same representation can be reused across different input states and evolution times. We derive a condition for enhanced success probability. Numerical tests show reduced online cost relative to termwise Pauli-based methods at a common accuracy threshold. We also examine how approximation errors and offline preparation costs affect the overall benefit.

AI Summary

Probabilistic imaginary-time evolution (PITE) incurs product-formula costs and postselection losses when implemented termwise. This paper asks whether an offline-compiled approximate diagonal representation can reduce online costs. It fits a short-time real-time propagator as $WDW^\dagger$, retains the basis circuit $W$, and recovers diagonal Hamiltonian coefficients by trace projection from the physical Hamiltonian, avoiding phase-branch ambiguities. For $\widetilde H=W(\sum_k\xi_k Z_k)W^\dagger$, commuting ancilla-assisted filters implement $e^{-\beta\Lambda}e^{-\beta\widetilde H}$, where $\Lambda=\sum_k|\xi_k|$. At fixed representation, changing $\beta$ changes only rotation angles, not circuit structure or gate count per attempt. With exact representation and vanishing baseline Trotter error, the success-probability ratio against termwise PITE is $\exp[2\beta(\lambda-\Lambda)]$, with $\lambda$ the original Pauli coefficient one-norm. Noiseless benchmarks use a two-qubit Hubbard model, five-qubit XY chain and three-qubit XYZ chain; most results use phase-derived coefficients, with projection checked separately. At $\beta=1.1$, mean Haar-input infidelities are approximately $0.00245$, $0.00158$ and $0.00408$, with success gains of $21$, $263$ and $123$ over first-order termwise PITE. Matched-accuracy accounting includes early abort and retries. Grouped two-site filtering, however, costs about $3.3\times10^3$ CX per accepted XYZ output versus $2.36\times10^5$ for the compiled method. The stated limitations include unquantified total offline cost, potentially tiny absolute success probabilities, input-dependent symmetry leakage, and failed 1% accuracy targets for tested four- and five-qubit XYZ fits. Efficient scaling, hardware performance and overall amortized advantage remain unestablished.

Little sign of AI-generated textIncrementalSmall numerics onlyStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Finite Imaginary-Time Evolution for Polynomial Unconstrained Binary Optimization

Jaehee Kim, Juhyeon Kim, Gwonhak Lee +4 more

Imaginary-time evolution is a standard primitive for ground-state preparation but is nonunitary, precluding direct quantum implementation. We develop Finite Imaginary-Time Evolution (FinITE), a finite-beta construction for diagonal Pauli-Z cost Hamiltonians arising from polynomial unconstrained binary optimization (PUBO) instances, including QUBO and HUBO cases. FinITE uses the linear-combination-of-unitaries (LCU) framework to implement a scaled imaginary-time propagator. The commuting Pauli-Z structure makes termwise block-encodings compose without product-formula error, and higher-order Pauli-Z terms are handled directly without quadratization. The structure yields an exact finite-beta identity between the LCU success probability and the ground-subspace fidelity. Combined with a gap-based fidelity lower bound, the identity yields a closed-form sufficient imaginary-time threshold beta-star for a chosen target fidelity. The threshold depends on estimates of the spectral gap and the initial ground-subspace overlap. Because the LCU success event is flagged by a known ancilla outcome, we integrate fixed-point amplitude amplification with an explicit query-complexity bound. Statevector simulations verify the identity on a five-vertex MaxCut (QUBO) and an eight-qubit cubic HUBO instance, and shot-based simulations on the MaxCut instance illustrate the predicted finite-beta threshold and amplification procedure.

quant-pharXiv:2604.27482•May 1, 2026•2 citations

A quantum double-bracket algorithm for imaginary-time evolution with exponentially shorter depth

Ioannis Kolotouros, Raul Garcia-Patron

Imaginary-time evolution (ITE) is a widely used technique for preparing the ground state of a target Hamiltonian. Building on the recently proposed framework of Double-Bracket quantum ITE (DB-QITE), we introduce a probabilistic variant (PDBQITE) that achieves an exponential reduction in circuit depth. Our algorithm requires only a single ancilla qubit and a quantum circuit that consists of one controlled real-time evolution and one mid-circuit measurement per iteration. The trade-off is an exponential decay of the total success probability with the number of iterations, for which we derive an analytical lower bound that is independent of system size. Our numerical simulations show that the per-step success probability remains close to unity, making it realistic to execute many iterations, thus providing a substantial improvement over prior constructions. We show that PDBQITE outperforms the near-term probabilistic algorithm PITE for ground-state preparation of molecular Hamiltonians, and that a hybrid QAOA-PDBQITE scheme achieves higher approximation ratios than QAOA at the same circuit depth on random regular graphs for the MaxCut problem.

quant-pharXiv:2609.37095•Sep 30, 2026•1 citation

Acceleration of probabilistic imaginary-time evolution method combined with quantum amplitude amplification

Hirofumi Nishi, Taichi Kosugi, Yusuke Nishiya +1 more

A probabilistic imaginary-time evolution (PITE) method was proposed as a nonvariational method to obtain a ground state on a quantum computer. In this formalism, the success probability of obtaining all imaginary-time evolution operators acting on the initial state decreases as the imaginary time proceeds. To alleviate the undesirable nature, we propose quantum circuits for PITE combined with the quantum amplitude amplification (QAA) method. We reduce the circuit depth in the combined circuit with QAA by introducing a pre-amplification operator. We successfully demonstrated that the combination of PITE and QAA works efficiently and reported a case in which the quantum acceleration is achieved. Additionally, we have found that by optimizing a parameter of PITE, we can reduce the number of QAA operations and that deterministic imaginary-time evolution (deterministic ITE) can be achieved which avoids the probabilistic nature of PITE. We applied the deterministic ITE procedure to multiple imaginary-time steps and discussed the computational cost for the circuits. Finally, as an example, we demonstrate the numerical results of the PITE circuit combined with QAA in the first- and second-quantized Hamiltonians.

arXiv:2212.13816•Dec 28, 2022•10 citations

Optimal scheduling in probabilistic imaginary-time evolution on a quantum computer

Hirofumi Nishi, Koki Hamada, Yusuke Nishiya +2 more

Ground-state preparation is an important task in quantum computation. The probabilistic imaginary-time evolution (PITE) method is a promising candidate for preparing the ground state of the Hamiltonian, which comprises a single ancilla qubit and forward- and backward-controlled real-time evolution operators. The ground state preparation is a challenging task even in the quantum computation, classified as complexity-class quantum Merlin-Arthur. However, optimal parameters for PITE could potentially enhance the computational efficiency to a certain degree. In this paper, we analyze the computational costs of the PITE method for both linear and exponential scheduling of the imaginary-time step size for reducing the computational cost. First, we analytically discuss an error defined as the closeness between the states acted on by exact and approximate imaginary-time evolution operators. The optimal imaginary-time step size and rate of change of imaginary time are also discussed. Subsequently, the analytical discussion is validated using numerical simulations for a one-dimensional Heisenberg chain. From the results, we find that linear scheduling works well in the case of unknown eigenvalues of the Hamiltonian. For a wide range of eigenstates, the linear scheduling returns smaller errors on average. However, the linearity of the scheduling causes problems for some specific energy regions of eigenstates. To avoid these problems, incorporating a certain level of nonlinearity into the scheduling, such as by inclusion of an exponential character, is preferable for reducing the computational costs of the PITE method. The findings of this paper can make a significant contribute to the field of ground-state preparation of many-body Hamiltonians on quantum computers.

arXiv:2305.04600•Physical Review Research•Oct 17, 2023•23 citations

Probabilistic imaginary-time evolution algorithm based on nonunitary quantum circuits

Hao-Nan Xie, Shi-Jie Wei, Fan Yang +4 more

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.

arXiv:2210.05293•Physical Review A•May 9, 2024•19 citations

Pauli Propagation for Imaginary-Time Evolution

Rafael Gómez-Lurbe, Armando Pérez

We extend the Pauli Propagation framework to imaginary-time evolution and introduce imaginary-time Pauli Propagation (ITPP), an operator-based algorithm for approximating thermal and ground-state properties directly in the Pauli basis. We derive explicit imaginary-time propagation rules for Pauli strings and analyze the main approximation errors arising from Trotterization and Pauli-space truncation, including bounds that account for the non-unitary nature of the evolution. Benchmarking ITPP on the one-dimensional transverse field Ising model, we find that the method performs best in the high-temperature regime, where thermal states admit a compressed Pauli-basis approximation, while the required number of Pauli terms grows rapidly as the system approaches the ground-state limit. We further compare with tensor network simulations and study finite-temperature scalability through the number of retained Pauli terms required to reach a fixed target accuracy. These results establish ITPP as a complementary framework for imaginary-time simulation and suggest that combining imaginary-time and real-time Pauli Propagation could provide a pathway toward simulating more general non-unitary and open quantum system dynamics within a unified Pauli-based framework.

quant-pharXiv:2601.14400•New Journal of Physics•Jan 22, 2026•6 citations
We introduce a probabilistic imaginary-time evolution scheme based on a compiled approximate diagonal representation of the Hamiltonian. A basis transformation is optimized offline. For a fixed compiled representation, the online circuit structure and gate count per attempt are independent of the imaginary time, and the same representation can be reused across different input states and evolution times. We derive a condition for enhanced success probability. Numerical tests show reduced online cost relative to termwise Pauli-based methods at a common accuracy threshold. We also examine how approximation errors and offline preparation costs affect the overall benefit.
Probabilistic imaginary-time evolution (PITE) incurs product-formula costs and postselection losses when implemented termwise. This paper asks whether an offline-compiled approximate diagonal representation can reduce online costs. It fits a short-time real-time propagator as WDW†WDW^\daggerWDW†, retains the basis circuit WWW, and recovers diagonal Hamiltonian coefficients by trace projection from the physical Hamiltonian, avoiding phase-branch ambiguities.
For H~=W(∑kξkZk)W†\widetilde H=W(\sum_k\xi_k Z_k)W^\daggerH=W(∑k​ξk​Zk​)W†, commuting ancilla-assisted filters implement e−βΛe−βH~e^{-\beta\Lambda}e^{-\beta\widetilde H}e−βΛe−βH, where Λ=∑k∣ξk∣\Lambda=\sum_k|\xi_k|Λ=∑k​∣ξk​∣. At fixed representation, changing β\betaβ changes only rotation angles, not circuit structure or gate count per attempt. With exact representation and vanishing baseline Trotter error, the success-probability ratio against termwise PITE is exp⁡[2β(λ−Λ)]\exp[2\beta(\lambda-\Lambda)]exp[2β(λ−Λ)], with λ\lambdaλ the original Pauli coefficient one-norm.
Noiseless benchmarks use a two-qubit Hubbard model, five-qubit XY chain and three-qubit XYZ chain; most results use phase-derived coefficients, with projection checked separately. At β=1.1\beta=1.1β=1.1, mean Haar-input infidelities are approximately 0.002450.002450.00245, 0.001580.001580.00158 and 0.004080.004080.00408, with success gains of 212121, 263263263 and 123123123 over first-order termwise PITE. Matched-accuracy accounting includes early abort and retries. Grouped two-site filtering, however, costs about 3.3×1033.3\times10^33.3×103 CX per accepted XYZ output versus 2.36×1052.36\times10^52.36×105 for the compiled method.
The stated limitations include unquantified total offline cost, potentially tiny absolute success probabilities, input-dependent symmetry leakage, and failed 1% accuracy targets for tested four- and five-qubit XYZ fits. Efficient scaling, hardware performance and overall amortized advantage remain unestablished.
Imaginary-time evolution is a standard primitive for ground-state preparation but is nonunitary, precluding direct quantum implementation. We develop Finite Imaginary-Time Evolution (FinITE), a finite-beta construction for diagonal Pauli-Z cost Hamiltonians arising from polynomial unconstrained binary optimization (PUBO) instances, including QUBO and HUBO cases. FinITE uses the linear-combination-of-unitaries (LCU) framework to implement a scaled imaginary-time propagator. The commuting Pauli-Z structure makes termwise block-encodings compose without product-formula error, and higher-order Pauli-Z terms are handled directly without quadratization. The structure yields an exact finite-beta identity between the LCU success probability and the ground-subspace fidelity. Combined with a gap-based fidelity lower bound, the identity yields a closed-form sufficient imaginary-time threshold beta-star for a chosen target fidelity. The threshold depends on estimates of the spectral gap and the initial ground-subspace overlap. Because the LCU success event is flagged by a known ancilla outcome, we integrate fixed-point amplitude amplification with an explicit query-complexity bound. Statevector simulations verify the identity on a five-vertex MaxCut (QUBO) and an eight-qubit cubic HUBO instance, and shot-based simulations on the MaxCut instance illustrate the predicted finite-beta threshold and amplification procedure.
Imaginary-time evolution (ITE) is a widely used technique for preparing the ground state of a target Hamiltonian. Building on the recently proposed framework of Double-Bracket quantum ITE (DB-QITE), we introduce a probabilistic variant (PDBQITE) that achieves an exponential reduction in circuit depth. Our algorithm requires only a single ancilla qubit and a quantum circuit that consists of one controlled real-time evolution and one mid-circuit measurement per iteration. The trade-off is an exponential decay of the total success probability with the number of iterations, for which we derive an analytical lower bound that is independent of system size. Our numerical simulations show that the per-step success probability remains close to unity, making it realistic to execute many iterations, thus providing a substantial improvement over prior constructions. We show that PDBQITE outperforms the near-term probabilistic algorithm PITE for ground-state preparation of molecular Hamiltonians, and that a hybrid QAOA-PDBQITE scheme achieves higher approximation ratios than QAOA at the same circuit depth on random regular graphs for the MaxCut problem.
A probabilistic imaginary-time evolution (PITE) method was proposed as a nonvariational method to obtain a ground state on a quantum computer. In this formalism, the success probability of obtaining all imaginary-time evolution operators acting on the initial state decreases as the imaginary time proceeds. To alleviate the undesirable nature, we propose quantum circuits for PITE combined with the quantum amplitude amplification (QAA) method. We reduce the circuit depth in the combined circuit with QAA by introducing a pre-amplification operator. We successfully demonstrated that the combination of PITE and QAA works efficiently and reported a case in which the quantum acceleration is achieved. Additionally, we have found that by optimizing a parameter of PITE, we can reduce the number of QAA operations and that deterministic imaginary-time evolution (deterministic ITE) can be achieved which avoids the probabilistic nature of PITE. We applied the deterministic ITE procedure to multiple imaginary-time steps and discussed the computational cost for the circuits. Finally, as an example, we demonstrate the numerical results of the PITE circuit combined with QAA in the first- and second-quantized Hamiltonians.
Ground-state preparation is an important task in quantum computation. The probabilistic imaginary-time evolution (PITE) method is a promising candidate for preparing the ground state of the Hamiltonian, which comprises a single ancilla qubit and forward- and backward-controlled real-time evolution operators. The ground state preparation is a challenging task even in the quantum computation, classified as complexity-class quantum Merlin-Arthur. However, optimal parameters for PITE could potentially enhance the computational efficiency to a certain degree. In this paper, we analyze the computational costs of the PITE method for both linear and exponential scheduling of the imaginary-time step size for reducing the computational cost. First, we analytically discuss an error defined as the closeness between the states acted on by exact and approximate imaginary-time evolution operators. The optimal imaginary-time step size and rate of change of imaginary time are also discussed. Subsequently, the analytical discussion is validated using numerical simulations for a one-dimensional Heisenberg chain. From the results, we find that linear scheduling works well in the case of unknown eigenvalues of the Hamiltonian. For a wide range of eigenstates, the linear scheduling returns smaller errors on average. However, the linearity of the scheduling causes problems for some specific energy regions of eigenstates. To avoid these problems, incorporating a certain level of nonlinearity into the scheduling, such as by inclusion of an exponential character, is preferable for reducing the computational costs of the PITE method. The findings of this paper can make a significant contribute to the field of ground-state preparation of many-body Hamiltonians on quantum computers.
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.
We extend the Pauli Propagation framework to imaginary-time evolution and introduce imaginary-time Pauli Propagation (ITPP), an operator-based algorithm for approximating thermal and ground-state properties directly in the Pauli basis. We derive explicit imaginary-time propagation rules for Pauli strings and analyze the main approximation errors arising from Trotterization and Pauli-space truncation, including bounds that account for the non-unitary nature of the evolution. Benchmarking ITPP on the one-dimensional transverse field Ising model, we find that the method performs best in the high-temperature regime, where thermal states admit a compressed Pauli-basis approximation, while the required number of Pauli terms grows rapidly as the system approaches the ground-state limit. We further compare with tensor network simulations and study finite-temperature scalability through the number of retained Pauli terms required to reach a fixed target accuracy. These results establish ITPP as a complementary framework for imaginary-time simulation and suggest that combining imaginary-time and real-time Pauli Propagation could provide a pathway toward simulating more general non-unitary and open quantum system dynamics within a unified Pauli-based framework.