{
  "abstract": "We prove the first quantum-classical separation for a sampling problem over a continuous domain. For a class of Gibbs states $p\\propto e^{-βE}$ on the torus $\\mathbb{T}^d$ with smooth ($s$-Gevrey) potential and barrier amplitude $α=e^{βΔ}$, where $Δ= \\max E-\\min E$, every classical algorithm querying the value, gradient, or any higher-order derivatives of the log-density requires $Ω(α)$ queries to sample at constant accuracy in total variation distance, while a quantum algorithm based on quantum singular value thresholding and temperature annealing samples with $\\tilde{O}\\left(\\sqrtα\\right)$ queries to an oracle for the gradient. The advantage is quadratic in the barrier amplitude, which becomes exponential in the dimension, $e^{Ω(d)}$, at low temperature. The classical bound is information-theoretic, holding for every classical algorithm with query access to the Gibbs potential and its derivatives at any order.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2608.24527",
  "author_total": 7,
  "authors": [
    {
      "name": "Enrico Olivucci"
    },
    {
      "name": "Mariia Sobchuk"
    },
    {
      "name": "Sehmimul Hoque"
    },
    {
      "name": "Jeffrey Hnybida"
    },
    {
      "name": "Kyungho W. Kim"
    },
    {
      "name": "Ala Shayeghi"
    },
    {
      "name": "Pooya Ronagh"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/7aaaht0jyb9b2.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2608.24527",
  "fulltext_url": null,
  "id": "7aaaht0jyb9b2",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2608.24527",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.DS"
    ],
    [
      "arxiv",
      "cs.ET"
    ],
    [
      "arxiv",
      "cs.LG"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7204277413",
  "pdf_url": "https://arxiv.org/pdf/2608.24527",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-25",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/7aaaht0jyb9b2.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:24:52Z",
      "native_id": "2608.24527",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2608.24527"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Provable Quantum-Classical Separation for Continuous Gibbs Sampling",
  "title_text": "Provable Quantum-Classical Separation for Continuous Gibbs Sampling",
  "type": "preprint",
  "updated_at": "2026-10-30T12:24:52Z",
  "url": "https://research.draconitic.com/paper/7aaaht0jyb9b2",
  "venue": "arXiv",
  "versions": []
}