Complexity in Dynamics and Computation

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.