{
  "annotation_id": "f6955ceb-94f5-49d1-9a35-c68134cc33f3",
  "date_created": "2026-03-02T18:01:45.201000Z",
  "date_modified": "2026-03-02T18:01:45.201000Z",
  "file_hash": "aca8b19edb0374a810fdd6ae4e8df97cfccc9fab681784064f5dfbe30b0e582c",
  "private": false,
  "record": {
    "abstract": "The commonly used circuit model of quantum computing leaves out the problems\nof imprecision in the initial state preparation, particle statistics\n(indistinguishability of particles belonging to the same quantum state), and\nerror correction (current techniques cannot correct all small errors). The\ninitial state in the circuit model computation is obtained by applying\npotentially imprecise Hadamard gate operations whereas useful quantum\ncomputation requires a state with no uncertainty. We review some limitations of\nthe circuit model and speculate on the question if a hierarchy of quantum-type\ncomputing models exists.",
    "arxiv_id": "quant-ph/0110040",
    "authors": [
      "Subhash Kak"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "ACM Ubiquity, 7 (11): 1-9, 2006",
    "title": "Are Quantum Computing Models Realistic?",
    "url": "https://arxiv.org/abs/quant-ph/0110040"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "940f48c1-12ff-4c2f-b8a5-26a731fc017e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}