{
  "annotation_id": "580bf9b9-988b-4e13-a7d5-8ee5f1abe431",
  "date_created": "2026-03-02T18:02:06.392000Z",
  "date_modified": "2026-03-02T18:02:06.392000Z",
  "file_hash": "20d44888ad17c7e423566022432dcb1ebd7296a437c94c37b6ae8354d90a54f6",
  "private": false,
  "record": {
    "abstract": "In general, a quantum circuit is constructed with elementary gates, such as\none-qubit gates and CNOT gates. It is possible, however, to speed up the\nexecution time of a given circuit by merging those elementary gates together\ninto larger modules, such that the desired unitary matrix expressing the\nalgorithm is directly implemented. We demonstrate this by taking the two-qubit\nGrover\u0027s algorithm implemented in NMR quantum computation, whose pseudopure\nstate is generated by cyclic permutations of the state populations. This is the\nfirst exact time-optimal solution, to our knowledge, obtained for a\nself-contained quantum algorithm.",
    "arxiv_id": "quant-ph/0405050",
    "authors": [
      "Mikio Nakahara",
      "Yasushi Kondo",
      "Kazuya Hata",
      "Shogo Tanimura"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.70.052319",
    "title": "Demonstrating quantum algorithm acceleration with NMR quantum computer",
    "url": "https://arxiv.org/abs/quant-ph/0405050"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8ffc8c0a-ab88-494e-91e6-c8b0322b3aaf",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}