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

Equivalence and Divergence of Imaginary-Time Evolution and Gradient Descent for Gaussian Variational States

Yash Palan

quant-phcond-mat.otherSubmitted Nov 9, 2025• Announced Nov 11, 2025• 0 citations
arXivHTMLPDF

Abstract

Imaginary-time evolution (ITE) is one of the most widely used numerical techniques for obtaining ground states of many-body Hamiltonians. In this work, we compare ITE with gradient descent (GD) within the framework of Gaussian wavefunction ansatze. We show that while ITE and GD are formally equivalent for fermionic systems, GD exhibits consistently faster convergence for bosonic systems, challenging the common assumption of their complete equivalence.

Comments
5 pages, 2 figures

Related papers

Generalized Nonlinear Imaginary-Time Evolution

Chenyu Shi, Hao Wang, Jin-Fu Chen

Imaginary-time evolution (ITE) is a powerful method for ground-state preparation of a given Hamiltonian. The normalized ITE can be viewed as a gradient flow of the energy expectation value with respect to the Fubini--Study metric. In this work, we propose a generalized nonlinear imaginary-time evolution (NITE) for more general quantum state-preparation tasks. We further present a hardware-efficient variational implementation of NITE and reveal its connection to quantum natural gradient descent. NITE is applied to several subroutine tasks, including variance minimization in variational eigensolvers, probe-state preparation in variational quantum sensing, and excited-state preparation using penalty terms. We prove that NITE achieves a local exponential convergence rate under reasonable assumptions. Our results show that NITE outperforms standard gradient descent and can serve as an efficient optimization method for variational tasks beyond ground-state preparation.

quant-pharXiv:2607.09599•Jul 13, 2026•0 citations

Augmenting Imaginary-Time Evolution with Local Geometric Information

Carlos L. Benavides-Riveros, Prachi Sharma, Pietropaolo Frisoni +1 more

Imaginary-time evolution (ITE) underpins a broad family of algorithms for ground-state preparation in quantum simulation and quantum many-body physics. In these methods, convergence is governed by the energy variance of the instantaneous state, causing the flow to approach the ground state only asymptotically. We introduce an augmented imaginary-time evolution (AITE) framework that replaces the standard gradient flow on the energy landscape with a geometrically informed descent along locally optimal directions, which are identified by exploiting the higher-order statistical structure of the instantaneous energy distribution. The resulting flow strictly outperforms standard ITE throughout the entire evolution and exhibits two qualitatively distinct regimes: a superlinear convergence regime, followed by an extinction regime in which the energy error vanishes exactly at a finite value of the imaginary-time flow parameter, in contrast to the asymptotic exponential decay of ITE. Standard ITE is recovered in the zero-skewness limit of AITE, implying that the acceleration extends naturally across the broader ITE algorithmic family.

quant-pharXiv:2606.23934•Jun 24, 2026•0 citations

Variational study of fermionic and bosonic systems with non-Gaussian states: Theory and applications

Shi, T., Eugene Demler, J. I. Cirac

We present a new variational method for investigating the ground state and out of equilibrium dynamics of quantum many-body bosonic and fermionic systems. Our approach is based on constructing variational wavefunctions which extend Gaussian states by including generalized canonical transformations between the fields. The key advantage of such states compared to simple Gaussian states is presence of non-factorizable correlations and the possibility of describing states with strong entanglement between particles. In contrast to the commonly used canonical transformations, such as the polaron or Lang-Firsov transformations, we allow parameters of the transformations to be time dependent, which extends their regions of applicability. We derive equations of motion for the parameters characterizing the states both in real and imaginary time using the differential structure of the variational manifold. The ground state can be found by following the imaginary time evolution until it converges to a steady state. Collective excitations in the system can be obtained by linearizing the real-time equations of motion in the vicinity of the imaginary time steady-state solution. Our formalism allows us not only to determine the energy spectrum of quasiparticles and their lifetime, but to obtain the complete spectral functions and to explore far out of equilibrium dynamics such as coherent evolution following a quantum quench. We illustrate and benchmark this framework with several examples: a single polaron in the Holstein and Su-Schrieer-Heeger models, non-equilibrium dynamics in the spin-boson and Kondo models, the superconducting to charge density wave phase transitions in the Holstein model.

•Mar 1, 2018•106 citations

Generating approximate ground states of strongly correlated quantum many-body systems through quantum imaginary time evolution

Michael Kaicher, Florian Dommert, Christopher Wever +3 more

