Pith. sign in

REVIEW 3 cited by

A Variational Quantum Algorithm for Preparing Quantum Gibbs States

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.00055 v1 pith:AUOM7WKB submitted 2020-01-31 quant-ph

classification quant-ph
keywords quantumgibbsstatesapproachpreparingvariationalfurtherpreparation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Towards Minimax Estimation of High-Order Functionals by Quantum Arguments

    quant-ph 2026-07 accept novelty 8.0 of 10

    Quantum-inspired estimators for F_alpha(P) and F_alpha(rho) achieve optimal sample complexity n ~ alpha and minimax MSE rate alpha/n, improving prior O(alpha^2) bounds.

  2. Information-Theoretic Lower Bounds for Approximating Monomials via Optimal Quantum Tsallis Entropy Estimation

    quant-ph 2025-09 conditional novelty 7.0 of 10

    A quantum estimator achieves near-optimal query complexity for integer-order Tsallis entropy, and the same technique yields a new information-theoretic proof that approximating x^n needs polynomials of degree Ω(√n).

  3. Variational quantum thermalizers based on weakly-symmetric nonunitary multi-qubit operations

    quant-ph 2025-02 conditional novelty 6.0 of 10

    A variational quantum thermalizer that alternates unitary gates with weakly-symmetric multi-qubit dissipative operations prepares Gibbs states of spin models with high numerical fidelity at all temperatures.

Pith tools