{
  "annotation_id": "19b24170-96c1-4384-a286-b3474bd772b3",
  "date_created": "2026-03-02T18:02:06.590000Z",
  "date_modified": "2026-03-02T18:02:06.590000Z",
  "file_hash": "ac8230d8593f58402abc74fcfd175468e1acada747769e030b7c86d6b721f8fa",
  "private": false,
  "record": {
    "abstract": "We present a genetic algorithm for finding a set of pulse sequences, or\nrotations, for a given quantum logic gate, as implemented by NMR. We\ndemonstrate the utility of the method by showing that shorter sequences than\nhave been previously published can be found for both a CNOT and for the central\npart of Shor\u0027s algorithm (for N=15.) Artificial intelligence techniques like\nthe genetic algorithm here presented have an enormous potential for simplifying\nthe implementation of working quantum computers.",
    "arxiv_id": "quant-ph/0404170",
    "authors": [
      "M. J. Rethinam",
      "A. K. Javali",
      "E. C. Behrman",
      "J. E. Steck",
      "S. R. Skinner"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Paritantra - Journal of Systems Science and Engineering 20, 32-42\n  (2011)",
    "title": "A genetic algorithm for finding pulse sequences for NMR quantum   computing",
    "url": "https://arxiv.org/abs/quant-ph/0404170"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "9cee5043-946b-4c94-ad14-eae2c70730b5",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}