{
  "annotation_id": "6bf2365a-0cd0-43a9-bf5f-f92992490b27",
  "date_created": "2026-03-02T18:02:30.929000Z",
  "date_modified": "2026-03-02T18:02:30.929000Z",
  "file_hash": "3ea49cc8ce23ac826b2dd573fcc1e66c90a4b0db7aff0611f1f3cb76312bc536",
  "private": false,
  "record": {
    "abstract": "Motivated by algorithmic problems arising in quantum field theories whose\ndynamical variables are geometric in nature, we provide a quantum algorithm\nthat efficiently approximates the colored Jones polynomial. The construction is\nbased on the complete solution of Chern-Simons topological quantum field theory\nand its connection to Wess-Zumino-Witten conformal field theory. The colored\nJones polynomial is expressed as the expectation value of the evolution of the\nq-deformed spin-network quantum automaton. A quantum circuit is constructed\ncapable of simulating the automaton and hence of computing such expectation\nvalue. The latter is efficiently approximated using a standard sampling\nprocedure in quantum computation.",
    "arxiv_id": "quant-ph/0607203",
    "authors": [
      "S. Garnerone",
      "A. Marzuoli",
      "M. Rasetti"
    ],
    "categories": [
      "quant-ph",
      "gr-qc"
    ],
    "doi": "10.1088/1751-8113/40/12/S10",
    "journal_ref": "J.Phys.A40:3047-3066,2007",
    "title": "Quantum geometry and quantum algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0607203"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "04f44d0c-487a-452f-9d55-aa67c49a1d26",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}