{
  "annotation_id": "94d0cf13-b47d-4dfc-beb5-a1f1488e3360",
  "date_created": "2026-03-02T18:01:59.595000Z",
  "date_modified": "2026-03-02T18:01:59.595000Z",
  "file_hash": "31910dd646f8268c43abaec98693bafe5a1fe172fecf02894bfcdb39be26fe4e",
  "private": false,
  "record": {
    "abstract": "We discuss the performance of the Search and Fourier Transform algorithms on\na hybrid computer constituted of classical and quantum processors working\ntogether. We show that this semi-quantum computer would be an improvement over\na pure classical architecture, no matter how few qubits are available and,\ntherefore, it suggests an easier implementable technology than a pure quantum\ncomputer with arbitrary number of qubits.",
    "arxiv_id": "quant-ph/0304085",
    "authors": [
      "Reinaldo O. Vianna",
      "Wilson R. M. Rabelo",
      "C. H. Monken"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "International Journal of Quantum Information, Volume 1, Number 2,\n  june 2003, pp 279-288",
    "title": "The Semi-Quantum Computer",
    "url": "https://arxiv.org/abs/quant-ph/0304085"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8109be42-2b79-4c1e-bd18-029e1e21fc86",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}