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

arXiv:quant-ph/0010041

Entanglement of Formation and Conditional Information Transmission

Robert R. Tucci

Published Oct 10, 2000• 10 citations
arXivHTMLPDF

Abstract

We show that the separability of states in quantum mechanics has a close counterpart in classical physics, and that conditional mutual information (a.k.a. conditional information transmission) is a very useful quantity in the study of both quantum and classical separabilities. We also show how to define entanglement of formation in terms of conditional mutual information. This paper lays the theoretical foundations for a sequel paper which will present a computer program that can calculate a decomposition of any separable quantum or classical state.

DOI
10.48550/arxiv.quant-ph/0010041

Related papers

Quantum Entanglement and Conditional Information Transmission

Robert R. Tucci

We propose a new measure of quantum entanglement. Our measure is defined in terms of conditional information transmission for a Quantum Bayesian Net. We show that our measure is identically equal to the Entanglement of Formation in the case of a bipartite (two listener) system occupying a pure state. In the case of mixed states, the relationship between these two measures is not known yet. We discuss some properties of our measure. Our measure can be easily and naturally generalized to handle n-partite (n-listener) systems. It is non-negative for any n. It vanishes for conditionally separable states with n listeners. It is symmetric under permutations of the n listeners. It decreases if listeners are merged, pruned or removed. Most promising of all, it is intimately connected with the Data Processing Inequalities. We also find a new upper bound for classical mutual information which is of interest in its own right.

arXiv:quant-ph/9909041•Sep 13, 1999•66 citations

A mathematical foundation of quantum information and quantum computer -on quantum mutual entropy and entanglement-

Masanori Ohya

The study of mutual entropy (information) and capacity in classica l system was extensively done after Shannon by several authors like Kolmogor ov and Gelfand. In quantum systems, there have been several definitions of t he mutual entropy for classical input and quantum output. In 1983, the autho r defined the fully quantum mechanical mutual entropy by means of the relati ve entropy of Umegaki, and it has been used to compute the capacity of quant um channel for quantum communication process; quantum input-quantum output. Recently, a correlated state in quantum syatems, so-called quantum entangled state or quantum entanglement, are used to study quntum information, in part icular, quantum computation, quantum teleportation, quantum cryptography. In this paper, we mainly discuss three things below: (1) We point out the di fference between the capacity of quantum channel and that of classical-quant um-classical channel. (2) So far the entangled state is merely defined as a non-separable state, we give a wider definition of the entangled state and c lassify the entangled states into three categories. (3) The quantum mutual e ntropy for an entangled state is discussed. The above (2) and (3) are a join t work with Belavkin.

arXiv:quant-ph/9808051•Aug 26, 1998•6 citations

Entanglement of Distillation and Conditional Mutual Information

Robert R. Tucci

In previous papers, we expressed the Entanglement of Formation in terms of Conditional Mutual Information (CMI). In this brief paper, we express the Entanglement of Distillation in terms of CMI.

arXiv:quant-ph/0202144•Feb 25, 2002•85 citations

Relaxation Method For Calculating Quantum Entanglement

Robert R. Tucci

In a previous paper, we showed how entanglement of formation can be defined as a minimum of the quantum conditional mutual information (a.k.a. quantum conditional information transmission). In classical information theory, the Arimoto-Blahut method is one of the preferred methods for calculating extrema of mutual information. In this paper, we present a new method, akin to the Arimoto-Blahut method, for calculating entanglement of formation. We also present several examples computed with a computer program called Causa Comun that implements the ideas of this paper.

arXiv:quant-ph/0101123•Jan 24, 2001•11 citations

Outlook

Vlatko Vedral

Abstract This book has discussed the foundations of quantum information science as well as the relationship between physics and information theory in general. It has considered the quantum equivalents of the Shannon coding and channel capacity theorems. The von Neumann entropy plays a role analogous to the Shannon entropy, and the Holevo bound is the analogue of Shannon's mutual information used to quantify the capacity of a classical channel. Quantum systems can process information more efficiently than classical systems in a number of different ways. Quantum teleportation and quantum dense coding can be performed using quantum entanglement. Entanglement is an excess of correlations that can exist in quantum physics and is impossible to reproduce classically (with what is termed “separable” states). The book has also demonstrated how to discriminate entangled from separable states using entanglement witnesses, as well as how to quantify entanglement, and looked at quantum computation and quantum algorithms.

•Sep 28, 2006•0 citations

Log-Euclidean Rényi Conditional Mutual Information

Roberto Rubboli, Amir Arqand, Mark M. Wilde

