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

IEEE International Conference on Acoustics Speech and Signal Processing

The Role of Initial Entanglement in Adaptive Gibbs State Preparation on Quantum Computers

Sophia E. Economou, Ada Warren, Edwin Barnes

Published May 5, 2023• 4 citations
Publisher

Abstract

Sampling from distributions is an important capability for a range of tasks in science and engineering, including in machine learning applications. Quantum computers hold promise for the capability of sampling from distributions that are hard to sample from with usual (classical) computers. We have recently introduced an adaptive quantum variational algorithm for Gibbs state preparation, a state that can be sampled to yield a thermal (or Gibbs) distribution. This has applications in statistical physics, stochastic processes, and optimization. Here we explore the role of the initial quantum correlations (i.e., entanglement) built into the ‘data’ quantum bits (those that will be sampled) and the ancilla quantum bits (those that assist in preparing the Gibbs state) in the run-time of the adaptive state-preparation algorithm. Based on our simulations, we conclude that certain types of entangled states perform better for Ising Hamiltonians, while others are more appropriate for XY Hamiltonians. We also show that both perform well if multiple operators are added at each iteration through the ‘TETRIS-ADAPT’ technique.

DOI
10.1109/icassp49357.2023.10094697

Related papers

Adaptive variational algorithms for quantum Gibbs state preparation

Ada Warren, Zhu, Linghua, Nicholas J. Mayhall +2 more

The preparation of Gibbs thermal states is an important task in quantum computation with applications in quantum simulation, quantum optimization, and quantum machine learning. However, many algorithms for preparing Gibbs states rely on quantum subroutines which are difficult to implement on near-term hardware. Here, we address this by (i) introducing an objective function that, unlike the free energy, is easily measured, and (ii) using dynamically generated, problem-tailored ansätze. This allows for arbitrarily accurate Gibbs state preparation using low-depth circuits. To verify the effectiveness of our approach, we numerically demonstrate that our algorithm can prepare high-fidelity Gibbs states across a broad range of temperatures and for a variety of Hamiltonians.

arXiv:2203.12757•Mar 23, 2022•38 citations

Quantum Sampling Algorithms for Near-Term Devices

Dominik S. Wild, Dries Sels, Hannes Pichler +2 more

Efficient sampling from a classical Gibbs distribution is an important computational problem with applications ranging from statistical physics over Monte Carlo and optimization algorithms to machine learning. We introduce a family of quantum algorithms that provide unbiased samples by preparing a state encoding the entire Gibbs distribution. We show that this approach leads to a speedup over a classical Markov chain algorithm for several examples, including the Ising model and sampling from weighted independent sets of two different graphs. Our approach connects computational complexity with phase transitions, providing a physical interpretation of quantum speedup. Moreover, it opens the door to exploring potentially useful sampling algorithms on near-term quantum devices, as the algorithm for sampling from independent sets on certain graphs can be naturally implemented using Rydberg atom arrays.

arXiv:2005.14059•Physical Review Letters•Sep 2, 2021•33 citations

Gibbs state sampling via cluster expansions

Norhan M. Eassa, Mahmoud M. Moustafa, Arnab Banerjee +1 more

Gibbs states (i.e., thermal states) can be used for several applications such as quantum simulation, quantum machine learning, quantum optimization, and the study of open quantum systems. Moreover, semi-definite programming, combinatorial optimization problems, and training quantum Boltzmann machines can all be addressed by sampling from well-prepared Gibbs states. With that, however, comes the fact that preparing and sampling from Gibbs states on a quantum computer are notoriously difficult tasks. Such tasks can require large overhead in resources and/or calibration even in the simplest of cases, as well as the fact that the implementation might be limited to only a specific set of systems. We propose a method based on sampling from a quasi-distribution consisting of tensor products of mixed states on local clusters, i.e., expanding the full Gibbs state into a sum of products of local “Gibbs-cumulant” type states easier to implement and sample from on quantum hardware. We begin with presenting results for 4-spin linear chains with XY spin interactions, for which we obtain the Z Z dynamical spin-spin correlation functions and dynamical structure factor. We also present the results of measuring the specific heat of the 8-spin chain Gibbs state ρ 8 .

