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 Dynamics and Its Application to Gaussian Communication Processes

Masanori Ohya, Noboru Watanabe

Published Jan 1, 1993• 1 citation
Publisher
DOI
10.1007/978-94-017-2217-9_25

Related papers

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

A new treatment of communication processes with Gaussian channels

Masanori Ohya, Noboru Watanabe

Japan Journal of Applied Mathematics•Jun 1, 1986•23 citations

ON TREATMENT OF GAUSSIAN COMMUNICATION PROCESS BY QUANTUM ENTROPIES

Noboru Watanabe

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

Quantum Communications with Gaussian and non-Gaussian States of Light

Anthony Leverrier, Franck Ferreyrol, Rémi Blandino +4 more

We describe various quantum communication protocols, using either Gaussian states (for continuous-variable quantum cryptography) or non-Gaussian states (for various applications, including non-deterministic noiseless amplification). Perspectives for deterministic vs non-deterministic quantum information processing will be discussed.

International Conference on Quantum Information•Jan 1, 2011•4 citations

Secure Identification for Gaussian Channels and Identification for Multi-Antenna Gaussian Channels

Wafa Labidi, Christian Deppe, Holger Boche

New applications in modern communications are demanding robust and ultra-reliable low latency information exchange such as machine-to-machine and human-to-machine communications. For many of these applications, the identification approach of Ahlswede and Dueck is much more efficient than the classical message transmission scheme proposed by Shannon. Previous studies concentrate mainly on identification over discrete channels. For discrete channels, it was proved that identification is robust under channels uncertainty. Furthermore, optimal identification schemes that are secure and robust against jamming attacks have been considered. However, no results for continuous channels have yet been established. That is why we focus on the continuous case: the Gaussian channel for its known practical relevance. We deal with secure identification over Gaussian channels. Provable secure communication is of a high interest for future communication systems. A key technique for implementing secure communication is the physical layer security based on information theoretic security. We model this with the wiretap channel. In particular, we provide a suitable coding scheme for the Gaussian wiretap channel (GWC) and determine the corresponding secure identification capacity. We also consider Multiple-Input Multiple-Output (MIMO) Gaussian channels and provide an efficient signal-processing scheme. This scheme allows a separation of signal-processing and Gaussian coding.

arXiv:2011.06443•Nov 12, 2020•3 citations

Note on Complexity of Communication Processes

Noboru Watanabe

Springer proceedings in mathematics & statistics•Jan 1, 2022•0 citations
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.
New applications in modern communications are demanding robust and ultra-reliable low latency information exchange such as machine-to-machine and human-to-machine communications. For many of these applications, the identification approach of Ahlswede and Dueck is much more efficient than the classical message transmission scheme proposed by Shannon. Previous studies concentrate mainly on identification over discrete channels. For discrete channels, it was proved that identification is robust under channels uncertainty. Furthermore, optimal identification schemes that are secure and robust against jamming attacks have been considered. However, no results for continuous channels have yet been established. That is why we focus on the continuous case: the Gaussian channel for its known practical relevance. We deal with secure identification over Gaussian channels. Provable secure communication is of a high interest for future communication systems. A key technique for implementing secure communication is the physical layer security based on information theoretic security. We model this with the wiretap channel. In particular, we provide a suitable coding scheme for the Gaussian wiretap channel (GWC) and determine the corresponding secure identification capacity. We also consider Multiple-Input Multiple-Output (MIMO) Gaussian channels and provide an efficient signal-processing scheme. This scheme allows a separation of signal-processing and Gaussian coding.