{
  "annotation_id": "d25c2789-73cf-4a50-a682-3c769b3d1aa3",
  "date_created": "2026-03-02T18:02:13.460000Z",
  "date_modified": "2026-03-02T18:02:13.460000Z",
  "file_hash": "336e53bde3ad8dd537f76e35b8f8750c661a2d1b415b254035edee2dcef51be7",
  "private": false,
  "record": {
    "abstract": "Recently it has been shown that time-optimal quantum computation is attained\nby using the Cartan decomposition of a unitary matrix. We extend this approach\nby noting that the unitary group is compact. This allows us to reduce the\nexecution time of a quantum algorithm $U_{\\rm alg}$ further by adding an extra\ngate $W$ to it. This gate $W$ sends $U_{\\rm alg}$ to another algorithm $WU_{\\rm\nalg}$ which is executable in a shorter time than $U_{\\rm alg}$. We call this\ntechnique warp-drive. Here we show both theoretically and experimentally that\nthe execution time of Grover\u0027s algorithm is reduced in two-qubit NMR quantum\ncomputer. Warp-drive is potentially a powerful tool in accelerating algorithms\nand reducing the errors in any realization. of a quantum computer",
    "arxiv_id": "quant-ph/0411153",
    "authors": [
      "Mikio Nakahara",
      "Juha J. Vartiainen",
      "Yasushi Kondo",
      "Shogo Tanimura",
      "Kazuya Hata"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Warp-Drive Quantum Computation",
    "url": "https://arxiv.org/abs/quant-ph/0411153"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "596b6a8a-f179-4b97-a9be-c0af151ae71d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}