On Halting Process of Quantum Turing Machine

Simple item page
dc.creatorMiyadera, Takayuki
dc.creatorOhya, Masanori
dc.date2003-02-07
dc.date.accessioned2026-07-07T06:25:46Z
dc.date.available2026-07-07T06:25:46Z
dc.descriptionWe prove that there is no algorithm to tell whether an arbitrarily constructed Quantum Turing Machine has same time steps for different branches of computation. We, hence, can not avoid the notion of halting to be probabilistic in Quantum Turing Machine. Our result suggests that halting scheme of Quantum Turing Machine and quantum complexity theory based upon the existing halting scheme sholud be reexamined.
dc.description2 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0302051
dc.identifierhttp://arxiv.org/abs/quant-ph/0302051
dc.identifierOpen Systems and Information Dynamics, Vol.12, No.3 261-264 (2005).
dc.identifierdoi:10.1007/s11080-005-0923-2
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/96924
dc.subjectQuantum Physics
dc.titleOn Halting Process of Quantum Turing Machine
dc.typetext

Files

Collections

arXiv