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:2109.14880 · Japanese Journal of Applied Physics

Calculation of Gibbs partition function with imaginary time evolution on near-term quantum computers

Keisuke T. Matsumoto, Yuta Shingu, Suguru Endo, Shiro Kawabata, Shohei Watabe, Tetsuro Nikuni, Hideaki Hakoshima, Yuichiro Matsuzaki

Published Feb 2, 2022• 8 citations
arXivHTMLPDF

Abstract

Abstract The Gibbs partition function is an important quantity in describing statistical properties of a system in thermodynamic equilibrium. There are several proposals to calculate the partition functions on near-term quantum computers. However, the existing schemes require many copies of the Gibbs states to perform an extrapolation for the calculation of the partition function, which could be costly performed on the near-term quantum computers. We propose a scheme to calculate the Gibbs function with the imaginary time evolution. After preparing Gibbs states with different temperatures by using the imaginary time evolution, we measure the overlap between them on a quantum circuit, which allows us to calculate the Gibbs partition function. Our scheme requires only 2 N qubits to calculate the Gibbs function of N qubits.

DOI
10.35848/1347-4065/ac5152

Related papers

Estimating Gibbs partition function with quantum Clifford sampling

Yusen Wu, Jingbo B. Wang

Abstract The partition function is an essential quantity in statistical mechanics, and its accurate computation is a key component of any statistical analysis of quantum systems and phenomena. However, for interacting many-body quantum systems, its calculation generally involves summing over an exponential number of terms and can thus quickly grow to be intractable. Accurately and efficiently estimating the partition function of its corresponding system Hamiltonian then becomes the key in solving quantum many-body problems. In this paper we develop a hybrid quantum–classical algorithm to estimate the partition function, utilising a novel quantum Clifford sampling technique. Note that previous works on the estimation of partition functions require O ( 1 / ϵ Δ ) -depth quantum circuits (Srinivasan et al 2021 IEEE Int. Conf. on Quantum Computing and Engineering (QCE) pp 112–22; Montanaro 2015 Proc. R. Soc. A 471 20150301), where Δ is the minimum spectral gap of stochastic matrices and ϵ is the multiplicative error. Our algorithm requires only a shallow O ( 1 ) -depth quantum circuit, repeated O ( n / ϵ 2 ) times, to provide a comparable ϵ approximation. Shallow-depth quantum circuits are considered vitally important for currently available noisy intermediate-scale quantum devices.

arXiv:2109.10486•Quantum Science and Technology•Jan 4, 2022•10 citations

Predicting Gibbs-State Expectation Values with Pure Thermal Shadows

Luuk Coopmans, Yuta Kikuchi, Marcello Benedetti

The preparation and computation of many properties of quantum Gibbs states is essential for algorithms such as quantum semidefinite programming and quantum Boltzmann machines.We propose a quantum algorithm that can predict M linear functions of an arbitrary Gibbs state with only O(log M ) experimental measurements.Our main insight is that for sufficiently large systems we do not need to prepare the nqubit mixed Gibbs state explicitly but, instead, we can evolve a random n-qubit pure state in imaginary time.The result then follows by constructing classical shadows of these random pure states.We propose a quantum circuit that implements this algorithm by using quantum signal processing for the imaginary time evolution.We numerically verify the efficiency of the algorithm by simulating the circuit for a tenspin-1/2 XXZ-Heisenberg model.In addition, we show that the algorithm can be successfully employed as a subroutine for training an eight-qubit fully connected quantum Boltzmann machine.

arXiv:2206.05302•PRX Quantum•Jan 13, 2023•46 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

Optimal Quantum Algorithm for Gibbs State Preparation

Cambyse Rouzé, Daniel Stilck França, Alvaro Martin Alhambra

