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:1006.4859 · Physical Review A

Information-theoretic treatment of tripartite systems and quantum channels

Patrick J. Coles, Li Zhi Yu, Vlad Gheorghiu, Robert B. Griffiths

Published Jun 30, 2011• 83 citations
arXivHTMLPDF

Abstract

A Holevo measure is used to discuss how much information about a given positive operator valued measure (POVM) on system $a$ is present in another system $b$, and how this influences the presence or absence of information about a different POVM on $a$ in a third system $c$. The main goal is to extend information theorems for mutually unbiased bases or general bases to arbitrary POVMs, and especially to generalize ``all-or-nothing'' theorems about information located in tripartite systems to the case of partial information, in the form of quantitative inequalities. Some of the inequalities can be viewed as entropic uncertainty relations that apply in the presence of quantum side information, as in recent work by Berta et al. [Nature Physics 6, 659 (2010)]. All of the results also apply to quantum channels: For example, if $\mathcal{E}$ accurately transmits certain POVMs, the complementary channel $\mathcal{F}$ will necessarily be noisy for certain other POVMs. While the inequalities are valid for mixed states of tripartite systems, restricting to pure states leads to the basis invariance of the difference between the information about $a$ contained in $b$ and $c$.

DOI
10.1103/physreva.83.062338

Related papers

Channel kets, entangled states, and the location of quantum information

Robert B. Griffiths

The well-known duality relating entangled states and noisy quantum channels is expressed in terms of a channel ket, a pure state on a suitable tripartite system, which functions as a pre-probability allowing the calculation of statistical correlations between, for example, the entrance and exit of a channel, once a framework has been chosen so as to allow a consistent set of probabilities. In each framework the standard notions of ordinary (classical) information theory apply, and it makes sense to ask whether information of a particular sort about one system is or is not present in another system. Quantum effects arise when a single pre-probability is used to compute statistical correlations in different incompatible frameworks, and various constraints on the presence and absence of different kinds of information are expressed in a set of all-or-nothing theorems which generalize or give a precise meaning to the concept of ``no-cloning.'' These theorems are used to discuss the location of information in quantum channels modeled using a mixed-state environment, the classical-quantum channels introduced by Holevo, and the location of information in the physical carriers of a quantum code. It is proposed that both channel and entanglement problems be classified in terms of pure states (functioning as pre-probabilities) on systems of $p\ensuremath{\geqslant}2$ parts, with mixed bipartite entanglement and simple noisy channels belonging to the category $p=3$, a five-qubit code to the category $p=6$, etc., then by the dimensions of the Hilbert spaces of the component parts, along with other criteria yet to be determined.

arXiv:quant-ph/0409106•Physical Review A•Apr 28, 2005•24 citations

Improved tripartite uncertainty relation with quantum memory

Fei Ming, Dong Wang, Xiao‐Gang Fan +3 more

The uncertainty principle is a striking and fundamental feature in quantum mechanics, distinguishing it from classical mechanics. It offers an important lower bound to predict outcomes of two arbitrary incompatible observables measured on a particle. In quantum information theory, this uncertainty principle is popularly formulized in terms of entropy. Here, we present an improvement of the tripartite quantum-memory-assisted entropic uncertainty relation. The uncertainty's lower bound is derived by considering mutual information and the Holevo quantity. It shows that the bound derived by this method will be tighter than the lower bound of Renes and Boileau [Phys. Rev. Lett. 103, 020402 (2009)]. Furthermore, regarding a pair of mutual unbiased bases as the incompatibility, our bound will become extremely tight for the three-qubit $X$-state system, completely coinciding with the entropy-based uncertainty, and can restore Renes and Boileau's bound with respect to arbitrary tripartite pure states. In addition, by applying our lower bound one can attain the tighter bound of the quantum secret key rate, which is of basic importance to enhance the security of quantum key distribution protocols.

arXiv:2004.04356•Physical Review A•Jul 7, 2020•124 citations

Quantum measurements and entropic bounds

Alberto Barchielli, G. Lupieri

