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

Quantum Probability and Infinite Dimensional Analysis

ON GENERALIZED QUANTUM TURING MACHINE AND ITS APPLICATION

Satoshi Iriyama, Masanori Ohya

Published Jul 1, 2007• 0 citations
Publisher
DOI
10.1142/9789812770271_0024

Related papers

REVIEW ON QUANTUM CHAOS ALGORITHM AND GENERALIZED QUANTUM TURING MACHINE

Satoshi Iriyama, Makoto Ohya

Quantum Bio-Informatics•Mar 1, 2008•3 citations

A formulation of Quantum Turing Machine

Ryuichi Sawae, Hiroshi Takeuchi, Tadahito Harima

•Dec 1, 1995•0 citations

GENERALIZED QUANTUM TURING MACHINE AND ITS APPLICATION TO THE SAT CHAOS ALGORITHM

Satoshi Iriyama, Masanori Ohya, Igor Vasil'evich Volovich

Ohya and Volovich have proposed a new quantum computation model with chaotic amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper, we generalize quantum Turing machine, and we show in this general quantum Turing machine (GQTM) that we can treat the Ohya-Volovich (OV) SAT algorithm.

arXiv:quant-ph/0405191•Mar 1, 2006•22 citations

Note on a universal quantum Turing machine

Satoshi Iriyama, Takayuki Miyadera, Masanori Ohya

Physics Letters A•Jun 4, 2008•4 citations

On the simulation of quantum turing machines

Marco Carpentieri

Theoretical Computer Science•Mar 26, 2003•7 citations

COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE

Tirtharaj Dash, Tanistha Nayak

Now-a-days every computing device is based on the Turing Machine. It is known that classical physics is sufficient to explain macroscopic phenomena, but is not to explain microscopic phenomena like the interference of electrons. In these days, speed-up and down-sizing of computing devices have been carried out using quantum physical effects; however, principles of computation on these devices are also based on classical physics. This paper tries to analyze mathematically a possibility that the Universal Quantum Turing Machine (UQTM) is able to compute faster than any other classical models of computation. Basically we focused on comparative study on computation power of Universal Turing Machine (UTM) and UQTM. Namely, in the equal, we tried to show that the UQTM can solve any NP-complete problem in polynomial time. The result analysis showed that UQTM is faster for any computation.

Journal of Global Research in Computer Sciences•Jun 10, 2012•2 citations
Now-a-days every computing device is based on the Turing Machine. It is known that classical physics is sufficient to explain macroscopic phenomena, but is not to explain microscopic phenomena like the interference of electrons. In these days, speed-up and down-sizing of computing devices have been carried out using quantum physical effects; however, principles of computation on these devices are also based on classical physics. This paper tries to analyze mathematically a possibility that the Universal Quantum Turing Machine (UQTM) is able to compute faster than any other classical models of computation. Basically we focused on comparative study on computation power of Universal Turing Machine (UTM) and UQTM. Namely, in the equal, we tried to show that the UQTM can solve any NP-complete problem in polynomial time. The result analysis showed that UQTM is faster for any computation.