{"paper":{"title":"Quantum algorithms for Gibbs sampling and hitting-time estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anirban Narayan Chowdhury, Rolando D. Somma","submitted_at":"2016-03-09T16:18:32Z","abstract_excerpt":"We present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in $\\sqrt{N \\beta/{\\cal Z}}$ and polynomial in $\\log(1/\\epsilon)$, where $N$ is the Hilbert space dimension, $\\beta$ is the inverse temperature, ${\\cal Z}$ is the partition function, and $\\epsilon$ is the desired precision of the output state. Our quantum algorithm exponentially improves the dependence on $1/\\epsilon$ and quadratically improves the dependence on $\\beta$ of known quantum algorithms for this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02940","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}