{
  "annotation_id": "9206aa87-ea28-4319-845d-e6947f896f42",
  "date_created": "2026-03-02T18:02:48.472000Z",
  "date_modified": "2026-03-02T18:02:48.472000Z",
  "file_hash": "2dfb0200b47d34a030098b7e86242b7b4534ca587188980f597820fe684bd14f",
  "private": false,
  "record": {
    "abstract": "We prove that quantum computation is polynomially equivalent to classical\nprobabilistic computation with an oracle for estimating the value of simple\nsums, quadratically signed weight enumerators. The problem of estimating these\nsums can be cast in terms of promise problems and has two interesting variants.\nAn oracle for the unconstrained variant may be more powerful than quantum\ncomputation, while an oracle for a more constrained variant is efficiently\nsolvable in the one-bit model of quantum computation. Thus, problems involving\nestimation of quadratically signed weight enumerators yield problems in BQP\n(bounded error quantum polynomial time) that are distinct from the ones studied\nso far, include a canonical BQP complete problem, and can be used to define and\nstudy complexity classes and their relationships to quantum computation.",
    "arxiv_id": "quant-ph/9909094",
    "authors": [
      "E. Knill",
      "R. Laflamme"
    ],
    "categories": [
      "quant-ph",
      "cs.CC"
    ],
    "title": "Quantum Computation and Quadratically Signed Weight Enumerators",
    "url": "https://arxiv.org/abs/quant-ph/9909094"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "49e2ee7b-11d6-4f17-b944-f5dea00e6e3b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}