arXiv:2310.20129•npj Quantum Information•Oct 4, 2024•3 citations

Variational Quantum Gibbs State Preparation with a Truncated Taylor Series

Youle Wang, Guangxi Li, Xin Wang

The preparation of a quantum Gibbs state is an essential part of quantum computation and has wide-ranging applications in various areas, including quantum simulation, quantum optimization, and quantum machine learning. In this paper, we propose variational hybrid quantum-classical algorithms for quantum Gibbs state preparation. We first utilize a truncated Taylor series to evaluate the free energy and choose the truncated free energy as the loss function. Our protocol then trains the parameterized quantum circuits to learn the desired quantum Gibbs state. Notably, this algorithm can be implemented on near-term quantum computers equipped with parameterized quantum circuits. By performing numerical experiments, we show that shallow parameterized circuits with only one additional qubit can be trained to prepare the Ising chain and spin chain Gibbs states with a fidelity higher than 95%. In particular, for the Ising chain model, we find that a simplified circuit ansatz with only one parameter and one additional qubit can be trained to realize a 99% fidelity in Gibbs state preparation at inverse temperatures larger than $2$.

arXiv:2005.08797•Physical Review Applied•Nov 18, 2021•106 citations

Gibbs sampling

Alexander M. Dalzell, Sam McArdle, Mario Berta +10 more

This chapter covers the quantum algorithmic primitive called Gibbs sampling. Gibbs sampling accomplishes the task of preparing a digital representation of the thermal state, also known as the Gibbs state, of a quantum system in thermal equilibrium. Gibbs sampling is an important ingredient in quantum algorithms to simulate physical systems. We cover multiple approaches to Gibbs sampling, including algorithms that are analogues of classical Markov chain Monte Carlo algorithms.

Cambridge University Press eBooks•Apr 24, 2025•1 citation

Variational Gibbs state preparation on noisy intermediate-scale quantum devices

Mirko Consiglio, Jacopo Settino, Andrea Giordano +6 more

The preparation of an equilibrium thermal state of a quantum many-body system on noisy intermediate-scale quantum (NISQ) devices is an important task in order to extend the range of applications of quantum computation. Faithful Gibbs state preparation would pave the way to investigate protocols such as thermalization and out-of-equilibrium thermodynamics and provide useful resources for quantum algorithms, where sampling from Gibbs states constitutes a key subroutine. We propose a variational quantum algorithm (VQA) to prepare Gibbs states of a quantum many-body system. The novelty of our VQA consists of implementing a parameterized quantum circuit acting on two distinct, yet connected (via cnot gates), quantum registers. The VQA evaluates the Helmholtz free energy, where the von Neumann entropy is obtained via postprocessing of computational-basis measurements on one register, while the Gibbs state is prepared on the other register via a unitary rotation in the energy basis. Finally, we benchmark our VQA by preparing Gibbs states of the transverse-field Ising and Heisenberg XXZ models and achieve remarkably high fidelities across a broad range of temperatures in state-vector simulations. We also assess the performance of the VQA on IBM quantum computers, showcasing its feasibility on current NISQ devices.

