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 anotherIn 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, 20040 citations

ON GENERALIZED QUANTUM TURING MACHINE AND ITS APPLICATION

Satoshi Iriyama, Masanori Ohya

Quantum Probability and Infinite Dimensional AnalysisJul 1, 20070 citations

On the Computational Power of Quantum Turing Machine

考志三原

数理解析研究所講究録May 1, 19960 citations

A non-recursive universal Quantum turing machine simulation in SequenceL with a post-selection halting scheme

Eric N. Garcia

Many quantum programming languages have been recently introduced to create a new tool for expressing quantum algorithms. However, many have failed to formally express \nthemselves as a universal programming language for quantum computation. In this dissertation, the SequenceL language is shown to be universal in two models of quantum computation, the circuit and machine models. A SequenceL quantum interpreter is developed to show universality in the circuit model. A universal quantum Turing machine (UQTM) is introduced using non-recursive computational laws of the functional language, SequenceL with no explicit recursion. The SequenceL UQTM is implemented \nbased on the rules of Bernstein and Vasari’s UQTM. Bernstein and Vasari’s UQTM definition is expanded to include quantum Turing machine with arbitrary run times. \nFinally, postselection is introduced as a halting scheme for quantum Turing machines.Many quantum programming languages have been recently introduced to create a new tool for expressing quantum algorithms. However, many have failed to formally express \nthemselves as a universal programming language for quantum computation. In this dissertation, the SequenceL language is shown to be universal in two models of quantum computation, the circuit and machine models. A SequenceL quantum interpreter is developed to show universality in the circuit model. A universal quantum Turing machine (UQTM) is introduced using non-recursive computational laws of the functional language, SequenceL with no explicit recursion. The SequenceL UQTM is implemented \nbased on the rules of Bernstein and Vasari’s UQTM. Bernstein and Vasari’s UQTM definition is expanded to include quantum Turing machine with arbitrary run times. \nFinally, postselection is introduced as a halting scheme for quantum Turing machines.

Dec 1, 20100 citations

Halting of Quantum Turing Machines

Masanao Ozawa

Lecture notes in computer scienceJan 1, 20027 citations

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