arXiv (All)
open access
Accelerating quantum Gibbs sampling without quantum walks
Szegedy's quantum walk quadratically accelerates reversible classical Markov chains, but extending this mechanism to efficiently implementable quantum Gibbs samplers has remained challenging beyond special classes. We present a walk-free quantum algorithm for preparing purified Gibbs states with a q
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
- Efficient thermalization and universal quantum computing with quantum Gibbs samplers#149162
- GRPO-QPS: Target-Preserving Reinforcement Learning for Quantum Posterior Sampling#1051496
- Technical analysis of the Resource-efficient Quantum Walkers Quantum Random Access Memory#1145187
- Recursive Quantum Long Short-Term Memory for Stable Short-Horizon Temperature Forecasting#1034404
- Recursive Quantum Long Short-Term Memory for Stable Short-Horizon Temperature Forecasting#978427
Record · ID 1155175
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