arXiv:2303.11276•Physical Review A•Jul 18, 2024•52 citations
Sampling from distributions is an important capability for a range of tasks in science and engineering, including in machine learning applications. Quantum computers hold promise for the capability of sampling from distributions that are hard to sample from with usual (classical) computers. We have recently introduced an adaptive quantum variational algorithm for Gibbs state preparation, a state that can be sampled to yield a thermal (or Gibbs) distribution. This has applications in statistical physics, stochastic processes, and optimization. Here we explore the role of the initial quantum correlations (i.e., entanglement) built into the ‘data’ quantum bits (those that will be sampled) and the ancilla quantum bits (those that assist in preparing the Gibbs state) in the run-time of the adaptive state-preparation algorithm. Based on our simulations, we conclude that certain types of entangled states perform better for Ising Hamiltonians, while others are more appropriate for XY Hamiltonians. We also show that both perform well if multiple operators are added at each iteration through the ‘TETRIS-ADAPT’ technique.
The preparation of Gibbs thermal states is an important task in quantum computation with applications in quantum simulation, quantum optimization, and quantum machine learning. However, many algorithms for preparing Gibbs states rely on quantum subroutines which are difficult to implement on near-term hardware. Here, we address this by (i) introducing an objective function that, unlike the free energy, is easily measured, and (ii) using dynamically generated, problem-tailored ansätze. This allows for arbitrarily accurate Gibbs state preparation using low-depth circuits. To verify the effectiveness of our approach, we numerically demonstrate that our algorithm can prepare high-fidelity Gibbs states across a broad range of temperatures and for a variety of Hamiltonians.
Efficient sampling from a classical Gibbs distribution is an important computational problem with applications ranging from statistical physics over Monte Carlo and optimization algorithms to machine learning. We introduce a family of quantum algorithms that provide unbiased samples by preparing a state encoding the entire Gibbs distribution. We show that this approach leads to a speedup over a classical Markov chain algorithm for several examples, including the Ising model and sampling from weighted independent sets of two different graphs. Our approach connects computational complexity with phase transitions, providing a physical interpretation of quantum speedup. Moreover, it opens the door to exploring potentially useful sampling algorithms on near-term quantum devices, as the algorithm for sampling from independent sets on certain graphs can be naturally implemented using Rydberg atom arrays.
Gibbs states (i.e., thermal states) can be used for several applications such as quantum simulation, quantum machine learning, quantum optimization, and the study of open quantum systems. Moreover, semi-definite programming, combinatorial optimization problems, and training quantum Boltzmann machines can all be addressed by sampling from well-prepared Gibbs states. With that, however, comes the fact that preparing and sampling from Gibbs states on a quantum computer are notoriously difficult tasks. Such tasks can require large overhead in resources and/or calibration even in the simplest of cases, as well as the fact that the implementation might be limited to only a specific set of systems. We propose a method based on sampling from a quasi-distribution consisting of tensor products of mixed states on local clusters, i.e., expanding the full Gibbs state into a sum of products of local “Gibbs-cumulant” type states easier to implement and sample from on quantum hardware. We begin with presenting results for 4-spin linear chains with XY spin interactions, for which we obtain the Z Z dynamical spin-spin correlation functions and dynamical structure factor. We also present the results of measuring the specific heat of the 8-spin chain Gibbs state ρ 8 .
The preparation of a quantum Gibbs state is an essential part of quantum computation and has wide-ranging applications in various areas, including quantum simulation, quantum optimization, and quantum machine learning. In this paper, we propose variational hybrid quantum-classical algorithms for quantum Gibbs state preparation. We first utilize a truncated Taylor series to evaluate the free energy and choose the truncated free energy as the loss function. Our protocol then trains the parameterized quantum circuits to learn the desired quantum Gibbs state. Notably, this algorithm can be implemented on near-term quantum computers equipped with parameterized quantum circuits. By performing numerical experiments, we show that shallow parameterized circuits with only one additional qubit can be trained to prepare the Ising chain and spin chain Gibbs states with a fidelity higher than 95%. In particular, for the Ising chain model, we find that a simplified circuit ansatz with only one parameter and one additional qubit can be trained to realize a 99% fidelity in Gibbs state preparation at inverse temperatures larger than 222.
The preparation of an equilibrium thermal state of a quantum many-body system on noisy intermediate-scale quantum (NISQ) devices is an important task in order to extend the range of applications of quantum computation. Faithful Gibbs state preparation would pave the way to investigate protocols such as thermalization and out-of-equilibrium thermodynamics and provide useful resources for quantum algorithms, where sampling from Gibbs states constitutes a key subroutine. We propose a variational quantum algorithm (VQA) to prepare Gibbs states of a quantum many-body system. The novelty of our VQA consists of implementing a parameterized quantum circuit acting on two distinct, yet connected (via cnot gates), quantum registers. The VQA evaluates the Helmholtz free energy, where the von Neumann entropy is obtained via postprocessing of computational-basis measurements on one register, while the Gibbs state is prepared on the other register via a unitary rotation in the energy basis. Finally, we benchmark our VQA by preparing Gibbs states of the transverse-field Ising and Heisenberg XXZ models and achieve remarkably high fidelities across a broad range of temperatures in state-vector simulations. We also assess the performance of the VQA on IBM quantum computers, showcasing its feasibility on current NISQ devices.