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

Bulletin of the American Physical Society

Computing Free Energy with Fluctuation Relations on Quantum Computers

Lindsay Bassman Oftelie, Katherine Klymko, Norm M. Tubman, Wibe Albert de Jong

Published Mar 19, 2021• 0 citations
OpenAlex

Abstract

Author(s): Bassman, Lindsay; Klymko, Katherine; Liu, Diyi; Tubman, Norman M; Jong, Wibe A de | Abstract: Fluctuation relations allow for the computation of equilibrium properties, like free energy, from an ensemble of non-equilibrium dynamics simulations. Computing them for quantum systems, however, can be difficult, as performing dynamic simulations of such systems is exponentially hard on classical computers. Quantum computers can alleviate this hurdle, as they can efficiently simulate quantum systems. Here, we present an algorithm utilizing a fluctuation relation known as the Jarzynski equality to approximate free energy differences of quantum systems on a quantum computer. We discuss under which conditions our approximation becomes exact, and under which conditions it serves as a strict upper bound. Furthermore, we successfully demonstrate a proof-of-concept of our algorithm using the transverse field Ising model on a real quantum processor. The free energy is a central thermodynamic property that allows one to compute virtually any equilibrium property of a physical system. Thus, as quantum hardware continues to improve, our algorithm may serve as a valuable tool in a wide range of applications including the construction of phase diagrams, prediction of transport properties and reaction constants, and computer-aided drug design in the future.

Related papers

Computing Free Energies with Fluctuation Relations on Quantum Computers

Lindsay Bassman Oftelie, Katherine Klymko, Diyi Liu +2 more

As a central thermodynamic property, free energy enables the calculation of virtually any equilibrium property of a physical system, allowing for the construction of phase diagrams and predictions about transport, chemical reactions, and biological processes. Thus, methods for efficiently computing free energies, which in general is a difficult problem, are of great interest to broad areas of physics and the natural sciences. The majority of techniques for computing free energies target classical systems, leaving the computation of free energies in quantum systems less explored. Recently developed fluctuation relations enable the computation of free energy differences in quantum systems from an ensemble of dynamic simulations. While performing such simulations is exponentially hard on classical computers, quantum computers can efficiently simulate the dynamics of quantum systems. Here, we present an algorithm utilizing a fluctuation relation known as the Jarzynski equality to approximate free energy differences of quantum systems on a quantum computer. We discuss under which conditions our approximation becomes exact, and under which conditions it serves as a strict upper bound. Furthermore, we successfully demonstrate a proof of concept of our algorithm using the transverse field Ising model on a real quantum processor. As quantum hardware continues to improve, we anticipate that our algorithm will enable computation of free energy differences for a wide range of quantum systems useful across the natural sciences.

arXiv:2103.09846•Physical Review Letters•Sep 23, 2022•36 citations

Quantum Many-Body Jarzynski Equality and Dissipative Noise on a Digital Quantum Computer

Dominik Hahn, Maxime Dupont, Markus Schmitt +2 more

The quantum Jarzynski equality and the Crooks relation are fundamental laws connecting equilibrium processes with nonequilibrium fluctuations.They are promising tools to benchmark quantum devices and measure free energy differences.While they are well established theoretically and also experimental realizations for few-body systems already exist, their experimental validity in the quantum many-body regime has not been observed so far.Here, we present results for nonequilibrium protocols in systems with up to 16 interacting degrees of freedom obtained on trapped ion and superconducting qubit quantum computers, which test the quantum Jarzynski equality and the Crooks relation in the many-body regime.To achieve this, we overcome present-day limitations in the preparation of thermal ensembles and in the measurement of work distributions on noisy intermediate-scale quantum devices.We discuss the accuracy to which the Jarzynski equality holds on different quantum computing platforms subject to platformspecific errors.The analysis reveals the validity of Jarzynski's equality in a regime with energy dissipation, compensated for by a fast unitary drive.This provides new insights for analyzing errors in many-body quantum simulators.

arXiv:2207.14313•Physical Review X•Nov 2, 2023•14 citations

Operational Work Fluctuation Theorem for Open Quantum Systems

Konstantin Beyer, Walter T. Strunz

