On Halting Process of Quantum Turing Machine

DOI10.1007/s11080-005-0923-2zbMath1081.81022arXivquant-ph/0302051OpenAlexW2149052326MaRDI QIDQ3368408

Masanori Ohya, Takayuki Miyadera

Publication date: 30 January 2006

Published in: Open Systems & Information Dynamics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0302051

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (3)

Quantum Kolmogorov complexity and information-disturbance theorem ⋮ Quantum circuit oracles for abstract machine computations ⋮ Quantum random access stored-program machines

Cites Work

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Complexity Theory
• Can a Universal Quantum Computer Be Fully Quantum?
• Remarks on universal quantum computer
• Unnamed Item

This page was built for publication: On Halting Process of Quantum Turing Machine