Quantum conditional mutual information (QCMI) is a fundamental measure of conditional independence, with central applications throughout quantum information theory and many-body physics. Despite its importance, finding a fully quantum Rényi generalization that satisfies all desirable structural properties has remained an open question. In this work, we introduce a quantum Rényi conditional mutual information possessing these desirable properties: it is monotone under local quantum channels, additive under tensor products, monotone in the Rényi parameter, and converges to the QCMI in the limit $α\to 1$. We establish bounds on this quantity in terms of relative entropies to the Petz-recovered state, showing that it provides a distinct measure of approximate conditional independence. As a consequence, we derive recovery-based upper and lower bounds on the QCMI in terms of quantum generalizations of the Kullback-Leibler divergence, improving upon the best known results in certain regimes. Finally, we establish bounds in terms of relative entropies to the sets of Markov and separable states and derive Rényi chain rules, which appear to be novel even in the classical setting.

quant-pharXiv:2609.34699•Sep 29, 2026•0 citations
We show that the separability of states in quantum mechanics has a close counterpart in classical physics, and that conditional mutual information (a.k.a. conditional information transmission) is a very useful quantity in the study of both quantum and classical separabilities. We also show how to define entanglement of formation in terms of conditional mutual information. This paper lays the theoretical foundations for a sequel paper which will present a computer program that can calculate a decomposition of any separable quantum or classical state.
We propose a new measure of quantum entanglement. Our measure is defined in terms of conditional information transmission for a Quantum Bayesian Net. We show that our measure is identically equal to the Entanglement of Formation in the case of a bipartite (two listener) system occupying a pure state. In the case of mixed states, the relationship between these two measures is not known yet. We discuss some properties of our measure. Our measure can be easily and naturally generalized to handle n-partite (n-listener) systems. It is non-negative for any n. It vanishes for conditionally separable states with n listeners. It is symmetric under permutations of the n listeners. It decreases if listeners are merged, pruned or removed. Most promising of all, it is intimately connected with the Data Processing Inequalities. We also find a new upper bound for classical mutual information which is of interest in its own right.
The study of mutual entropy (information) and capacity in classica l system was extensively done after Shannon by several authors like Kolmogor ov and Gelfand. In quantum systems, there have been several definitions of t he mutual entropy for classical input and quantum output. In 1983, the autho r defined the fully quantum mechanical mutual entropy by means of the relati ve entropy of Umegaki, and it has been used to compute the capacity of quant um channel for quantum communication process; quantum input-quantum output. Recently, a correlated state in quantum syatems, so-called quantum entangled state or quantum entanglement, are used to study quntum information, in part icular, quantum computation, quantum teleportation, quantum cryptography. In this paper, we mainly discuss three things below: (1) We point out the di fference between the capacity of quantum channel and that of classical-quant um-classical channel. (2) So far the entangled state is merely defined as a non-separable state, we give a wider definition of the entangled state and c lassify the entangled states into three categories. (3) The quantum mutual e ntropy for an entangled state is discussed. The above (2) and (3) are a join t work with Belavkin.
In a previous paper, we showed how entanglement of formation can be defined as a minimum of the quantum conditional mutual information (a.k.a. quantum conditional information transmission). In classical information theory, the Arimoto-Blahut method is one of the preferred methods for calculating extrema of mutual information. In this paper, we present a new method, akin to the Arimoto-Blahut method, for calculating entanglement of formation. We also present several examples computed with a computer program called Causa Comun that implements the ideas of this paper.
Abstract This book has discussed the foundations of quantum information science as well as the relationship between physics and information theory in general. It has considered the quantum equivalents of the Shannon coding and channel capacity theorems. The von Neumann entropy plays a role analogous to the Shannon entropy, and the Holevo bound is the analogue of Shannon's mutual information used to quantify the capacity of a classical channel. Quantum systems can process information more efficiently than classical systems in a number of different ways. Quantum teleportation and quantum dense coding can be performed using quantum entanglement. Entanglement is an excess of correlations that can exist in quantum physics and is impossible to reproduce classically (with what is termed “separable” states). The book has also demonstrated how to discriminate entangled from separable states using entanglement witnesses, as well as how to quantify entanglement, and looked at quantum computation and quantum algorithms.
Quantum conditional mutual information (QCMI) is a fundamental measure of conditional independence, with central applications throughout quantum information theory and many-body physics. Despite its importance, finding a fully quantum Rényi generalization that satisfies all desirable structural properties has remained an open question. In this work, we introduce a quantum Rényi conditional mutual information possessing these desirable properties: it is monotone under local quantum channels, additive under tensor products, monotone in the Rényi parameter, and converges to the QCMI in the limit α→1α\to 1α→1. We establish bounds on this quantity in terms of relative entropies to the Petz-recovered state, showing that it provides a distinct measure of approximate conditional independence. As a consequence, we derive recovery-based upper and lower bounds on the QCMI in terms of quantum generalizations of the Kullback-Leibler divergence, improving upon the best known results in certain regimes. Finally, we establish bounds in terms of relative entropies to the sets of Markov and separable states and derive Rényi chain rules, which appear to be novel even in the classical setting.