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:2302.14279 · Physical Review A

Critical behavior of the Ising model by preparing the thermal state on a quantum computer

Xiaoyang Wang, Xu Feng, Tobias Hartung, Karl Jansen, Paolo Stornati

Published Aug 21, 2023• 19 citations
arXivHTMLPDF

Abstract

We simulate the critical behavior of the Ising model utilizing a thermal state prepared using quantum computing techniques. The preparation of the thermal state is based on the variational quantum imaginary time evolution (QITE) algorithm. The initial state of QITE is prepared as a classical product state, and we propose a systematic method to design the variational ansatz for QITE. We calculate the specific heat and susceptibility of the long-range interacting Ising model and observe indications of the Ising criticality on a small lattice size. We find the results derived by the quantum algorithm are well consistent with the ones from exact diagonalization, in both the neighborhood of the critical temperature and the low-temperature region.

DOI
10.1103/physreva.108.022612

Related papers

Quantum Simulation of Finite Temperature Schwinger Model via Quantum Imaginary Time Evolution

Juan W. Pedersen, Etsuko Itou, Rong-Yang Sun +1 more

We study the Schwinger model at finite-temperature regime using a quantum-classical hybrid algorithm. The preparation of thermal state on quantum circuit presents significant challenges. To address this, we adopt the Thermal Pure Quantum (TPQ) state approach and apply the Quantum Imaginary Time Evolution (QITE) algorithm to implement the necessary imaginary time evolution. We first compute the chiral condensate in the massless Schwinger model, verifying its consistency with the analytical solution. We then simulate the massive Schwinger model with non-zero topological $\theta$-term to investigate the temperature and $\theta$-dependence of the chiral condensate. Our method works well even at non-zero $\theta$ regime, while the conventional lattice Monte Carlo method suffers from the sign problem in this system.

arXiv:2311.11616•International Symposium on Lattice Field Theory (LATTICE)•Dec 27, 2023•9 citations

Quantum Simulation of Finite Temperature Schwinger Model

珠杏 ウィリアム ピーダーセン

In this research, we simulate the finite-temperature Schwinger model using a quantum algorithm.The preparation of a thermal state on a quantum circuit poses siginificant challenges.To overcome these, we employ the Thermal Pure Quantum (TPQ) state approach and perform the Quantum Imaginary Time Evolution (QITE) algorithm, which implements the required imaginary time evolution.Our investigation starts with the calculation of the chiral condensate in the massless Schwinger model and confirms the agreement with the analytical solution.Subsequently, we extend our simulation to the massive Schwinger model with non-zero topological θ-term.This allows us to explore the temperature and θdependence of the chiral condensate.Our method demonstrates efficacy in the non-zero θ regime, a system in which the conventional lattice Monte Carlo method is infeasible due to the sign problem.

•Mar 21, 2024•0 citations

Adaptive variational quantum minimally entangled typical thermal states for finite temperature simulations

João C. Getelina, Niladri Gomes, Thomas Iadecola +2 more

Scalable quantum algorithms for the simulation of quantum many-body systems in thermal equilibrium are important for predicting properties of quantum matter at finite temperatures. Here we describe and benchmark a quantum computing version of the minimally entangled typical thermal states (METTS) algorithm for which we adopt an adaptive variational approach to perform the required quantum imaginary time evolution. The algorithm, which we name AVQMETTS, dynamically generates compact and problem-specific quantum circuits, which are suitable for noisy intermediate-scale quantum (NISQ) hardware. We benchmark AVQMETTS on statevector simulators and perform thermal energy calculations of integrable and nonintegrable quantum spin models in one and two dimensions and demonstrate an approximately linear system-size scaling of the circuit complexity. We further map out the finite-temperature phase transition line of the two-dimensional transverse field Ising model. Finally, we study the impact of noise on AVQMETTS calculations using a phenomenological noise model.

arXiv:2301.02592•SciPost Physics•Sep 19, 2023•29 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

Stochastic Approximation of Variational Quantum Imaginary Time Evolution

Julien Gacon, Christa Zoufal, Giuseppe Carleo +1 more

