DocumentCode
116150
Title
On efficien quantum algorithm using classical amplificatio process
Author
Iriyama, Satoshi ; Ohya, M.
Author_Institution
Dept. of Inf. Sci., Tokyo Univ. of Sci., Noda, Japan
fYear
2014
fDate
18-20 Aug. 2014
Firstpage
88
Lastpage
93
Abstract
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 an efficien quantum algorithm for searching problem using the Chaos Amplifie.
Keywords
computability; computational complexity; quantum computing; GKSL master equation; NP-complete problems; SAT problem; chaos amplifie; classical amplification process; classical chaotic dynamics; polynomial time quantum algorithm; qubits system; Computational complexity; Heuristic algorithms; Logic gates; Quantum computing; Quantum mechanics; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Cognitive Informatics & Cognitive Computing (ICCI*CC), 2014 IEEE 13th International Conference on
Conference_Location
London
Print_ISBN
978-1-4799-6080-4
Type
conf
DOI
10.1109/ICCI-CC.2014.6921446
Filename
6921446
Link To Document