Gibbs resampling transitions and structured fast-measurement protocols
Abstract
Quantum Gibbs sampling algorithms generalize classical Markov chain Monte Carlo (cMCMC) methods, and prepare thermal states on quantum computers by implementing local dissipative evolution for a mixing time tmix. Since quantum measurements disrupt the prepared state, the rate of extracting unbiased information from the system depends on the recovery of the underlying thermal correlations. The corresponding ''Gibbs resampling'' time tres is distinct both from tmix and from the autocorrelation time relevant to cMCMC sampling. We study this problem in effective classical models that emulate disruptive quantum measurements of local observables on extensive subsystems. When such subsystems are chosen randomly, in models with non-local order parameters we uncover a ''resampling transition'' as a function of the fraction of sites p that are measured, from tres∝ log L for small p to tres∝ poly L for large p, in systems of linear size L. We argue that this transition is generically absent in systems with local order parameters, and relate this dichotomy to one between the coarsening of initial states that break 1- and 0-form symmetries under Glauber dynamics. Finally, we devise a structured fast-measurement protocol that evades slow resampling even with non-local order parameters, while leaving only a vanishing fraction of all sites unmeasured.
Related
- Information-optimal measurement in operation: From fixed sampling protocols to adaptive spectroscopy
- Measurement-angle control of a continuously monitored quantum oscillator: purification limits and optimal protocols
- Recon?figurable measurement scheme compatible with MDI-QKD and BB84 protocols using single-laser sideband generation
- SpinControl: Control Software for Prototyping and Benchmarking of Spin-Qubit Devices and Measurement Protocols
- Measurement-Only Dynamical Phase Transitions in Spin-1 Chains
BibTeX
@misc{timmers2026gibbs,
title = {{Gibbs resampling transitions and structured fast-measurement protocols}},
author = {Daan Timmers and Benedikt Placke and Siddharth A. Parameswaran},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.22425},
eprint = {2609.22425},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.22425},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Gibbs resampling transitions and structured fast-measurement protocols
AU - Daan Timmers
AU - Benedikt Placke
AU - Siddharth A. Parameswaran
PY - 2026
DA - 2026/09/18
PB - arXiv
DO - 10.48550/arxiv.2609.22425
UR - https://arxiv.org/abs/2609.22425
AB - Quantum Gibbs sampling algorithms generalize classical Markov chain Monte Carlo (cMCMC) methods, and prepare thermal states on quantum computers by implementing local dissipative evolution for a mixing time t_mix. Since quantum measurements disrupt the prepared state, the rate of extracting unbiased information from the system depends on the recovery of the underlying thermal correlations. The corresponding ''Gibbs resampling'' time t_res is distinct both from t_mix and from the autocorrelation time relevant to cMCMC sampling. We study this problem in effective classical models that emulate disruptive quantum measurements of local observables on extensive subsystems. When such subsystems are chosen randomly, in models with non-local order parameters we uncover a ''resampling transition'' as a function of the fraction of sites p that are measured, from t_res∝ log L for small p to t_res∝ poly L for large p, in systems of linear size L. We argue that this transition is generically absent in systems with local order parameters, and relate this dichotomy to one between the coarsening of initial states that break 1- and 0-form symmetries under Glauber dynamics. Finally, we devise a structured fast-measurement protocol that evades slow resampling even with non-local order parameters, while leaving only a vanishing fraction of all sites unmeasured.
ER -