Abstract Most quantum algorithms designed to generate or probe properties of the ground state of a quantum many-body system require as input an initial state with a large overlap with the desired ground state. One approach for preparing such a ground state is Imaginary Time Evolution (ITE). Recent work by [Motta, M. , Sun, C. , Tan, A.T.K. et al (2020)] introduced an algorithm—which we will refer to as Quantum Imaginary Time Evolution (QITE)—that shows how ITE can be approximated by a sequence of unitary operators, making QITE potentially implementable on early fault-tolerant quantum computers. In this work, we provide a heuristic study of the capabilities of the QITE algorithm in approximating the ITE of lattice and molecular electronic structure Hamiltonians. We numerically study the performance of the QITE algorithm when provided with a good classical initial state for a large class of systems, some of which are of interest to industrial applications, and check if QITE is able to qualitatively replicate the ITE behavior and improve over a classical mean-field solution. The systems we consider in this work range from one- and two-dimensional lattice systems of various lattice geometries displaying short- and long-range interactions, to active spaces of molecular electronic structure Hamiltonians. In addition to the comparison of QITE and ITE, we explicitly show how imaginary time evolved fermionic Gaussian states can serve as initial states which can be efficiently computed on classical computers and efficiently implemented on quantum computers for generic spin Hamiltonians in arbitrary lattice geometries and dimensions, which can be of independent interest.

arXiv:2409.01320•Journal of Physics Communications•Jun 23, 2025•0 citations

Quantum-compatible Riemannian conjugate gradient for ground-state preparation

Andres Arcia-Lopez, Marek Gluza, Yudai Suzuki +1 more

Riemannian optimization provides a natural geometric framework for designing quantum algorithms for ground-state preparation, most notably through quantum imaginary-time evolution. However, existing geometry-aware approaches primarily employ steepest-descent updates, leaving more advanced methods from classical Riemannian optimization largely unexplored. In this work, we introduce quantum conjugate gradient descent (QCGD), a quantum-compatible implementation of Riemannian conjugate gradient that combines the steepest descent direction with information retained from previous search directions. In our numerical experiments, the proposed approach achieves faster convergence per iteration than the baseline double-bracket quantum imaginary-time evolution (DB-QITE) algorithm, and we quantify the associated circuit cost with gate counts produced by Qrisp. This improvement, however, comes at the cost of increased circuit depth for each update step, revealing a trade-off between convergence rate and implementation complexity. Nevertheless, since the circuit depth for those algorithms grows exponentially with the number of iterations, the proposed method may offer practical advantages, particularly in the early fault-tolerant regime.

quant-pharXiv:2610.21782•Oct 16, 2026•0 citations

Algorithm for initializing a generalized fermionic Gaussian state on a quantum computer

Michael Kaicher, Simon B Jäger, Frank K. Wilhelm

Abstract We present explicit expressions for the central piece of a variational method developed by Shi et al (2018 Ann. Phys. 390 245) which extends variational wave functions that are efficiently computable on classical computers beyond mean-field to generalized Gaussian states. In particular, we derive iterative analytical expressions for the evaluation of expectation values of products of fermionic creation and annihilation operators in a Grassmann variable-free representation. Using this result we find a closed expression for the energy functional and its gradient of a general fermionic quantum many-body Hamiltonian. We present a simple gradient-descent-based algorithm that can be used as an optimization subroutine in combination with imaginary time evolution, which by construction guarantees a monotonic decrease of the energy in each iteration step. Due to the simplicity of the quantum circuit implementing the variational state ansatz, the results of the algorithms discussed here and in Shi et al ’s work could serve as an improved, beyond mean-field initial state in quantum computation.