The classical Jarzynski equality establishes an exact relation between the stochastic work performed on a system driven out of thermal equilibrium and the free energy difference in a corresponding quasistatic process. This fluctuation theorem bears experimental relevance, as it enables the determination of the free energy difference through the measurement of externally applied work in a nonequilibrium process. In the quantum case, the Jarzynski equality only holds if the measurement procedure of the stochastic work is drastically changed: it is replaced by a so-called two-point measurement scheme that requires the knowledge of the initial and final Hamiltonian and therefore lacks the predictive power for the free energy difference that the classical Jarzynski equation is known for. Here, we propose a quantum fluctuation theorem that is valid for externally measurable quantum work determined during the driving protocol. In contrast to the two-point measurement case, the theorem also applies to open quantum systems and the scenario can be realized without knowing the system Hamiltonian. Our fluctuation theorem comes in the form of an inequality and therefore only yields bounds to the true free energy difference. The inequality is saturated in the quasiclassical case of vanishing energy coherences at the beginning and at the end of the protocol. Thus, there is a clear quantum disadvantage.

arXiv:2408.13417•Physical Review Letters•Apr 9, 2025•4 citations

Fullqubit alchemist: quantum algorithm for alchemical free energy calculations

Po‐Wei Huang, Gregory Boyd, Gian-Luca Anselmetti +11 more

Abstract Accurately computing the free energies of biological processes is a cornerstone of computer-aided drug design, but it is a daunting task. The need to sample vast conformational spaces and account for entropic contributions makes the estimation of binding free energies very expensive. While classical methods, such as thermodynamic integration and alchemical free energy calculations, have significantly contributed to reducing computational costs, they still face limitations in terms of efficiency and scalability. We tackle this through a quantum algorithm for the estimation of free energy differences by adapting the existing Liouvillian approach and introducing several key algorithmic improvements. We directly implement the Liouvillian operator and provide an efficient description of electronic forces acting on both nuclear and electronic particles on the quantum ground state potential energy surface. This leads to super-polynomial runtime scaling improvements in the precision of our Liouvillian simulation approach and quadratic improvements in the scaling with the number of particles relative to prior quantum algorithms. Second, our algorithm calculates free energy differences via a fully quantum implementation of thermodynamic integration and alchemy, thereby foregoing expensive entropy estimation subroutines used in prior works. Our results open new avenues towards the application of quantum computers in drug discovery.

arXiv:2508.16719•npj Quantum Information•Jun 23, 2026•17 citations

Algorithmic Quantum Simulations of Quantum Thermodynamics

Yangsen Ye, Jue Nan, Dong Chen +27 more

Characterizing quantum phases-of-matter at finite-temperature is essential for understanding complex materials and large-scale thermodynamic phenomena. Here, we develop algorithmic protocols for simulating quantum thermodynamics on quantum hardware through quantum kernel function expansion (QKFE), producing the free energy as an analytic function of temperature with uniform convergence. These protocols are demonstrated by simulating transverse field Ising and XY models with superconducting qubits. In both analogue and digital implementations of the QKFE algorithms, we exhibit quantitative agreement of our quantum simulation experiments with the exact results. Our approach provides a general framework for computing thermodynamic potentials on programmable quantum devices, granting access to key thermodynamic properties such as entropy, heat capacity and criticality, with far-reaching implications for material design and drug development.

quant-pharXiv:2511.22898•Physical Review Letters•Dec 1, 2025•1 citation

Improved Quantum Algorithms for Simulating Many-Body Systems

Sophia Simon

Quantum computers are expected to significantly outperform classical computers for certain computational tasks. One of the most promising applications is the simulation of many-body systems such as complex molecules or materials. In this thesis, we present several quantum algorithms for simulating many-body systems that can provide considerably better scaling than prior approaches. First, we describe a fully coherent quantum algorithm for simulating molecular dynamics within the Born-Oppenheimer approximation that leads to super-polynomially better scaling with respect to the error tolerance than previous work. Our algorithm utilizes the Koopman-von Neumann formulation of classical mechanics. This allows us to express the classical equations of motion as unitary dynamics which can be efficiently simulated on a quantum computer. We demonstrate that these simulations can be performed either at constant energy or at constant temperature. The latter allows us to estimate thermodynamic properties such as the Helmholtz free energy of the system. Next, we present two closely related quantum algorithms for solving continuous optimization problems such as finding the equilibrium configurations of molecules. These algorithms do not require any explicit gradient estimations. Instead, we encode the optimization problem into the dynamics of a quantum or classical system with friction. The dynamics are governed by a carefully chosen time-dependent Hamiltonian and thus can be simulated using efficient Hamiltonian simulation algorithms. We provide evidence that our fully coherent quantum algorithms can, in certain cases, provide exponentially better asymptotic scaling than approaches based on gradient descent. Lastly, we present a quantum algorithm for preparing the ground state of a set of interacting systems that can circumvent the exponential scaling suggested by the Van Vleck catastrophe. Our algorithm utilizes a divide-and-conquer strategy that repeatedly uses phase estimation to merge ground states of increasingly larger subsystems. We provide rigorous bounds for this approach and show that, under certain assumptions, our algorithm scales only quasi-polynomially with the number of systems.

