Abstract
We have studied a computational complexity of quantum algorithm for several years. A mathematical model of quantum algorithm, which is called a generalized quantum Turing machine(GQTM), is introduced by Ohya et al., and we discussed the relation-ships of language classes denned by it. In this paper, we construct a quantum algorithm for the Pebble Game problem, which belongs to the class EXPTIME(i.e., it requires an exponential size of resources to solve), and discuss the computational complexity of it.