It is of great interest to understand the thermalization of open quantum many-body systems, and how quantum computers are able to efficiently simulate that process. A recently introduced dissipative evolution, inspired by existing models of open system thermalization, has been shown to be efficiently implementable on a quantum computer. Here, we prove that, at high enough temperatures, this evolution reaches the Gibbs state in time scaling logarithmically with system size. The result holds for Hamiltonians that satisfy the Lieb-Robinson bound, such as local Hamiltonians on a lattice, and includes long-range systems. To the best of our knowledge, these are the first results rigorously establishing the rapid mixing property of high-temperature quantum Gibbs samplers, which is known to give the fastest possible speed for thermalization in the many-body setting. We then apply our result to the problem of estimating partition functions at high temperature, showing an improved performance over previous classical and quantum algorithms.

arXiv:2411.04885•Physical Review Letters•Jan 14, 2026•94 citations

Polynomial-time Classical Simulation for One-dimensional Quantum Gibbs States

Tomotaka Kuwahara, Keiji Saito

This paper discusses a classical simulation to compute the partition function (or free energy) of generic one-dimensional quantum many-body systems. Many numerical methods have previously been developed to approximately solve one-dimensional quantum systems. However, there exists no exact proof that arbitrary one-dimensional quantum Gibbs states can be efficiently solved by a classical computer. Therefore, the aim of this paper is to prove this with the clustering properties for arbitrary finite temperatures $β^{-1}$. We explicitly show an efficient algorithm that approximates the partition function up to an error $ε$ with a computational cost that scales as $n\cdot {\rm poly}(1/ε)$, where the degree of the polynomial depends on $β$ as $e^{O(β)}$. Extending the analysis to higher dimensions at high temperatures, we obtain a weaker result for the computational cost n\cdot (1/ε)^{\log^{D-1} (1/ε)}, where $D$ is the lattice dimension.

arXiv:1807.08424•Jul 23, 2018•10 citations

A Variational Quantum Algorithm for Preparing Quantum Gibbs States

Anirban Ch Narayan Chowdhury, Guang Hao Low, Nathan Wiebe

Preparation of Gibbs distributions is an important task for quantum computation. It is a necessary first step in some types of quantum simulations and further is essential for quantum algorithms such as quantum Boltzmann training. Despite this, most methods for preparing thermal states are impractical to implement on near-term quantum computers because of the memory overheads required. Here we present a variational approach to preparing Gibbs states that is based on minimizing the free energy of a quantum system. The key insight that makes this practical is the use of Fourier series approximations to the logarithm that allows the entropy component of the free-energy to be estimated through a sequence of simpler measurements that can be combined together using classical post processing. We further show that this approach is efficient for generating high-temperature Gibbs states, within constant error, if the initial guess for the variational parameters for the programmable quantum circuit are sufficiently close to a global optima. Finally, we examine the procedure numerically and show the viability of our approach for five-qubit Hamiltonians using Trotterized adiabatic state preparation as an ansatz.