arXiv:2105.13047•Journal of Physics A Mathematical and Theoretical•Aug 19, 2021•3 citations
Imaginary-time evolution (ITE) is one of the most widely used numerical techniques for obtaining ground states of many-body Hamiltonians. In this work, we compare ITE with gradient descent (GD) within the framework of Gaussian wavefunction ansatze. We show that while ITE and GD are formally equivalent for fermionic systems, GD exhibits consistently faster convergence for bosonic systems, challenging the common assumption of their complete equivalence.
Imaginary-time evolution (ITE) is a powerful method for ground-state preparation of a given Hamiltonian. The normalized ITE can be viewed as a gradient flow of the energy expectation value with respect to the Fubini--Study metric. In this work, we propose a generalized nonlinear imaginary-time evolution (NITE) for more general quantum state-preparation tasks. We further present a hardware-efficient variational implementation of NITE and reveal its connection to quantum natural gradient descent. NITE is applied to several subroutine tasks, including variance minimization in variational eigensolvers, probe-state preparation in variational quantum sensing, and excited-state preparation using penalty terms. We prove that NITE achieves a local exponential convergence rate under reasonable assumptions. Our results show that NITE outperforms standard gradient descent and can serve as an efficient optimization method for variational tasks beyond ground-state preparation.
Imaginary-time evolution (ITE) underpins a broad family of algorithms for ground-state preparation in quantum simulation and quantum many-body physics. In these methods, convergence is governed by the energy variance of the instantaneous state, causing the flow to approach the ground state only asymptotically. We introduce an augmented imaginary-time evolution (AITE) framework that replaces the standard gradient flow on the energy landscape with a geometrically informed descent along locally optimal directions, which are identified by exploiting the higher-order statistical structure of the instantaneous energy distribution. The resulting flow strictly outperforms standard ITE throughout the entire evolution and exhibits two qualitatively distinct regimes: a superlinear convergence regime, followed by an extinction regime in which the energy error vanishes exactly at a finite value of the imaginary-time flow parameter, in contrast to the asymptotic exponential decay of ITE. Standard ITE is recovered in the zero-skewness limit of AITE, implying that the acceleration extends naturally across the broader ITE algorithmic family.
We present a new variational method for investigating the ground state and out of equilibrium dynamics of quantum many-body bosonic and fermionic systems. Our approach is based on constructing variational wavefunctions which extend Gaussian states by including generalized canonical transformations between the fields. The key advantage of such states compared to simple Gaussian states is presence of non-factorizable correlations and the possibility of describing states with strong entanglement between particles. In contrast to the commonly used canonical transformations, such as the polaron or Lang-Firsov transformations, we allow parameters of the transformations to be time dependent, which extends their regions of applicability. We derive equations of motion for the parameters characterizing the states both in real and imaginary time using the differential structure of the variational manifold. The ground state can be found by following the imaginary time evolution until it converges to a steady state. Collective excitations in the system can be obtained by linearizing the real-time equations of motion in the vicinity of the imaginary time steady-state solution. Our formalism allows us not only to determine the energy spectrum of quasiparticles and their lifetime, but to obtain the complete spectral functions and to explore far out of equilibrium dynamics such as coherent evolution following a quantum quench. We illustrate and benchmark this framework with several examples: a single polaron in the Holstein and Su-Schrieer-Heeger models, non-equilibrium dynamics in the spin-boson and Kondo models, the superconducting to charge density wave phase transitions in the Holstein model.
Abstract Most quantum algorithms designed to generate or probe properties of the ground state of a quantum many-body system require as input an initial state with a large overlap with the desired ground state. One approach for preparing such a ground state is Imaginary Time Evolution (ITE). Recent work by [Motta, M. , Sun, C. , Tan, A.T.K. et al (2020)] introduced an algorithm—which we will refer to as Quantum Imaginary Time Evolution (QITE)—that shows how ITE can be approximated by a sequence of unitary operators, making QITE potentially implementable on early fault-tolerant quantum computers. In this work, we provide a heuristic study of the capabilities of the QITE algorithm in approximating the ITE of lattice and molecular electronic structure Hamiltonians. We numerically study the performance of the QITE algorithm when provided with a good classical initial state for a large class of systems, some of which are of interest to industrial applications, and check if QITE is able to qualitatively replicate the ITE behavior and improve over a classical mean-field solution. The systems we consider in this work range from one- and two-dimensional lattice systems of various lattice geometries displaying short- and long-range interactions, to active spaces of molecular electronic structure Hamiltonians. In addition to the comparison of QITE and ITE, we explicitly show how imaginary time evolved fermionic Gaussian states can serve as initial states which can be efficiently computed on classical computers and efficiently implemented on quantum computers for generic spin Hamiltonians in arbitrary lattice geometries and dimensions, which can be of independent interest.
Riemannian optimization provides a natural geometric framework for designing quantum algorithms for ground-state preparation, most notably through quantum imaginary-time evolution. However, existing geometry-aware approaches primarily employ steepest-descent updates, leaving more advanced methods from classical Riemannian optimization largely unexplored. In this work, we introduce quantum conjugate gradient descent (QCGD), a quantum-compatible implementation of Riemannian conjugate gradient that combines the steepest descent direction with information retained from previous search directions. In our numerical experiments, the proposed approach achieves faster convergence per iteration than the baseline double-bracket quantum imaginary-time evolution (DB-QITE) algorithm, and we quantify the associated circuit cost with gate counts produced by Qrisp. This improvement, however, comes at the cost of increased circuit depth for each update step, revealing a trade-off between convergence rate and implementation complexity. Nevertheless, since the circuit depth for those algorithms grows exponentially with the number of iterations, the proposed method may offer practical advantages, particularly in the early fault-tolerant regime.
Abstract We present explicit expressions for the central piece of a variational method developed by Shi et al (2018 Ann. Phys. 390 245) which extends variational wave functions that are efficiently computable on classical computers beyond mean-field to generalized Gaussian states. In particular, we derive iterative analytical expressions for the evaluation of expectation values of products of fermionic creation and annihilation operators in a Grassmann variable-free representation. Using this result we find a closed expression for the energy functional and its gradient of a general fermionic quantum many-body Hamiltonian. We present a simple gradient-descent-based algorithm that can be used as an optimization subroutine in combination with imaginary time evolution, which by construction guarantees a monotonic decrease of the energy in each iteration step. Due to the simplicity of the quantum circuit implementing the variational state ansatz, the results of the algorithms discussed here and in Shi et al ’s work could serve as an improved, beyond mean-field initial state in quantum computation.