On Halting Process of Quantum Turing Machine

Authors:
Takayuki Miyadera;Masanori Ohya
Affiliations:
Aff1 Aff2;Department of Information Sciences, Tokyo University of Science, Noda City, Japan 278-8510
Venue:
Open Systems & Information Dynamics
Year:
2005

Citing 2
Cited 2

Quantum Complexity Theory

SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing

Classically controlled quantum computation

Mathematical Structures in Computer Science
Quantum circuit oracles for Abstract Machine computations

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.