Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Halting of Quantum Turing Machines

Masanao Ozawa

Published Jan 1, 2002• 7 citations
Publisher
DOI
10.1007/3-540-45833-6_6

Related papers

On the Halting Problem for Quantum Turing Machines

正直 小澤

数理解析研究所講究録•Oct 1, 1998•0 citations

On a class of quantum Turing machine halting deterministically

Min Liang, Li Yang

Science China Physics Mechanics and Astronomy•Apr 18, 2013•1 citation

Quantum Turing Machines

Margherita Zorzi

•Jan 1, 2009•0 citations

Quantum Turing Machines: Local Transition, Preparation, Measurement, and Halting

Masanao Ozawa

Foundations of the theory of quantum Turing machines are investigated. The protocol for the preparation and the measurement of quantum Turing machines is discussed. The local transition functions are characterized for fully general quantum Turing machines. A new halting protocol is proposed without augmenting the halting qubit and is shown to work without spoiling the computation.

arXiv:quant-ph/9809038•Kluwer Academic Publishers eBooks•Dec 19, 2005•11 citations

On Halting Process of Quantum Turing Machine

Takayuki Miyadera, Masanori Ohya

We 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, cannot avoid the notion of halting to be probabilistic in Quantum Turing Machine.

arXiv:quant-ph/0302051•Open Systems & Information Dynamics•Aug 24, 2005•27 citations

On the simulation of quantum turing machines

Marco Carpentieri

Theoretical Computer Science•Mar 26, 2003•7 citations