While a positive operator valued measure gives the probabilities in a quantum measurement, an instrument gives both the probabilities and the a posteriori states. By interpreting the instrument as a quantum channel and by using the monotonicity theorem for relative entropies many bounds on the classical information extracted in a quantum measurement are obtained in a unified manner. In particular, it is shown that such bounds can all be stated as inequalities between mutual entropies. This approach based on channels gives rise to a unified picture of known and new bounds on the classical information (the bounds by Holevo, by Shumacher, Westmoreland and Wootters, by Hall, by Scutaru, a new upper bound and a new lower one). Some examples clarify the mutual relationships among the various bounds.

arXiv:quant-ph/0505090•Quantum Information and Computation•Jan 1, 2006•12 citations

Quantum Side Information: Uncertainty Relations, Extractors, Channel Simulations

Mario Berta

In the first part of this thesis, we discuss the algebraic approach to classical and quantum physics and develop information theoretic concepts within this setup. In the second part, we discuss the uncertainty principle in quantum mechanics. The principle states that even if we have full classical information about the state of a quantum system, it is impossible to deterministically predict the outcomes of all possible measurements. In comparison, the perspective of a quantum observer allows to have quantum information about the state of a quantum system. This then leads to an interplay between uncertainty and quantum correlations. We provide an information theoretic analysis by discussing entropic uncertainty relations with quantum side information. In the third part, we discuss the concept of randomness extractors. Classical and quantum randomness are an essential resource in information theory, cryptography, and computation. However, most sources of randomness exhibit only weak forms of unpredictability, and the goal of randomness extraction is to convert such weak randomness into (almost) perfect randomness. We discuss various constructions for classical and quantum randomness extractors, and we examine especially the performance of these constructions relative to an observer with quantum side information. In the fourth part, we discuss channel simulations. Shannon's noisy channel theorem can be understood as the use of a noisy channel to simulate a noiseless one. Channel simulations as we want to consider them here are about the reverse problem: simulating noisy channels from noiseless ones. Starting from the purely classical case (the classical reverse Shannon theorem), we develop various kinds of quantum channel simulation results. We achieve this by using classical and quantum randomness extractors that also work with respect to quantum side information.

arXiv:1310.4581•Jan 1, 2013•20 citations

Tighter generalized entropic uncertainty relations in multipartite systems

Lin Wu, Ye Liu, Dong Wang

The uncertainty principle, which demonstrates the intrinsic uncertainty of nature from an information-theory perspective, is at the heart of quantum information theory. In the realm of quantum information theory, Shannon entropy is used to depict the uncertainty relation in general. A tighter lower bound for uncertainty relations facilitates more accurate predictions of measurement outcomes and more robust quantum information processing. Interestingly, the tripartite entropic uncertainty relation (EUR) can be further optimized. Renes et al. proposed a tripartite EUR [J. M. Renes and J.-C. Boileau, Phys. Rev. Lett. 103, 020402 (2009)], and subsequently, Ming et al. strengthened its lower bound in [F. Ming, D. Wang, X.-G. Fan, W.-N. Shi, L. Ye, and J.-L. Chen, Phys. Rev. A 102, 012206 (2020)]. Specifically, we derive a tighter lower bound of the tripartite EUR using the Holevo quantity. Furthermore, we generalize the tripartite EUR, that is, the generalized entropic uncertainty relation for multiple measurements in multipartite systems. As illustrations, we provide several typical examples to show that our bound is tight and outperforms the previous bound. Furthermore, our findings pave the way for using the tighter bound for the quantum secret key rate in quantum key distribution protocols and are essential for quantum precision measurements in the framework of genuine multipartite systems. By providing a close peek at the nature of uncertainty, our results may find broad applications in the security analysis of quantum cryptography.

Physical Review A•Dec 28, 2022•47 citations

Tightening the tripartite quantum-memory-assisted entropic uncertainty relation

Hazhir Dolatkhah, Soroush Haseli, S. Salimi +1 more

