On Halting Process of Quantum Turing Machine

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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, 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.
2 pages

Keywords

Quantum Physics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/96924

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/quant-ph/0302051
 http://arxiv.org/abs/quant-ph/0302051
 Open Systems and Information Dynamics, Vol.12, No.3 261-264 (2005).
 doi:10.1007/s11080-005-0923-2

Collections

arXiv