Quantum algorithm for SAT problem andquantum mutual entropy

It is von Neumann who opened the window for todayʹs information epoch. He definedquantum entropy including Shannonʹs information more than 20 years ahead of Shannon, and he explained what computation means mathematically. s paper I discuss two problems studied recently by me and my coworkers. One of them concerns a quantum algorithm in a generalized sense solving the SAT problem (one of NP complete problems) and another concerns quantum mutual entropy properly describing quantum communication processes.