A Variational Quantum Algorithm for Preparing Quantum Gibbs States

Abstract

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.

13 pages, 4 figures

References in corpus (16)

• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Quantum algorithm for solving linear systems of equations
• The theory of variational hybrid quantum-classical algorithms
• Quantum principal component analysis
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Quantum measurements and the Abelian Stabilizer Problem
• Variational Quantum Computation of Excited States
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Optimal Quantum Measurements of Expectation Values of Observables
• Variational Quantum State Diagonalization
• Thermalization in Nature and on a Quantum Computer
• Quantum Simulations of Classical Annealing Processes
• Tomography and Generative Data Modeling via Quantum Boltzmann Training
• The Quantum PCP Conjecture
• Ground States via Spectral Combing on a Quantum Computer

Cited by in corpus (27)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Variational Quantum Boltzmann Machines
• Simultaneous Perturbation Stochastic Approximation of the Quantum Fisher Information
• Neural Predictor based Quantum Architecture Search
• Variational Quantum Singular Value Decomposition
• Variational inference with a quantum computer
• New Quantum Algorithms for Computing Quantum Entropies and Distances
• Generalized Quantum Assisted Simulator
• Variational thermal quantum simulation of the lattice Schwinger model
• Quantum algorithms from fluctuation theorems: Thermal-state preparation
• On the Sample Complexity of Quantum Boltzmann Machine Learning
• Error Bounds for Variational Quantum Time Evolution
• Continuous-variable assisted thermal quantum simulation
• Variational quantum Gibbs state preparation with a truncated Taylor series
• Variational Approach to Quantum State Tomography based on Maximal Entropy Formalism
• Hybrid quantum-classical algorithms for solving quantum chemistry in Hamiltonian-wavefunction space
• Variational Quantum Algorithms for Trace Distance and Fidelity Estimation
• Binary Classification with Classical Instances and Quantum Labels
• A Quantum Algorithm Framework for Discrete Probability Distributions with Applications to Rényi Entropy Estimation
• Toward a quantum computing algorithm to quantify classical and quantum correlation of system states
• Engineering the Cost Function of a Variational Quantum Algorithm for Implementation on Near-Term Devices
• Efficient Quantum Cooling Algorithm for Fermionic Systems
• Variational post-selection for ground states and thermal states simulation
• Quantum Generative Training Using Rényi Divergences
• Variational Quantum Algorithms for Gibbs State Preparation
• Expressiveness of Commutative Quantum Circuits: A Probabilistic Approach
• Probabilistic imaginary-time evolution by using forward and backward real-time evolution with a single ancilla: first-quantized eigensolver of quantum chemistry for ground states