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

A formulation of Quantum Turing Machine

Ryuichi Sawae, Hiroshi Takeuchi, Tadahito Harima

Published Dec 1, 1995• 0 citations
OpenAlex

Related papers

On the simulation of quantum turing machines

Marco Carpentieri

Theoretical Computer Science•Mar 26, 2003•7 citations

Local Transition Functions of Quantum Turing Machines

Masanao Ozawa, Harumichi Nishimura

Foundations of the notion of quantum Turing machines are investigated. According to Deutsch's formulation, the time evolution of a quantum Turing machine is to be determined by the local transition function. In this paper, the local transition functions are characterized for fully general quantum Turing machines, including multi-tape quantum Turing machines, extending the results due to Bernstein and Vazirani.

arXiv:quant-ph/9811069•RAIRO - Theoretical Informatics and Applications•Sep 1, 2000•41 citations

一般化量子チューリング機械について (情報科学と函数解析の接点 : これまでとこれから)

Satoshi Iriyama, Masanori Ohya

In this paper, we construct a novel model of a universal quantum Turing machine(QTM) which is free from the specific time for an input data and efficiently simulates each step of a given QTM.Deutsch [1] formulated a precise model of a quantum computer as quantum Turing machine (QTM) and proposed a model of universal quantum Turing machine which requires exponential time of $t$ to simulate any other QTM with $t$ steps.Bernstein and Vazirani[2] showed the existence of an efficient universal QTM by slightly modifying Deutsch's model.In [3] several issues related with QTM and universal QTM are discussed.Nishimura and Ozawa gave another

数理解析研究所講究録•Oct 1, 2004•0 citations

Halting of Quantum Turing Machines

Masanao Ozawa

Lecture notes in computer science•Jan 1, 2002•6 citations

On the Halting Problem for Quantum Turing Machines

Masanao Ozawa

Foundations of the theory of quantum Turing machines are investigated.The local transition functions are characterized for fully general quantum Tur- ing machines.Foundational problems on the preparation and the measurement of quantum Turing machines are discussed.The halt scheme, originally proposed by Deutsch, is formulated precisely and is shown to work without spoiling computation.

数理解析研究所講究録•Oct 1, 1998•2 citations

Quantum Turing Machines

Margherita Zorzi

•Jan 1, 2009•1 citation
In this paper, we construct a novel model of a universal quantum Turing machine(QTM) which is free from the specific time for an input data and efficiently simulates each step of a given QTM.Deutsch [1] formulated a precise model of a quantum computer as quantum Turing machine (QTM) and proposed a model of universal quantum Turing machine which requires exponential time of ttt to simulate any other QTM with ttt steps.Bernstein and Vazirani[2] showed the existence of an efficient universal QTM by slightly modifying Deutsch's model.In [3] several issues related with QTM and universal QTM are discussed.Nishimura and Ozawa gave another