Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Information and Complexity Theory

Osama M. Raisuddin, Suvranu De

Published Nov 14, 2025• 0 citations
Publisher
DOI
10.1007/978-3-032-03325-3_5

Related papers

Quantum Algorithms and Complexity: An Information Theory Perspective

Umesh V. Vazirani

•Oct 2, 2002•0 citations

NOTE ON COMPLEXITIES FOR GAUSSIAN COMMUNICATION PROCESSES

Noboru Watanabe

In order to study several complex systems synthetically, Prof. Ohya introduced a new concept so-called Information Dynamics synthesizing the dynamics of state change and complexity of state. In Information Dynamics, two kind of complexities, that is, a complexity of state of system itself and a transmitted complexity between two systems, are used. In Shannon’s information theory, the effciency of the information communication processes is studied by using Shannon’s entropy and the mutual entropy (information) based on the classical probability theory. These entropies correspond to two complexities in Information Dynamics, respectively. In quantum information theory, one can discuss the effciency of the quantum communication processes using by von Neumann entropy (or S-mixing entropy 8 ) and Ohya mutual entropy. Those entropies are also examples of two complexities of Information Dynamics. An important axiom of complexities in Information Dynamics is given by inequalities of two complexities as follows: “Transmitted complexity with respect to an input state and a communication channel is less than a complexity of the input state.” In Shannon’s information theory, it is called a Shannon’s type inequalities, which shows that the mutual entropy represents the quantity of information exactly sending from the input system to the output system through the communication channel. By the way, for a simple model, the Shannon’s type inequalities do not satisfied in Gaussian communication processes. In Ref. 12, we introduced two complexities under three assumptions to solve this difficulty. In this paper, we propose two complexities under two assumptions by using a equivalent class in order to treat the Gaussian communication processes according to the concept of Information Dynamics.

QP-PQ, quantum probability and white noise analysis•Jan 1, 2013•0 citations

Information Theory

Eduardo Jose Bayro-Corrochano

Springer eBooks•Jan 1, 2024•0 citations

Information theory and dimensions: Enhancing Quantum Mechanics

Bheku Khumalo

This paper seeks to discuss why information theory is so important. What is information, knowledge is interaction of human mind and information, but there is a difference between information theory and knowledge theory. Look into information and particle theory and see how information must have its roots in particle theory. This leads to the concept of spatial dimensions, information density, complexity, particle density, can there be particle complexity, and re-looking at the double slit experiment and quantum tunneling. Information functions/ relations are discussed.

JOURNAL OF ADVANCES IN PHYSICS•Jul 17, 2015•2 citations

Complexity Theory

Jack D. Hidary

Springer eBooks•Jan 1, 2019•2 citations

On complexity of quantum communication processes

Noboru Watanabe

In several complicated systems, it is important to study (1) the dynamics of state change and (2) the complexity of states of systems. Information Dynamics (ID) introduced by Ohya is a general idea constructing a theory by synthesizing the research schemes of (1) and (2) under a frame of the ID. In ID, there are two types of complexities, that is, (a) a complexity of state describing system itself and (b) a transmitted complexity between two systems. Entropies of classical and quantum information theory are the example of the complexities of (a) and (b). In quantum information theory, Ohya introduced a compound state and defined Ohya mutual entropy based on quantum relative entropy of Umegaki in 1983, he extended it to general quantum systems by using the relative entropy of Araki and Uhlmann. One can discuss the coding theorems by means of the mean entropy and the mean mutual entropy defined by the dynamical entropy. In this paper, we will discuss about complexity of quantum communication processes including quantum correlations.

AIP conference proceedings•Jan 1, 2012•1 citation
In order to study several complex systems synthetically, Prof. Ohya introduced a new concept so-called Information Dynamics synthesizing the dynamics of state change and complexity of state. In Information Dynamics, two kind of complexities, that is, a complexity of state of system itself and a transmitted complexity between two systems, are used. In Shannon’s information theory, the effciency of the information communication processes is studied by using Shannon’s entropy and the mutual entropy (information) based on the classical probability theory. These entropies correspond to two complexities in Information Dynamics, respectively. In quantum information theory, one can discuss the effciency of the quantum communication processes using by von Neumann entropy (or S-mixing entropy 8 ) and Ohya mutual entropy. Those entropies are also examples of two complexities of Information Dynamics. An important axiom of complexities in Information Dynamics is given by inequalities of two complexities as follows: “Transmitted complexity with respect to an input state and a communication channel is less than a complexity of the input state.” In Shannon’s information theory, it is called a Shannon’s type inequalities, which shows that the mutual entropy represents the quantity of information exactly sending from the input system to the output system through the communication channel. By the way, for a simple model, the Shannon’s type inequalities do not satisfied in Gaussian communication processes. In Ref. 12, we introduced two complexities under three assumptions to solve this difficulty. In this paper, we propose two complexities under two assumptions by using a equivalent class in order to treat the Gaussian communication processes according to the concept of Information Dynamics.
This paper seeks to discuss why information theory is so important. What is information, knowledge is interaction of human mind and information, but there is a difference between information theory and knowledge theory. Look into information and particle theory and see how information must have its roots in particle theory. This leads to the concept of spatial dimensions, information density, complexity, particle density, can there be particle complexity, and re-looking at the double slit experiment and quantum tunneling. Information functions/ relations are discussed.
In several complicated systems, it is important to study (1) the dynamics of state change and (2) the complexity of states of systems. Information Dynamics (ID) introduced by Ohya is a general idea constructing a theory by synthesizing the research schemes of (1) and (2) under a frame of the ID. In ID, there are two types of complexities, that is, (a) a complexity of state describing system itself and (b) a transmitted complexity between two systems. Entropies of classical and quantum information theory are the example of the complexities of (a) and (b). In quantum information theory, Ohya introduced a compound state and defined Ohya mutual entropy based on quantum relative entropy of Umegaki in 1983, he extended it to general quantum systems by using the relative entropy of Araki and Uhlmann. One can discuss the coding theorems by means of the mean entropy and the mean mutual entropy defined by the dynamical entropy. In this paper, we will discuss about complexity of quantum communication processes including quantum correlations.