{
  "annotation_id": "57ff3db2-22a4-44f4-a359-6056ea004d99",
  "date_created": "2026-02-17T05:53:11.897000Z",
  "date_modified": "2026-02-17T05:53:11.897000Z",
  "file_hash": "1e358926b934fffbcaa9e0bb6c0986aefc147398e67f59ac4158ab23449f9b2c",
  "private": false,
  "record": {
    "abstract": "This paper proposes a quantum algorithm for Markov chain spectral gap estimation that is quasi-optimal (i.e., optimal up to a polylogarithmic factor) in the number of vertices for all parameters, and additionally quasi-optimal in the reciprocal of the spectral gap itself, if the permitted relative error is above some critical value. In particular, these results constitute an almost quadratic advantage over the best-possible classical algorithm. Our algorithm also improves on the quantum state of the art, and we contend that this is not just theoretically interesting but also potentially practically impactful in real-world applications: knowing a Markov chain\u0027s spectral gap can speed-up sampling in Markov chain Monte Carlo.\n  Our approach uses the quantum singular value transformation, and as a result we also develop some theory around block-encoding Markov chain transition matrices, which is potentially of independent interest. In particular, we introduce explicit block-encoding methods for the transition matrices of two algebraically-defined classes of Markov chains.",
    "arxiv_id": "2601.07601",
    "authors": [
      "Adam Connolly",
      "Steven Herbert",
      "Julien Sorci"
    ],
    "categories": [
      "quant-ph"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Quasi-optimal quantum Markov chain spectral gap estimation",
    "url": "https://arxiv.org/abs/2601.07601",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f3206049-3507-488b-b1d2-c6189b14dd57",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}