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:2107.06234 · Chinese Physics B

Variational quantum simulation of thermal statistical states on a superconducting quantum processer

Xueyi Guo, Shang-Shu Li, Xiao Xiao, Zhongcheng Xiang, Zi-Yong Ge, Hekang Li, Pengtao Song, Yi Peng, Zhan Wang, Kai Xu, Pan Zhang, Lei Wang, Dongning Zheng, Heng Fan

Published Dec 2, 2022• 23 citations
arXivHTMLPDF

Abstract

Quantum computers promise to solve finite-temperature properties of quantum many-body systems, which is generally challenging for classical computers due to high computational complexities. Here, we report experimental preparations of Gibbs states and excited states of Heisenberg XX and XXZ models by using a 5-qubit programmable superconducting processor. In the experiments, we apply a hybrid quantum–classical algorithm to generate finite temperature states with classical probability models and variational quantum circuits. We reveal that the Hamiltonians can be fully diagonalized with optimized quantum circuits, which enable us to prepare excited states at arbitrary energy density. We demonstrate that the approach has a self-verifying feature and can estimate fundamental thermal observables with a small statistical error. Based on numerical results, we further show that the time complexity of our approach scales polynomially in the number of qubits, revealing its potential in solving large-scale problems.

DOI
10.1088/1674-1056/aca7f3

Related papers

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

Preparing thermal states on noiseless and noisy programmable quantum processors

Oles Shtanko, Ramis Movassagh

Nature is governed by precise physical laws, which can inspire the discovery of new computer-run simulation algorithms. Thermal states are the most ubiquitous for they are the equilibrium states of matter. Simulating thermal states of quantum matter has applications ranging from quantum machine learning to better understanding of high-temperature superconductivity and quantum chemistry. The computational complexity of this task is hopelessly hard for classical computers. The existing quantum algorithms come with caveats: most either require quantum phase estimation rendering them impractical for current noisy hardware, or are variational which face obstacles such as initialization, barren plateaus, and a general lack of provable guarantee. We provide two quantum algorithms with provable guarantees to prepare thermal states on (near-term) quantum computers that avoid these drawbacks. The first algorithm is inspired by the natural thermalization process where the ancilla qubits act as the infinite thermal bath. This algorithm can potentially run in polynomial time to sample thermal distributions of ergodic systems -- the vast class of physical systems that equilibrate in isolation with respect to local observables. The second algorithm works for any system and in general runs in exponential time. However, it requires significantly smaller quantum resources than previous such algorithms. In addition, we provide an error mitigation technique for both algorithms to fight back decoherence, which enables us to run our algorithms on the near-term quantum devices. To illustration, we simulate the thermal state of the hardcore Bose-Hubbard model on the latest generation of available quantum computers.

arXiv:2112.14688•Dec 29, 2021•74 citations

Variational preparation of finite-temperature states on a quantum computer

Ramiro Sagastizabal, Shavindra Premaratne, Berend Klaver +13 more

Abstract The preparation of thermal equilibrium states is important for the simulation of condensed matter and cosmology systems using a quantum computer. We present a method to prepare such mixed states with unitary operators and demonstrate this technique experimentally using a gate-based quantum processor. Our method targets the generation of thermofield double states using a hybrid quantum-classical variational approach motivated by quantum-approximate optimization algorithms, without prior calculation of optimal variational parameters by numerical simulation. The fidelity of generated states to the thermal-equilibrium state smoothly varies from 99 to 75% between infinite and near-zero simulated temperature, in quantitative agreement with numerical simulations of the noisy quantum processor with error parameters drawn from experiment.

arXiv:2012.03895•npj Quantum Information•Aug 20, 2021•69 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

Simulating Thermal Properties of Bose-Hubbard Models on a Quantum Computer

Simon Becker, Cambyse Rouzé, Robert Salzmann

While recent advances have established efficient quantum algorithms for preparing Gibbs states of finite-dimensional systems, comparable complexity results for bosonic and other infinite-dimensional models remain unexplored. We introduce the first general rigorous Gibbs sampling framework for bosonic many-body systems, showing that physically relevant bosonic models admit gapped dissipative generators, enabling efficient preparation of thermal states, provided that the spectral gap scales favourably with the number of modes. Although our results hold for broad classes of models, we illustrate them using Bose-Hubbard Hamiltonians, both within and beyond the mean-field regime. In both cases, we show that the associated dissipative generators maintain a positive spectral gap, thereby implying exponential convergence to the thermal state. For the Gibbs sampler corresponding to the full Bose-Hubbard model, we obtain a spectral-gap lower bound $Ce^{-cn}$, where $n$ is the number of modes. We apply our results to provide a Gibbs-state preparation algorithm on qubit hardware, with runtime polynomial in the number of modes and the inverse spectral gap, and thereby obtain a quantum algorithm to compute thermal properties of the model. This provides the first mathematically controlled route to Gibbs sampling in infinite-dimensional systems, with implications for quantum simulation, thermalization, and many-body complexity, where quantum advantages may arise.

quant-pharXiv:2604.06077•Apr 8, 2026•3 citations

Qubit-efficient simulation of thermal states with quantum tensor networks

Yuxuan Zhang, Shahin Jahanbani, Daoheng Niu +2 more

