{
  "annotation_id": "a7b720c1-deb4-4f7b-b1fd-4a3ea603c081",
  "date_created": "2026-03-02T18:01:52.622000Z",
  "date_modified": "2026-03-02T18:01:52.622000Z",
  "file_hash": "e864d6a006cefa478eab0f00d98e76c39bb59a06a388afac3eb74c8066c0a0f5",
  "private": false,
  "record": {
    "abstract": "Among the many proposals for the realization of a quantum computer, holonomic\nquantum computation (HQC) is distinguished from the rest in that it is\ngeometrical in nature and thus expected to be robust against decoherence. Here\nwe analyze the realization of various quantum gates by solving the inverse\nproblem: Given a unitary matrix, we develop a formalism by which we find loops\nin the parameter space generating this matrix as a holonomy. We demonstrate for\nthe first time that such a one-qubit gate as the Hadamard gate and such\ntwo-qubit gates as the CNOT gate, the SWAP gate and the discrete Fourier\ntransformation can be obtained with a single loop.",
    "arxiv_id": "quant-ph/0209015",
    "authors": [
      "Antti O. Niskanen",
      "Mikio Nakahara",
      "Martti M. Salomaa"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.67.012319",
    "title": "Realization of Arbitrary Gates in Holonomic Quantum Computation",
    "url": "https://arxiv.org/abs/quant-ph/0209015"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ddd44e69-2200-4634-bfbf-b213f8ffcac6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}