{
  "annotation_id": "66986e9b-1522-43cc-be8b-c1e3c54f1c38",
  "date_created": "2026-03-02T18:01:38.690000Z",
  "date_modified": "2026-03-02T18:01:38.690000Z",
  "file_hash": "bf0306dd6bf3fae76cc1c99eae6338b5c5d84cec05298f6d9f93871ae83ae64f",
  "private": false,
  "record": {
    "abstract": "An error avoiding quantum code is presented which is capable of stabilizing\nGrover\u0027s quantum search algorithm against a particular class of coherent\nerrors. This error avoiding code consists of states only which are factorizable\nin the computational basis. Furthermore, its redundancy is smaller than the one\nwhich is achievable with a general error correcting quantum code saturating the\nquantum Hamming bound. The fact that this code consists of factorizable states\nonly may offer advantages for the implementation of quantum gates in the error\nfree subspace.",
    "arxiv_id": "quant-ph/0003141",
    "authors": [
      "Michael Mussinger",
      "Aldo Delgado",
      "Gernot Alber"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/1367-2630/2/1/319",
    "title": "Error Avoiding Quantum Codes and Dynamical Stabilization of Grover\u0027s   Algorithm",
    "url": "https://arxiv.org/abs/quant-ph/0003141"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8005b5da-ab62-491f-b471-57a1f5a2f887",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}