On Transmitted Complexity Based on Modified Compound States

Based on the classical dynamical entropy, the channel coding theorem is investigated. Attempts to extend the dynamical entropy to quantum systems have been made by several researchers In 1999, Kossakowski, Ohya and I introduced the quantum dynamical entropy (KOW entropy) for completely positive maps containing an automorphism describing the time evolution. Its formulation used transition expectations and lifting in the sense of Accardi and Ohya and was studied as a measure of the complexity of quantum mechanical systems. This KOW entropy allowed the extension of generalized AF (Alicki and Fannes) entropy and generalized AOW (Accardi, Ohya and Watanabe) entropy. In addition, the S-Mixing entropy and S-mixing mutual-entropy were formulated by Ohya in 1985. Compound states are an important tool for formulating mutual entropy, and the complexity was constructed by the generalized AOW entropy. In this paper, the complexity associated with the entangled compound states in the C* dynamical system based on the generalized AOW entropy based on the KOW entropy is investigated to lay the foundation for the proof of the theorem of channel coding for quantum systems. We show that the fundamental inequalities of the mutual entropy are satisfied when the initial state is transmitted over the channel changes with time.