caa a22 4500 47583920X CHVBK 20180406123857.0 cr unu---uuuuu 170329e20000901xx s 000 0 eng 10.1023/A:1010767818228 doi (NATIONALLICENCE)springer-10.1023/A:1010767818228 Ohya Masanori Department of Information Sciences, Science University of Tokyo, 278, Noda City, Chiba, Japan aut Complexity in Dynamics and Computation [Elektronische Daten] [Masanori Ohya] A new description of chaos in both classical and quantum dynamical systems is discussed in the context of information dynamics, which is called the chaos degree. The algorithm computing this degree is shown. Quantum algorithm solving the SAT problem, on of the NP complete problems, is studied and it is discussed that the SAT problem can be solved in polynomial time when a certain mixture of two orthogonal vectors is physically detected. Kluwer Academic Publishers, 2000 complexity nationallicence information dynamics nationallicence chaos degree nationallicence SAT problem nationallicence quantum algorithm nationallicence Acta Applicandae Mathematica Kluwer Academic Publishers 63/1-3(2000-09-01), 293-306 0167-8019 63:1-3<293 2000 63 10440 https://doi.org/10.1023/A:1010767818228 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1023/A:1010767818228 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Ohya Masanori Department of Information Sciences, Science University of Tokyo, 278, Noda City, Chiba, Japan aut NATIONALLICENCE 773 0- Acta Applicandae Mathematica Kluwer Academic Publishers 63/1-3(2000-09-01), 293-306 0167-8019 63:1-3<293 2000 63 10440 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer