{
  "annotation_id": "166d1663-9316-48d5-8bc2-d9bf8a0df32b",
  "date_created": "2026-03-02T18:01:56.460000Z",
  "date_modified": "2026-03-02T18:01:56.460000Z",
  "file_hash": "17e2a14d2d462b5f552712771b1a4422e5c5e4f8c61a11b9fa4063b5b20c9ba6",
  "private": false,
  "record": {
    "abstract": "The implementation of a quantum computer requires the realization of a large\nnumber of N-qubit unitary operations which represent the possible oracles or\nwhich are part of the quantum algorithm. Until now there are no standard ways\nto uniformly generate whole classes of N-qubit gates. We have developed a\nmethod to generate arbitrary controlled phase shift operations with a single\nnetwork of one-qubit and two-qubit operations. This kind of network can be\nadapted to various physical implementations of quantum computing and is\nsuitable to realize the Deutsch-Jozsa algorithm as well as Grover\u0027s search\nalgorithm.",
    "arxiv_id": "quant-ph/0303063",
    "authors": [
      "Norbert Schuch",
      "Jens Siewert"
    ],
    "categories": [
      "quant-ph",
      "cond-mat"
    ],
    "doi": "10.1103/PhysRevLett.91.027902",
    "journal_ref": "Phys. Rev. Lett. 91, 027902 (2003)",
    "title": "Programmable networks for quantum algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0303063"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "30c325d2-72d1-4a09-8f92-67b8fadb0d29",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}