{
  "annotation_id": "cf254658-9102-4af8-8f8f-161e8a95dfb1",
  "date_created": "2026-03-02T18:02:47.442000Z",
  "date_modified": "2026-03-02T18:02:47.442000Z",
  "file_hash": "770ea63b08e87a3cb4989d13ccf7386cae43e07289ea444a61b00ecc7b1242cf",
  "private": false,
  "record": {
    "abstract": "Typical quantum computing schemes require transformations (gates) to be\ntargeted at specific elements (qubits). In many physical systems, direct\ntargeting is difficult to achieve; an alternative is to encode local gates into\nglobally applied transformations. Here we demonstrate the minimum physical\nrequirements for such an approach: a one-dimensional array composed of two\nalternating \u0027types\u0027 of two-state system. Each system need be sensitive only to\nthe net state of its nearest neighbors, i.e. the number in state 1 minus the\nnumber in state 2. Additionally, we show that all such arrays can perform quite\ngeneral parallel operations. A broad range of physical systems and interactions\nare suitable: we highlight two potential implementations.",
    "arxiv_id": "quant-ph/9909007",
    "authors": [
      "S. C. Benjamin"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.61.020301",
    "title": "Schemes for Parallel Quantum Computation Without Local Control of Qubits",
    "url": "https://arxiv.org/abs/quant-ph/9909007"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "09d417f8-3434-4bfb-8ab5-46cc561efe1d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}