{
  "annotation_id": "30c0bff3-6199-456e-904f-4e74e5380ff6",
  "date_created": "2026-03-02T18:01:56.255000Z",
  "date_modified": "2026-03-02T18:01:56.255000Z",
  "file_hash": "c8300ad2a21b7ea646d4b91ccb9f2ac51619172b1817e65583cb227325a9641d",
  "private": false,
  "record": {
    "abstract": "We prove that there is no algorithm to tell whether an arbitrarily\nconstructed Quantum Turing Machine has same time steps for different branches\nof computation. We, hence, can not avoid the notion of halting to be\nprobabilistic in Quantum Turing Machine. Our result suggests that halting\nscheme of Quantum Turing Machine and quantum complexity theory based upon the\nexisting halting scheme sholud be reexamined.",
    "arxiv_id": "quant-ph/0302051",
    "authors": [
      "Takayuki Miyadera",
      "Masanori Ohya"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1007/s11080-005-0923-2",
    "journal_ref": "Open Systems and Information Dynamics, Vol.12, No.3 261-264\n  (2005).",
    "title": "On Halting Process of Quantum Turing Machine",
    "url": "https://arxiv.org/abs/quant-ph/0302051"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d53fb77f-3ec3-4553-b163-cdd6fe8de42a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}