{
  "annotation_id": "142a226b-5dca-40b6-92b5-46cf1726b6b8",
  "date_created": "2026-03-02T18:02:09.662000Z",
  "date_modified": "2026-03-02T18:02:09.662000Z",
  "file_hash": "a873a72d1a7a410a123c0bfec16093e1c320fea68162ac36cb4716ce07ac1cf5",
  "private": false,
  "record": {
    "abstract": "What is the computational power of a quantum computer? We show that\ndetermining the output of a quantum computation is equivalent to counting the\nnumber of solutions to an easily computed set of polynomials defined over the\nfinite field Z_2. This connection allows simple proofs to be given for two\nknown relationships between quantum and classical complexity classes.",
    "arxiv_id": "quant-ph/0408129",
    "authors": [
      "Christopher M. Dawson",
      "Henry L. Haselgrove",
      "Andrew P. Hines",
      "Duncan Mortimer",
      "Michael A. Nielsen",
      "Tobias J. Osborne"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Quantum Information and Computation, vol. 5 (2), pp.102-112 (2005)",
    "title": "Quantum computing and polynomial equations over the finite field Z_2",
    "url": "https://arxiv.org/abs/quant-ph/0408129"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b70d4b92-f0e3-4790-a711-feb29f5630a5",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}