arXiv:2002.00055•Jan 31, 2020•109 citations
Abstract The Gibbs partition function is an important quantity in describing statistical properties of a system in thermodynamic equilibrium. There are several proposals to calculate the partition functions on near-term quantum computers. However, the existing schemes require many copies of the Gibbs states to perform an extrapolation for the calculation of the partition function, which could be costly performed on the near-term quantum computers. We propose a scheme to calculate the Gibbs function with the imaginary time evolution. After preparing Gibbs states with different temperatures by using the imaginary time evolution, we measure the overlap between them on a quantum circuit, which allows us to calculate the Gibbs partition function. Our scheme requires only 2 N qubits to calculate the Gibbs function of N qubits.
Abstract The partition function is an essential quantity in statistical mechanics, and its accurate computation is a key component of any statistical analysis of quantum systems and phenomena. However, for interacting many-body quantum systems, its calculation generally involves summing over an exponential number of terms and can thus quickly grow to be intractable. Accurately and efficiently estimating the partition function of its corresponding system Hamiltonian then becomes the key in solving quantum many-body problems. In this paper we develop a hybrid quantum–classical algorithm to estimate the partition function, utilising a novel quantum Clifford sampling technique. Note that previous works on the estimation of partition functions require O ( 1 / ϵ Δ ) -depth quantum circuits (Srinivasan et al 2021 IEEE Int. Conf. on Quantum Computing and Engineering (QCE) pp 112–22; Montanaro 2015 Proc. R. Soc. A 471 20150301), where Δ is the minimum spectral gap of stochastic matrices and ϵ is the multiplicative error. Our algorithm requires only a shallow O ( 1 ) -depth quantum circuit, repeated O ( n / ϵ 2 ) times, to provide a comparable ϵ approximation. Shallow-depth quantum circuits are considered vitally important for currently available noisy intermediate-scale quantum devices.
The preparation and computation of many properties of quantum Gibbs states is essential for algorithms such as quantum semidefinite programming and quantum Boltzmann machines.We propose a quantum algorithm that can predict M linear functions of an arbitrary Gibbs state with only O(log M ) experimental measurements.Our main insight is that for sufficiently large systems we do not need to prepare the nqubit mixed Gibbs state explicitly but, instead, we can evolve a random n-qubit pure state in imaginary time.The result then follows by constructing classical shadows of these random pure states.We propose a quantum circuit that implements this algorithm by using quantum signal processing for the imaginary time evolution.We numerically verify the efficiency of the algorithm by simulating the circuit for a tenspin-1/2 XXZ-Heisenberg model.In addition, we show that the algorithm can be successfully employed as a subroutine for training an eight-qubit fully connected quantum Boltzmann machine.
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.
It is of great interest to understand the thermalization of open quantum many-body systems, and how quantum computers are able to efficiently simulate that process. A recently introduced dissipative evolution, inspired by existing models of open system thermalization, has been shown to be efficiently implementable on a quantum computer. Here, we prove that, at high enough temperatures, this evolution reaches the Gibbs state in time scaling logarithmically with system size. The result holds for Hamiltonians that satisfy the Lieb-Robinson bound, such as local Hamiltonians on a lattice, and includes long-range systems. To the best of our knowledge, these are the first results rigorously establishing the rapid mixing property of high-temperature quantum Gibbs samplers, which is known to give the fastest possible speed for thermalization in the many-body setting. We then apply our result to the problem of estimating partition functions at high temperature, showing an improved performance over previous classical and quantum algorithms.
This paper discusses a classical simulation to compute the partition function (or free energy) of generic one-dimensional quantum many-body systems. Many numerical methods have previously been developed to approximately solve one-dimensional quantum systems. However, there exists no exact proof that arbitrary one-dimensional quantum Gibbs states can be efficiently solved by a classical computer. Therefore, the aim of this paper is to prove this with the clustering properties for arbitrary finite temperatures β−1β^{-1}β−1. We explicitly show an efficient algorithm that approximates the partition function up to an error εεε with a computational cost that scales as n⋅poly(1/ε)n\cdot {\rm poly}(1/ε)n⋅poly(1/ε), where the degree of the polynomial depends on βββ as eO(β)e^{O(β)}eO(β). Extending the analysis to higher dimensions at high temperatures, we obtain a weaker result for the computational cost n\cdot (1/ε)^{\log^{D-1} (1/ε)}, where DDD is the lattice dimension.
Preparation of Gibbs distributions is an important task for quantum computation. It is a necessary first step in some types of quantum simulations and further is essential for quantum algorithms such as quantum Boltzmann training. Despite this, most methods for preparing thermal states are impractical to implement on near-term quantum computers because of the memory overheads required. Here we present a variational approach to preparing Gibbs states that is based on minimizing the free energy of a quantum system. The key insight that makes this practical is the use of Fourier series approximations to the logarithm that allows the entropy component of the free-energy to be estimated through a sequence of simpler measurements that can be combined together using classical post processing. We further show that this approach is efficient for generating high-temperature Gibbs states, within constant error, if the initial guess for the variational parameters for the programmable quantum circuit are sufficiently close to a global optima. Finally, we examine the procedure numerically and show the viability of our approach for five-qubit Hamiltonians using Trotterized adiabatic state preparation as an ansatz.