Pith. sign in

REVIEW 3 cited by

Quantum Metropolis Sampling via Weak Measurement

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 2406.16023 v1 pith:HPRZQMTN submitted 2024-06-23 quant-ph cs.DS

classification quant-phcs.DS
keywords gibbsquantumalgorithmhamiltonianscorrectmetropolisprovablysamplers
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Gibbs sampling is a crucial computational technique used in physics, statistics, and many other scientific fields. For classical Hamiltonians, the most commonly used Gibbs sampler is the Metropolis algorithm, known for having the Gibbs state as its unique fixed point. For quantum Hamiltonians, designing provably correct Gibbs samplers has been more challenging. [TOV+11] introduced a novel method that uses quantum phase estimation (QPE) and the Marriot-Watrous rewinding technique to mimic the classical Metropolis algorithm for quantum Hamiltonians. The analysis of their algorithm relies upon the use of a boosted and shift-invariant version of QPE which may not exist [CKBG23]. Recent efforts to design quantum Gibbs samplers take a very different approach and are based on simulating Davies generators [CKBG23,CKG23,RWW23,DLL24]. Currently, these are the only provably correct Gibbs samplers for quantum Hamiltonians. We revisit the inspiration for the Metropolis-style algorithm of [TOV+11] and incorporate weak measurement to design a conceptually simple and provably correct quantum Gibbs sampler, with the Gibbs state as its approximate unique fixed point. Our method uses a Boosted QPE which takes the median of multiple runs of QPE, but we do not require the shift-invariant property. In addition, we do not use the Marriott-Watrous rewinding technique which simplifies the algorithm significantly.

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. Super-bath Quantum Eigensolver

    quant-ph 2024-12 conditional novelty 7.0 of 10

    The authors propose the super-bath quantum eigensolver (SQE), a dissipation-based quantum algorithm that prepares ground states with polynomial resources whenever a physical sub-bath exists, and provide a rigorous err...

  2. Performance Model for Hybrid Quantum-Classical Workflows

    quant-ph 2026-07 conditional novelty 6.0 of 10

    A two-level runtime model decomposes hybrid quantum-classical cycles into quantum, classical, and communication time, allowing a communication-to-computation ratio to classify workflows as compute- or communication-bound.

  3. Lindblad engineering for quantum Gibbs state preparation under the eigenstate thermalization hypothesis

    quant-ph 2024-12 conditional novelty 6.0 of 10

    A simplified Lindblad-based Gibbs state preparation protocol with local Pauli jumps is shown to mix polynomially under the eigenstate thermalization hypothesis, with numerical and noise-resilience analysis.

Pith tools