We present a holographic quantum simulation algorithm to variationally prepare thermal states of $d$-dimensional interacting quantum many-body systems, using only enough hardware qubits to represent a $(d\ensuremath{-}1)$-dimensional cross section. This technique implements the thermal state by approximately unraveling the quantum matrix-product density operator (qMPDO) into a stochastic mixture of quantum matrix-product states (sto-qMPS). The parameters of the quantum circuits generating the qMPS and of the probability distribution generating the stochastic mixture are determined through a variational optimization procedure. We demonstrate a small-scale proof-of-principle demonstration of this technique on Quantinuum's trapped-ion quantum processor to simulate thermal properties of correlated spin chains over a wide temperature range using only a single pair of hardware qubits. Then, through classical simulations, we explore the representational power of two versions of sto-qMPS ansatzes for larger and deeper circuits and establish empirical relationships between the circuit resources and the accuracy of the variational free energy.

arXiv:2205.06299•Physical review. B./Physical review. B•Oct 24, 2022•17 citations
Quantum computers promise to solve finite-temperature properties of quantum many-body systems, which is generally challenging for classical computers due to high computational complexities. Here, we report experimental preparations of Gibbs states and excited states of Heisenberg XX and XXZ models by using a 5-qubit programmable superconducting processor. In the experiments, we apply a hybrid quantum–classical algorithm to generate finite temperature states with classical probability models and variational quantum circuits. We reveal that the Hamiltonians can be fully diagonalized with optimized quantum circuits, which enable us to prepare excited states at arbitrary energy density. We demonstrate that the approach has a self-verifying feature and can estimate fundamental thermal observables with a small statistical error. Based on numerical results, we further show that the time complexity of our approach scales polynomially in the number of qubits, revealing its potential in solving large-scale problems.
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.
Nature is governed by precise physical laws, which can inspire the discovery of new computer-run simulation algorithms. Thermal states are the most ubiquitous for they are the equilibrium states of matter. Simulating thermal states of quantum matter has applications ranging from quantum machine learning to better understanding of high-temperature superconductivity and quantum chemistry. The computational complexity of this task is hopelessly hard for classical computers. The existing quantum algorithms come with caveats: most either require quantum phase estimation rendering them impractical for current noisy hardware, or are variational which face obstacles such as initialization, barren plateaus, and a general lack of provable guarantee. We provide two quantum algorithms with provable guarantees to prepare thermal states on (near-term) quantum computers that avoid these drawbacks. The first algorithm is inspired by the natural thermalization process where the ancilla qubits act as the infinite thermal bath. This algorithm can potentially run in polynomial time to sample thermal distributions of ergodic systems -- the vast class of physical systems that equilibrate in isolation with respect to local observables. The second algorithm works for any system and in general runs in exponential time. However, it requires significantly smaller quantum resources than previous such algorithms. In addition, we provide an error mitigation technique for both algorithms to fight back decoherence, which enables us to run our algorithms on the near-term quantum devices. To illustration, we simulate the thermal state of the hardcore Bose-Hubbard model on the latest generation of available quantum computers.
Abstract The preparation of thermal equilibrium states is important for the simulation of condensed matter and cosmology systems using a quantum computer. We present a method to prepare such mixed states with unitary operators and demonstrate this technique experimentally using a gate-based quantum processor. Our method targets the generation of thermofield double states using a hybrid quantum-classical variational approach motivated by quantum-approximate optimization algorithms, without prior calculation of optimal variational parameters by numerical simulation. The fidelity of generated states to the thermal-equilibrium state smoothly varies from 99 to 75% between infinite and near-zero simulated temperature, in quantitative agreement with numerical simulations of the noisy quantum processor with error parameters drawn from experiment.
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.
While recent advances have established efficient quantum algorithms for preparing Gibbs states of finite-dimensional systems, comparable complexity results for bosonic and other infinite-dimensional models remain unexplored. We introduce the first general rigorous Gibbs sampling framework for bosonic many-body systems, showing that physically relevant bosonic models admit gapped dissipative generators, enabling efficient preparation of thermal states, provided that the spectral gap scales favourably with the number of modes. Although our results hold for broad classes of models, we illustrate them using Bose-Hubbard Hamiltonians, both within and beyond the mean-field regime. In both cases, we show that the associated dissipative generators maintain a positive spectral gap, thereby implying exponential convergence to the thermal state. For the Gibbs sampler corresponding to the full Bose-Hubbard model, we obtain a spectral-gap lower bound Ce−cnCe^{-cn}Ce−cn, where nnn is the number of modes. We apply our results to provide a Gibbs-state preparation algorithm on qubit hardware, with runtime polynomial in the number of modes and the inverse spectral gap, and thereby obtain a quantum algorithm to compute thermal properties of the model. This provides the first mathematically controlled route to Gibbs sampling in infinite-dimensional systems, with implications for quantum simulation, thermalization, and many-body complexity, where quantum advantages may arise.
We present a holographic quantum simulation algorithm to variationally prepare thermal states of ddd-dimensional interacting quantum many-body systems, using only enough hardware qubits to represent a $(d\ensuremath{-}1)$-dimensional cross section. This technique implements the thermal state by approximately unraveling the quantum matrix-product density operator (qMPDO) into a stochastic mixture of quantum matrix-product states (sto-qMPS). The parameters of the quantum circuits generating the qMPS and of the probability distribution generating the stochastic mixture are determined through a variational optimization procedure. We demonstrate a small-scale proof-of-principle demonstration of this technique on Quantinuum's trapped-ion quantum processor to simulate thermal properties of correlated spin chains over a wide temperature range using only a single pair of hardware qubits. Then, through classical simulations, we explore the representational power of two versions of sto-qMPS ansatzes for larger and deeper circuits and establish empirical relationships between the circuit resources and the accuracy of the variational free energy.