{
  "annotation_id": "3d82b25e-a87e-4991-9e66-7d71cdaf263d",
  "date_created": "2026-03-02T18:01:56.444000Z",
  "date_modified": "2026-03-02T18:01:56.444000Z",
  "file_hash": "94a2fa909888496a03881a94c30f04402c8d7068cbfc013e5e85d25bcc7fef4e",
  "private": false,
  "record": {
    "abstract": "We present two methods for the construction of quantum circuits for quantum\nerror-correcting codes (QECC). The underlying quantum systems are tensor\nproducts of subsystems (qudits) of equal dimension which is a prime power. For\na QECC encoding k qudits into n qudits, the resulting quantum circuit has\nO(n(n-k)) gates. The running time of the classical algorithm to compute the\nquantum circuit is O(n(n-k)^2).",
    "arxiv_id": "quant-ph/0211014",
    "authors": [
      "Markus Grassl",
      "Martin Roetteler",
      "Thomas Beth"
    ],
    "categories": [
      "quant-ph",
      "cs.ET"
    ],
    "doi": "10.1142/S0129054103002011",
    "journal_ref": "International Journal of Foundations of Computer Science (IJFCS),\n  Vol. 14, No. 5 (2003), pp. 757-775",
    "title": "Efficient Quantum Circuits for Non-Qubit Quantum Error-Correcting Codes",
    "url": "https://arxiv.org/abs/quant-ph/0211014"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "a4c33b98-54c0-4d24-988a-3f3773062b0b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}