The imaginary-time evolution of quantum states is integral to various fields, ranging from natural sciences to classical optimization or machine learning. Since simulating quantum imaginary-time evolution generally requires storing an exponentially large wave function, quantum computers are emerging as a promising platform for this task. However, variational approaches, suitable for near-term quantum computers, struggle with a prohibitive number of measurements and impractical runtimes for relevant system sizes. Here, we suggest a stochastic approach to variational quantum imaginary-time evolution, which allows a significant reduction in runtimes. Our approach allows trading off invested resources and accuracy, which makes it also suitable for ground state preparation, where simulating the exact dynamics is not required. We demonstrate the efficiency of our algorithm in simulations and show a hardware experiment performing the imaginary-time evolution of the transverse field Ising model on 27 qubits.

arXiv:2305.07059•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•13 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•1 citation
We simulate the critical behavior of the Ising model utilizing a thermal state prepared using quantum computing techniques. The preparation of the thermal state is based on the variational quantum imaginary time evolution (QITE) algorithm. The initial state of QITE is prepared as a classical product state, and we propose a systematic method to design the variational ansatz for QITE. We calculate the specific heat and susceptibility of the long-range interacting Ising model and observe indications of the Ising criticality on a small lattice size. We find the results derived by the quantum algorithm are well consistent with the ones from exact diagonalization, in both the neighborhood of the critical temperature and the low-temperature region.
We study the Schwinger model at finite-temperature regime using a quantum-classical hybrid algorithm. The preparation of thermal state on quantum circuit presents significant challenges. To address this, we adopt the Thermal Pure Quantum (TPQ) state approach and apply the Quantum Imaginary Time Evolution (QITE) algorithm to implement the necessary imaginary time evolution. We first compute the chiral condensate in the massless Schwinger model, verifying its consistency with the analytical solution. We then simulate the massive Schwinger model with non-zero topological θ\thetaθ-term to investigate the temperature and θ\thetaθ-dependence of the chiral condensate. Our method works well even at non-zero θ\thetaθ regime, while the conventional lattice Monte Carlo method suffers from the sign problem in this system.
In this research, we simulate the finite-temperature Schwinger model using a quantum algorithm.The preparation of a thermal state on a quantum circuit poses siginificant challenges.To overcome these, we employ the Thermal Pure Quantum (TPQ) state approach and perform the Quantum Imaginary Time Evolution (QITE) algorithm, which implements the required imaginary time evolution.Our investigation starts with the calculation of the chiral condensate in the massless Schwinger model and confirms the agreement with the analytical solution.Subsequently, we extend our simulation to the massive Schwinger model with non-zero topological θ-term.This allows us to explore the temperature and θdependence of the chiral condensate.Our method demonstrates efficacy in the non-zero θ regime, a system in which the conventional lattice Monte Carlo method is infeasible due to the sign problem.
Scalable quantum algorithms for the simulation of quantum many-body systems in thermal equilibrium are important for predicting properties of quantum matter at finite temperatures. Here we describe and benchmark a quantum computing version of the minimally entangled typical thermal states (METTS) algorithm for which we adopt an adaptive variational approach to perform the required quantum imaginary time evolution. The algorithm, which we name AVQMETTS, dynamically generates compact and problem-specific quantum circuits, which are suitable for noisy intermediate-scale quantum (NISQ) hardware. We benchmark AVQMETTS on statevector simulators and perform thermal energy calculations of integrable and nonintegrable quantum spin models in one and two dimensions and demonstrate an approximately linear system-size scaling of the circuit complexity. We further map out the finite-temperature phase transition line of the two-dimensional transverse field Ising model. Finally, we study the impact of noise on AVQMETTS calculations using a phenomenological noise model.
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.
The imaginary-time evolution of quantum states is integral to various fields, ranging from natural sciences to classical optimization or machine learning. Since simulating quantum imaginary-time evolution generally requires storing an exponentially large wave function, quantum computers are emerging as a promising platform for this task. However, variational approaches, suitable for near-term quantum computers, struggle with a prohibitive number of measurements and impractical runtimes for relevant system sizes. Here, we suggest a stochastic approach to variational quantum imaginary-time evolution, which allows a significant reduction in runtimes. Our approach allows trading off invested resources and accuracy, which makes it also suitable for ground state preparation, where simulating the exact dynamics is not required. We demonstrate the efficiency of our algorithm in simulations and show a hardware experiment performing the imaginary-time evolution of the transverse field Ising model on 27 qubits.
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.