arXiv (All)
open access
Gibbs resampling transitions and structured fast-measurement protocols
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_{\rm mix}$. Since quantum measurements disrupt the prepared state, the rate of extracting
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Trade-off between Cooling-Step Count and Geometric Implementation Cost in Non-Markovian Algorithmic Cooling#818716
- Trade-off between Cooling-Step Count and Geometric Implementation Cost in Non-Markovian Algorithmic Cooling#808724
- Nonperturbative Computation of Thermal Conductivity Based on Path Integral Monte Carlo Methods#1079354
- Nonperturbative computation of thermal conductivity based on Path Integral Monte Carlo methods#1052097
- Quantum Quasi-Monte Carlo: a window for pre-asymptotic quantum advantage#926527
Record · ID 1037108
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive