Predicting Gibbs-State Expectation Values with Pure Thermal Shadows

Abstract

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 $\mathcal{O}(\log M)$ experimental measurements. Our main insight is that for sufficiently large systems we do not need to prepare the $n$-qubit 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 ten-spin-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.

Fixed a few typos

References in corpus (1)

• Thermal Pure Quantum States of Many-Particle Systems

Cited by in corpus (22)

• Toward Quantum Computing Phase Diagrams of Gauge Theories with Thermal Pure Quantum States
• A Maximum Entropy Principle in Deep Thermalization and in Hilbert-Space Ergodicity
• On the Sample Complexity of Quantum Boltzmann Machine Learning
• Variational Gibbs State Preparation on NISQ devices
• Adaptive variational quantum minimally entangled typical thermal states for finite temperature simulations
• Dissipative variational quantum algorithms for Gibbs state preparation
• Optimising quantum tomography via shadow inversion
• Calculating the many-body density of states on a digital quantum computer
• Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers
• Training Quantum Boltzmann Machines with the $\beta$-Variational Quantum Eigensolver
• Thermal Pure States for Systems with Antiunitary Symmetries and Their Tensor Network Representations
• The topology of data hides in quantum thermal states
• Simulating Floquet scrambling circuits on trapped-ion quantum computers
• Lindblad engineering for quantum Gibbs state preparation under the eigenstate thermalization hypothesis
• Evaluating thermal expectation values by almost ideal sampling with Trotter gates
• Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
• Multi-target quantum compilation algorithm
• Quantum many-body simulation of finite-temperature systems with sampling a series expansion of a quantum imaginary-time evolution
• Gibbs state sampling via cluster expansions
• Variational Quantum Algorithms for Gibbs State Preparation
• Sample complexity of matrix product states at finite temperature
• Quasi-adiabatic thermal ensemble preparation in the thermodynamic limit