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

AIP conference proceedings

Entropy Type Complexity in Quantum Systems

Noboru Watanabe

Published Jan 1, 2011• 0 citations
Publisher

Abstract

We review a notion of quantum channel and some entropy type complexities for quantum systems. The quantum dynamical entropy for CP map is discussed and numerical computation of this entropy type complexity is accomplished for noisy optical channel.
DOI
10.1063/1.3567449

Related papers

Entropy Type Complexity in Quantum Systems

Noboru Watanabe, Andrei Yu. Khrennikov, Gregg S. Jaeger +2 more

We review a notion of quantum channel and some entropy type complexities for quantum systems. The quantum dynamical entropy for CP map is discussed and numerical computation of this entropy type complexity is accomplished for noisy optical channel.

AIP conference proceedings•Jan 1, 2011•0 citations

On quantum dynamical entropy for open systems

Noboru Watanabe

We review some notions for quantum dynamical entropies. The dynamical entropy of quantum systems is discussed and a numerical computation of the dynamical entropy is carried for the open system dynamics.

International Journal of Quantum Information•Apr 28, 2016•2 citations

Some Aspects of Complexities for Quantum Processes

Noboru Watanabe

In quantum information theory, Emch, Conne, and Stormer were the first who studied the complexity of quantum dynamical processes. After that, Ohya introduced the [Formula: see text]-mixing entropy for general quantum systems and he defined the mean entropy and the mean mutual entropy for quantum dynamical systems based on the [Formula: see text]-mixing entropy. Conne, Narnhoffer and Thirring introduced the dynamical entropy (CNT entropy) and several researchers discussed this concept. Alicki and Fannes defined a different dynamical entropy — AF entropy. In 1995, Voiculescu proposed the dynamical approximation entropy. Accardi, Ohya and Watanabe defined yet another dynamical entropy (AOW entropy) through a quantum Markov process in 1997. In 1999, Kossakowski, Ohya and Watanabe introduced the dynamical entropy (KOW entropy) with respect to completely positive maps. In this paper, we discuss the complexity of quantum dynamical processes to calculate the dynamical entropy for noisy optical channels. In order to discuss the efficiency of information communication processes, a measure of complexity of initial state itself and a measure of transmitted complexity through communication channels are necessary. Quantum entropies were formulated on the basis of the quantum probability theory. In quantum communication systems, von Neumann entropy and Ohya mutual entropy relate to these measures of complexities, respectively. Recently, several mutual entropy type measures (Lindblad-Nielsen entropy and coherent entropy) were defined making use of entropy exchange with respect to a channel and initial state. In this paper, we show which of the measures is the most suitable one for discussing the efficiency of information transmission for quantum processes.

Open Systems & Information Dynamics•Aug 13, 2009•4 citations

ENTROPY TYPE COMPLEXITIES IN QUANTUM DYNAMICAL PROCESSES

Noboru Watanabe

In a study of several systems, we are interested to examine (1) the dynamics of state change and (2) the complexity of states. Ohya introduced in 1991 (ref.[21]) a general idea so-called a Information Dynamics (ID), which constitutes a theory under a frame of the ID by synthesizing the formalities of the investigations of (1) and (2). There are two kind of complexities in ID. One is a complexity of state describing system itself and another is a transmitted complexity between two systems. Entropies of classical and quantum systems are the example of these complexities. In order to treat a flow of dynamics process, dynamical entropies were introduced in not only classical but also quantum systems. The main purpose of this paper is to compare with these mean entropies and the complexities in ID, we calculate these mean entropies for some simple models to discuss the complexity of information transmission for OOK and PSK modulations.

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

QUANTUM DYNAMICAL ENTROPY FOR COMPLETELY POSITIVE MAP

Andrzej Kossakowski, M. Ohya, N. WATANABE

A dynamical entropy for not only shift but also completely positive (CP) map is defined by generalizing the AOW entropy 1 defined through quantum Markov chain and AF entropy defined by a finite operational partition. Our dynamical entropy is numerically computed for several models.

WORLD SCIENTIFIC eBooks•Feb 1, 2008•0 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 quantum information theory, Emch, Conne, and Stormer were the first who studied the complexity of quantum dynamical processes. After that, Ohya introduced the [Formula: see text]-mixing entropy for general quantum systems and he defined the mean entropy and the mean mutual entropy for quantum dynamical systems based on the [Formula: see text]-mixing entropy. Conne, Narnhoffer and Thirring introduced the dynamical entropy (CNT entropy) and several researchers discussed this concept. Alicki and Fannes defined a different dynamical entropy — AF entropy. In 1995, Voiculescu proposed the dynamical approximation entropy. Accardi, Ohya and Watanabe defined yet another dynamical entropy (AOW entropy) through a quantum Markov process in 1997. In 1999, Kossakowski, Ohya and Watanabe introduced the dynamical entropy (KOW entropy) with respect to completely positive maps. In this paper, we discuss the complexity of quantum dynamical processes to calculate the dynamical entropy for noisy optical channels. In order to discuss the efficiency of information communication processes, a measure of complexity of initial state itself and a measure of transmitted complexity through communication channels are necessary. Quantum entropies were formulated on the basis of the quantum probability theory. In quantum communication systems, von Neumann entropy and Ohya mutual entropy relate to these measures of complexities, respectively. Recently, several mutual entropy type measures (Lindblad-Nielsen entropy and coherent entropy) were defined making use of entropy exchange with respect to a channel and initial state. In this paper, we show which of the measures is the most suitable one for discussing the efficiency of information transmission for quantum processes.
In a study of several systems, we are interested to examine (1) the dynamics of state change and (2) the complexity of states. Ohya introduced in 1991 (ref.[21]) a general idea so-called a Information Dynamics (ID), which constitutes a theory under a frame of the ID by synthesizing the formalities of the investigations of (1) and (2). There are two kind of complexities in ID. One is a complexity of state describing system itself and another is a transmitted complexity between two systems. Entropies of classical and quantum systems are the example of these complexities. In order to treat a flow of dynamics process, dynamical entropies were introduced in not only classical but also quantum systems. The main purpose of this paper is to compare with these mean entropies and the complexities in ID, we calculate these mean entropies for some simple models to discuss the complexity of information transmission for OOK and PSK modulations.
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.