Halting of Quantum Turing Machines

Authors:
Masanao Ozawa
Affiliations:
-
Venue:
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Year:
2002

Citing 3
Cited 1

Quantum Complexity Theory

SIAM Journal on Computing
Computational complexity of uniform quantum circuit families and quantum Turing machines

Theoretical Computer Science
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The notion of a quantum Turing machine (QTM) is well established as a mathematical model. However, the difficulty on halting procedures has prevented us from formulating the notion of computing on an arbitrary quantum Turing machine. Here, an argument is outlined to show that any QTM can be efficiently simulated by a QTM with well-behaved halting flag. Thus, we can affirmatively solve the halting problem for QTMs.