{
  "annotation_id": "0e9d0387-d748-4f7f-8546-918ac2ecdca0",
  "date_created": "2026-03-02T18:01:42.432000Z",
  "date_modified": "2026-03-02T18:01:42.432000Z",
  "file_hash": "317e640cd45ad2e800aacd121948cfd800cc4510abb2a475f2543b117db805c6",
  "private": false,
  "record": {
    "abstract": "We present a general technique to implement products of many qubit operators\ncommunicating via a joint harmonic oscillator degree of freedom in a quantum\ncomputer. By conditional displacements and rotations we can implement\nHamiltonians which are trigonometric functions of qubit operators. With such\noperators we can effectively implement higher order gates such as Toffoli gates\nand C^n-NOT gates, and we show that the entire Grover search algorithm can be\nimplemented in a direct way.",
    "arxiv_id": "quant-ph/0012055",
    "authors": [
      "Xiaoguang Wang",
      "Anders Sorensen",
      "Klaus Molmer"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.86.3907",
    "journal_ref": "Phys. Rev. Lett. 86 (17) (2001)3907-3910.",
    "title": "Multi-bit gates for quantum computing",
    "url": "https://arxiv.org/abs/quant-ph/0012055"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "25ff63c7-05fa-4c00-9b42-9179da6c85d6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}