The uncertainty principle determines the distinction between the classical and the quantum world. This principle states that it is not possible to measure two incompatible observables with the desired accuracy simultaneously. In quantum information theory, the Shannon entropy is used as an appropriate measure to express the uncertainty relation. Improving the bound of the entropic uncertainty relation is of great importance. The bound can be varied by considering an extra quantum system as the quantum memory which is correlated with the measured quantum system. One can extend the bipartite quantum-memory-assisted entropic uncertainty relation to the tripartite one in which the memory is split into two parts. Here, a lower bound is obtained for the tripartite quantum-memory-assisted entropic uncertainty relation. This lower bound has two extra terms compared with the lower bound in Renes and Boileau [J. M. Renes and J.-C. Boileau, Phys. Rev. Lett. 110, 020402 (2013)] which depends on the conditional von Neumann entropy, the Holevo quantity, and the mutual information. It is shown that the bound is tighter than other bounds derived earlier. It also leads to a lower bound for the quantum secret key rate. In addition, it is applied to obtain the states for which both the strong subadditivity and the Koashi-Winter inequalities turn into equalities.

arXiv:2005.02109•Physical Review A•Nov 30, 2020•42 citations
A Holevo measure is used to discuss how much information about a given positive operator valued measure (POVM) on system aaa is present in another system bbb, and how this influences the presence or absence of information about a different POVM on aaa in a third system ccc. The main goal is to extend information theorems for mutually unbiased bases or general bases to arbitrary POVMs, and especially to generalize ``all-or-nothing'' theorems about information located in tripartite systems to the case of partial information, in the form of quantitative inequalities. Some of the inequalities can be viewed as entropic uncertainty relations that apply in the presence of quantum side information, as in recent work by Berta et al. [Nature Physics 6, 659 (2010)]. All of the results also apply to quantum channels: For example, if E\mathcal{E}E accurately transmits certain POVMs, the complementary channel F\mathcal{F}F will necessarily be noisy for certain other POVMs. While the inequalities are valid for mixed states of tripartite systems, restricting to pure states leads to the basis invariance of the difference between the information about aaa contained in bbb and ccc.
The well-known duality relating entangled states and noisy quantum channels is expressed in terms of a channel ket, a pure state on a suitable tripartite system, which functions as a pre-probability allowing the calculation of statistical correlations between, for example, the entrance and exit of a channel, once a framework has been chosen so as to allow a consistent set of probabilities. In each framework the standard notions of ordinary (classical) information theory apply, and it makes sense to ask whether information of a particular sort about one system is or is not present in another system. Quantum effects arise when a single pre-probability is used to compute statistical correlations in different incompatible frameworks, and various constraints on the presence and absence of different kinds of information are expressed in a set of all-or-nothing theorems which generalize or give a precise meaning to the concept of ``no-cloning.'' These theorems are used to discuss the location of information in quantum channels modeled using a mixed-state environment, the classical-quantum channels introduced by Holevo, and the location of information in the physical carriers of a quantum code. It is proposed that both channel and entanglement problems be classified in terms of pure states (functioning as pre-probabilities) on systems of $p\ensuremath{\geqslant}2$ parts, with mixed bipartite entanglement and simple noisy channels belonging to the category p=3p=3p=3, a five-qubit code to the category p=6p=6p=6, etc., then by the dimensions of the Hilbert spaces of the component parts, along with other criteria yet to be determined.
The uncertainty principle is a striking and fundamental feature in quantum mechanics, distinguishing it from classical mechanics. It offers an important lower bound to predict outcomes of two arbitrary incompatible observables measured on a particle. In quantum information theory, this uncertainty principle is popularly formulized in terms of entropy. Here, we present an improvement of the tripartite quantum-memory-assisted entropic uncertainty relation. The uncertainty's lower bound is derived by considering mutual information and the Holevo quantity. It shows that the bound derived by this method will be tighter than the lower bound of Renes and Boileau [Phys. Rev. Lett. 103, 020402 (2009)]. Furthermore, regarding a pair of mutual unbiased bases as the incompatibility, our bound will become extremely tight for the three-qubit XXX-state system, completely coinciding with the entropy-based uncertainty, and can restore Renes and Boileau's bound with respect to arbitrary tripartite pure states. In addition, by applying our lower bound one can attain the tighter bound of the quantum secret key rate, which is of basic importance to enhance the security of quantum key distribution protocols.
While a positive operator valued measure gives the probabilities in a quantum measurement, an instrument gives both the probabilities and the a posteriori states. By interpreting the instrument as a quantum channel and by using the monotonicity theorem for relative entropies many bounds on the classical information extracted in a quantum measurement are obtained in a unified manner. In particular, it is shown that such bounds can all be stated as inequalities between mutual entropies. This approach based on channels gives rise to a unified picture of known and new bounds on the classical information (the bounds by Holevo, by Shumacher, Westmoreland and Wootters, by Hall, by Scutaru, a new upper bound and a new lower one). Some examples clarify the mutual relationships among the various bounds.
In the first part of this thesis, we discuss the algebraic approach to classical and quantum physics and develop information theoretic concepts within this setup. In the second part, we discuss the uncertainty principle in quantum mechanics. The principle states that even if we have full classical information about the state of a quantum system, it is impossible to deterministically predict the outcomes of all possible measurements. In comparison, the perspective of a quantum observer allows to have quantum information about the state of a quantum system. This then leads to an interplay between uncertainty and quantum correlations. We provide an information theoretic analysis by discussing entropic uncertainty relations with quantum side information. In the third part, we discuss the concept of randomness extractors. Classical and quantum randomness are an essential resource in information theory, cryptography, and computation. However, most sources of randomness exhibit only weak forms of unpredictability, and the goal of randomness extraction is to convert such weak randomness into (almost) perfect randomness. We discuss various constructions for classical and quantum randomness extractors, and we examine especially the performance of these constructions relative to an observer with quantum side information. In the fourth part, we discuss channel simulations. Shannon's noisy channel theorem can be understood as the use of a noisy channel to simulate a noiseless one. Channel simulations as we want to consider them here are about the reverse problem: simulating noisy channels from noiseless ones. Starting from the purely classical case (the classical reverse Shannon theorem), we develop various kinds of quantum channel simulation results. We achieve this by using classical and quantum randomness extractors that also work with respect to quantum side information.
The uncertainty principle, which demonstrates the intrinsic uncertainty of nature from an information-theory perspective, is at the heart of quantum information theory. In the realm of quantum information theory, Shannon entropy is used to depict the uncertainty relation in general. A tighter lower bound for uncertainty relations facilitates more accurate predictions of measurement outcomes and more robust quantum information processing. Interestingly, the tripartite entropic uncertainty relation (EUR) can be further optimized. Renes et al. proposed a tripartite EUR [J. M. Renes and J.-C. Boileau, Phys. Rev. Lett. 103, 020402 (2009)], and subsequently, Ming et al. strengthened its lower bound in [F. Ming, D. Wang, X.-G. Fan, W.-N. Shi, L. Ye, and J.-L. Chen, Phys. Rev. A 102, 012206 (2020)]. Specifically, we derive a tighter lower bound of the tripartite EUR using the Holevo quantity. Furthermore, we generalize the tripartite EUR, that is, the generalized entropic uncertainty relation for multiple measurements in multipartite systems. As illustrations, we provide several typical examples to show that our bound is tight and outperforms the previous bound. Furthermore, our findings pave the way for using the tighter bound for the quantum secret key rate in quantum key distribution protocols and are essential for quantum precision measurements in the framework of genuine multipartite systems. By providing a close peek at the nature of uncertainty, our results may find broad applications in the security analysis of quantum cryptography.
The uncertainty principle determines the distinction between the classical and the quantum world. This principle states that it is not possible to measure two incompatible observables with the desired accuracy simultaneously. In quantum information theory, the Shannon entropy is used as an appropriate measure to express the uncertainty relation. Improving the bound of the entropic uncertainty relation is of great importance. The bound can be varied by considering an extra quantum system as the quantum memory which is correlated with the measured quantum system. One can extend the bipartite quantum-memory-assisted entropic uncertainty relation to the tripartite one in which the memory is split into two parts. Here, a lower bound is obtained for the tripartite quantum-memory-assisted entropic uncertainty relation. This lower bound has two extra terms compared with the lower bound in Renes and Boileau [J. M. Renes and J.-C. Boileau, Phys. Rev. Lett. 110, 020402 (2013)] which depends on the conditional von Neumann entropy, the Holevo quantity, and the mutual information. It is shown that the bound is tighter than other bounds derived earlier. It also leads to a lower bound for the quantum secret key rate. In addition, it is applied to obtain the states for which both the strong subadditivity and the Koashi-Winter inequalities turn into equalities.