- Full text PDF available (6)
- This year (1)
- Last 5 years (5)
- Last 10 years (12)
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.
A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2 n objects that our algorithm runs in polynomial time.
It is known that Drug Delivery System (DDS) is useful to remedy against tumors for the reduction of side effects and the effective dosage. However the shape, in particular, the size of drug (medicine) is empirically decided in the present stage, which will be related to a question how much medicine should be dosed. Taking a particular reaction of tumor… (More)
We have studied quantum computation for many years, and defined the generalized quantum Turing machine by using completely positive channels and density operators on the Hilbert space. This mathematical model of quantum algorithm gives us the new language classes in which the class NP is included in a polynomial time class. It has also a possibility to… (More)
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 by rewriting usual quantum Turing machine in terms of channel transformation. Moreover, we define some computational classes of generalized quantum… (More)
Ohya and Volovich have been proposed a new quantum computation model with chaos amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper we study the complexity of the SAT algorithm by counting the steps of computation algorithm rigorously, which was mentioned in the paper [1, 2, 3, 5, 7]. For this purpose, we refine… (More)
Ohya and Volovich proposed the polynomial time quantum algorithm to solve SAT problem which is one of NP-complete problems. This algorithm contains effective amplification process, so called a Chaos Amplifie, based on classical Chaotic dynamics. Recently we described this process by the GKSL master equation on two qubits system. In this talk, we introduce… (More)