•Jun 1, 2026•0 citations
Author(s): Bassman, Lindsay; Klymko, Katherine; Liu, Diyi; Tubman, Norman M; Jong, Wibe A de | Abstract: Fluctuation relations allow for the computation of equilibrium properties, like free energy, from an ensemble of non-equilibrium dynamics simulations. Computing them for quantum systems, however, can be difficult, as performing dynamic simulations of such systems is exponentially hard on classical computers. Quantum computers can alleviate this hurdle, as they can efficiently simulate quantum systems. Here, we present an algorithm utilizing a fluctuation relation known as the Jarzynski equality to approximate free energy differences of quantum systems on a quantum computer. We discuss under which conditions our approximation becomes exact, and under which conditions it serves as a strict upper bound. Furthermore, we successfully demonstrate a proof-of-concept of our algorithm using the transverse field Ising model on a real quantum processor. The free energy is a central thermodynamic property that allows one to compute virtually any equilibrium property of a physical system. Thus, as quantum hardware continues to improve, our algorithm may serve as a valuable tool in a wide range of applications including the construction of phase diagrams, prediction of transport properties and reaction constants, and computer-aided drug design in the future.
As a central thermodynamic property, free energy enables the calculation of virtually any equilibrium property of a physical system, allowing for the construction of phase diagrams and predictions about transport, chemical reactions, and biological processes. Thus, methods for efficiently computing free energies, which in general is a difficult problem, are of great interest to broad areas of physics and the natural sciences. The majority of techniques for computing free energies target classical systems, leaving the computation of free energies in quantum systems less explored. Recently developed fluctuation relations enable the computation of free energy differences in quantum systems from an ensemble of dynamic simulations. While performing such simulations is exponentially hard on classical computers, quantum computers can efficiently simulate the dynamics of quantum systems. Here, we present an algorithm utilizing a fluctuation relation known as the Jarzynski equality to approximate free energy differences of quantum systems on a quantum computer. We discuss under which conditions our approximation becomes exact, and under which conditions it serves as a strict upper bound. Furthermore, we successfully demonstrate a proof of concept of our algorithm using the transverse field Ising model on a real quantum processor. As quantum hardware continues to improve, we anticipate that our algorithm will enable computation of free energy differences for a wide range of quantum systems useful across the natural sciences.
The quantum Jarzynski equality and the Crooks relation are fundamental laws connecting equilibrium processes with nonequilibrium fluctuations.They are promising tools to benchmark quantum devices and measure free energy differences.While they are well established theoretically and also experimental realizations for few-body systems already exist, their experimental validity in the quantum many-body regime has not been observed so far.Here, we present results for nonequilibrium protocols in systems with up to 16 interacting degrees of freedom obtained on trapped ion and superconducting qubit quantum computers, which test the quantum Jarzynski equality and the Crooks relation in the many-body regime.To achieve this, we overcome present-day limitations in the preparation of thermal ensembles and in the measurement of work distributions on noisy intermediate-scale quantum devices.We discuss the accuracy to which the Jarzynski equality holds on different quantum computing platforms subject to platformspecific errors.The analysis reveals the validity of Jarzynski's equality in a regime with energy dissipation, compensated for by a fast unitary drive.This provides new insights for analyzing errors in many-body quantum simulators.
The classical Jarzynski equality establishes an exact relation between the stochastic work performed on a system driven out of thermal equilibrium and the free energy difference in a corresponding quasistatic process. This fluctuation theorem bears experimental relevance, as it enables the determination of the free energy difference through the measurement of externally applied work in a nonequilibrium process. In the quantum case, the Jarzynski equality only holds if the measurement procedure of the stochastic work is drastically changed: it is replaced by a so-called two-point measurement scheme that requires the knowledge of the initial and final Hamiltonian and therefore lacks the predictive power for the free energy difference that the classical Jarzynski equation is known for. Here, we propose a quantum fluctuation theorem that is valid for externally measurable quantum work determined during the driving protocol. In contrast to the two-point measurement case, the theorem also applies to open quantum systems and the scenario can be realized without knowing the system Hamiltonian. Our fluctuation theorem comes in the form of an inequality and therefore only yields bounds to the true free energy difference. The inequality is saturated in the quasiclassical case of vanishing energy coherences at the beginning and at the end of the protocol. Thus, there is a clear quantum disadvantage.
Abstract Accurately computing the free energies of biological processes is a cornerstone of computer-aided drug design, but it is a daunting task. The need to sample vast conformational spaces and account for entropic contributions makes the estimation of binding free energies very expensive. While classical methods, such as thermodynamic integration and alchemical free energy calculations, have significantly contributed to reducing computational costs, they still face limitations in terms of efficiency and scalability. We tackle this through a quantum algorithm for the estimation of free energy differences by adapting the existing Liouvillian approach and introducing several key algorithmic improvements. We directly implement the Liouvillian operator and provide an efficient description of electronic forces acting on both nuclear and electronic particles on the quantum ground state potential energy surface. This leads to super-polynomial runtime scaling improvements in the precision of our Liouvillian simulation approach and quadratic improvements in the scaling with the number of particles relative to prior quantum algorithms. Second, our algorithm calculates free energy differences via a fully quantum implementation of thermodynamic integration and alchemy, thereby foregoing expensive entropy estimation subroutines used in prior works. Our results open new avenues towards the application of quantum computers in drug discovery.
Characterizing quantum phases-of-matter at finite-temperature is essential for understanding complex materials and large-scale thermodynamic phenomena. Here, we develop algorithmic protocols for simulating quantum thermodynamics on quantum hardware through quantum kernel function expansion (QKFE), producing the free energy as an analytic function of temperature with uniform convergence. These protocols are demonstrated by simulating transverse field Ising and XY models with superconducting qubits. In both analogue and digital implementations of the QKFE algorithms, we exhibit quantitative agreement of our quantum simulation experiments with the exact results. Our approach provides a general framework for computing thermodynamic potentials on programmable quantum devices, granting access to key thermodynamic properties such as entropy, heat capacity and criticality, with far-reaching implications for material design and drug development.
Quantum computers are expected to significantly outperform classical computers for certain computational tasks. One of the most promising applications is the simulation of many-body systems such as complex molecules or materials. In this thesis, we present several quantum algorithms for simulating many-body systems that can provide considerably better scaling than prior approaches. First, we describe a fully coherent quantum algorithm for simulating molecular dynamics within the Born-Oppenheimer approximation that leads to super-polynomially better scaling with respect to the error tolerance than previous work. Our algorithm utilizes the Koopman-von Neumann formulation of classical mechanics. This allows us to express the classical equations of motion as unitary dynamics which can be efficiently simulated on a quantum computer. We demonstrate that these simulations can be performed either at constant energy or at constant temperature. The latter allows us to estimate thermodynamic properties such as the Helmholtz free energy of the system. Next, we present two closely related quantum algorithms for solving continuous optimization problems such as finding the equilibrium configurations of molecules. These algorithms do not require any explicit gradient estimations. Instead, we encode the optimization problem into the dynamics of a quantum or classical system with friction. The dynamics are governed by a carefully chosen time-dependent Hamiltonian and thus can be simulated using efficient Hamiltonian simulation algorithms. We provide evidence that our fully coherent quantum algorithms can, in certain cases, provide exponentially better asymptotic scaling than approaches based on gradient descent. Lastly, we present a quantum algorithm for preparing the ground state of a set of interacting systems that can circumvent the exponential scaling suggested by the Van Vleck catastrophe. Our algorithm utilizes a divide-and-conquer strategy that repeatedly uses phase estimation to merge ground states of increasingly larger subsystems. We provide rigorous bounds for this approach and show that, under certain assumptions, our algorithm scales only quasi-polynomially with the number of systems.