Learn 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)