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

International Congress on Mathematical Physics (ICMP)

An application of the Lieb-Thirring inequality in quantum information theory

Christopher King

Published Mar 1, 2006• 12 citations
Publisher

Abstract

Quantum information theory has generated several interesting conjectures involving products of completely positive maps on matrix algebras, also known as quantum channels. In particular it is conjectured that the minimal entropy output state from a product channel is always a product state. We show how the Lieb-Thirring inequality can be used to prove this conjecture for one special case, namely when one of the components of the product channel is of the type known as a diagonal channel.

DOI
10.1142/9789812704016_0047

Related papers

An application of a matrix inequality in quantum information theory

Christopher King

Quantum information theory has generated several interesting conjectures involving products of completely positive maps on matrix algebras, also known as quantum channels. In particular it is conjectured that the output state with maximal p-norm from a product channel is always a product state. It is shown here that the Lieb-Thirring inequality can be used to prove this conjecture for one special case, namely when one of the components of the product channel is of the type known as a diagonal channel, which acts on a state by taking the Hadamard product with a positive matrix.

arXiv:quant-ph/0412046•Dec 6, 2004•20 citations

Minimal entropy of states emerging from noisy quantum channels

Christopher King, Mary Beth Ruskai

We consider the minimal entropy of qubit states transmitted through two uses of a noisy quantum channel, which is modeled by the action of a completely positive trace-preserving (or stochastic) map. We provide strong support for the conjecture that this minimal entropy is additive, namely, that the minimum entropy can be achieved when product states are transmitted. Explicitly, we prove that for a tensor product of two unital stochastic maps on qubit states, using an entanglement that involves only states which emerge with minimal entropy cannot decrease the entropy below the minimum achievable using product states. We give a separate argument, based on the geometry of the image of the set of density matrices under stochastic maps, which suggests that the minimal entropy conjecture holds for nonunital as well as for unital maps. We also show that the maximal norm of the output states is multiplicative for most product maps on n-qubit states, including all those for which at least one map is unital. For the class of unital channels on C/sup 2/, we show that additivity of minimal entropy implies that the Holevo (see IEEE Trans. Inform. Theory, vol.44, p.269-73, 1998 and Russian Math. Surv., p.1295-1331, 1999) capacity of the channel is additive over two inputs, achievable with orthogonal states, and equal to the Shannon capacity. This implies that superadditivity of the capacity is possible only for nonunital channels.

arXiv:quant-ph/9911079•IEEE Transactions on Information Theory•Jan 1, 2001•350 citations

Entropy of quantum channel in the theory of quantum information

Wojciech Roga

Quantum channels, also called quantum operations, are linear, trace preserving and completely positive transformations in the space of quantum states. Such operations describe discrete time evolution of an open quantum system interacting with an environment. The thesis contains an analysis of properties of quantum channels and different entropies used to quantify the decoherence introduced into the system by a given operation. Part I of the thesis provides a general introduction to the subject. In Part II, the action of a quantum channel is treated as a process of preparation of a quantum ensemble. The Holevo information associated with this ensemble is shown to be bounded by the entropy exchanged during the preparation process between the initial state and the environment. A relation between the Holevo information and the entropy of an auxiliary matrix consisting of square root fidelities between the elements of the ensemble is proved in some special cases. Weaker bounds on the Holevo information are also established. The entropy of a channel, also called the map entropy, is defined as the entropy of the state corresponding to the channel by the Jamiolkowski isomorphism. In Part III of the thesis, the additivity of the entropy of a channel is proved. The minimal output entropy, which is difficult to compute, is estimated by an entropy of a channel which is much easier to obtain. A class of quantum channels is specified, for which additivity of channel capacity is conjectured. The last part of the thesis contains characterization of Davies channels, which correspond to an interaction of a state with a thermal reservoir in the week coupling limit, under the condition of quantum detailed balance and independence of rotational and dissipative evolutions. The Davies channels are characterized for one-qubit and one-qutrit systems.

arXiv:1108.5065•Aug 25, 2011•2 citations

Quantum Channels and their Minimum Output Entropies

Nathan Mehlhop, William Travis Ogletree

We investigate non-random quantum channels generated from the representation the- ory of orthogonal quantum groups to perform numerical computations for estimates of their minimum output entropies. In doing so, we address the violation of the additiv- ity conjecture for minimum output entropies, previously established through probabilistic proofs. This violation is relevant because given two quantum channels whose minimum output entropies sum to a value greater than the minimum output entropy of their tensor product channel it can be shown that more information can be sent with greater fidelity via the two channels in parallel than by using each separately. This is directly related to the relevance of quantum entanglement in quantum information theory. \nWe numerically compute minimum output entropies for single quantum channels and tensor products of quantum channels with respect to both Von Neumann and Renyi en- tropies. We then proceed to compute entropy estimates for nonplanar channels directly with Temperley-Lieb Category Theory. We conclude by discussing which of our choices for channels are optimal for entangled inputs.

•May 23, 2018•0 citations

The additivity problem for constrained quantum channels

Александр Семенович Холево, Максим Евгеньевич Широков

One of the central problems of quantum information theory [1] is the additivity conjecture for the channel capacity of quantum communication channels [2]–[4]. Recently Shor showed [5] that the validity of this conjecture for all quantum channels was equivalent to a whole series of (super)additivity properties for other important characteristics such as minimal output entropy and entanglementof formation. The present paper introduces the new property of strong additivity (additivity for channels with input constraints) with several equivalent formulations, establishes that it is satisfied for some nontrivial classes of channels and notes that the validity of the additivity conjecture for all channels implies strong additivity. Let H, H′ be finite-dimensional unitary spaces. By a quantum channel we mean a completely positive trace-preserving linear map Φ: B(H) → B(H′), where B(H) is the algebra of all operators on H. In particular, Φ generates an affine map of the convex set S(H) of states (density operators) on the space H into the set S(H′) of states on H′ [1]. The quantum analogue of Shannon’s theorem, established in [4], gives the following expression for the classical channel capacity:

Russian Mathematical Surveys•Apr 30, 2004•0 citations

On quantum channels

Frank Verstraete, Henri Verschelde

One of the most challenging open problems in quantum information theory is to clarify and quantify how entanglement behaves when part of an entangled state is sent through a quantum channel. Of central importance in the description of a quantum channel or completely positive map (CP-map) is the dual state associated to it. The present paper is a collection of well-known, less known and new results on quantum channels, presented in a unified way. We will show how this dual state induces nice characterizations of the extremal maps of the convex set of CP-maps, and how normal forms for states defined on a Hilbert space with a tensor product structure lead to interesting parameterizations of quantum channels.

arXiv:quant-ph/0202124•Feb 21, 2002•63 citations
Quantum information theory has generated several interesting conjectures involving products of completely positive maps on matrix algebras, also known as quantum channels. In particular it is conjectured that the minimal entropy output state from a product channel is always a product state. We show how the Lieb-Thirring inequality can be used to prove this conjecture for one special case, namely when one of the components of the product channel is of the type known as a diagonal channel.
Quantum information theory has generated several interesting conjectures involving products of completely positive maps on matrix algebras, also known as quantum channels. In particular it is conjectured that the output state with maximal p-norm from a product channel is always a product state. It is shown here that the Lieb-Thirring inequality can be used to prove this conjecture for one special case, namely when one of the components of the product channel is of the type known as a diagonal channel, which acts on a state by taking the Hadamard product with a positive matrix.
We consider the minimal entropy of qubit states transmitted through two uses of a noisy quantum channel, which is modeled by the action of a completely positive trace-preserving (or stochastic) map. We provide strong support for the conjecture that this minimal entropy is additive, namely, that the minimum entropy can be achieved when product states are transmitted. Explicitly, we prove that for a tensor product of two unital stochastic maps on qubit states, using an entanglement that involves only states which emerge with minimal entropy cannot decrease the entropy below the minimum achievable using product states. We give a separate argument, based on the geometry of the image of the set of density matrices under stochastic maps, which suggests that the minimal entropy conjecture holds for nonunital as well as for unital maps. We also show that the maximal norm of the output states is multiplicative for most product maps on n-qubit states, including all those for which at least one map is unital. For the class of unital channels on C/sup 2/, we show that additivity of minimal entropy implies that the Holevo (see IEEE Trans. Inform. Theory, vol.44, p.269-73, 1998 and Russian Math. Surv., p.1295-1331, 1999) capacity of the channel is additive over two inputs, achievable with orthogonal states, and equal to the Shannon capacity. This implies that superadditivity of the capacity is possible only for nonunital channels.
Quantum channels, also called quantum operations, are linear, trace preserving and completely positive transformations in the space of quantum states. Such operations describe discrete time evolution of an open quantum system interacting with an environment. The thesis contains an analysis of properties of quantum channels and different entropies used to quantify the decoherence introduced into the system by a given operation. Part I of the thesis provides a general introduction to the subject. In Part II, the action of a quantum channel is treated as a process of preparation of a quantum ensemble. The Holevo information associated with this ensemble is shown to be bounded by the entropy exchanged during the preparation process between the initial state and the environment. A relation between the Holevo information and the entropy of an auxiliary matrix consisting of square root fidelities between the elements of the ensemble is proved in some special cases. Weaker bounds on the Holevo information are also established. The entropy of a channel, also called the map entropy, is defined as the entropy of the state corresponding to the channel by the Jamiolkowski isomorphism. In Part III of the thesis, the additivity of the entropy of a channel is proved. The minimal output entropy, which is difficult to compute, is estimated by an entropy of a channel which is much easier to obtain. A class of quantum channels is specified, for which additivity of channel capacity is conjectured. The last part of the thesis contains characterization of Davies channels, which correspond to an interaction of a state with a thermal reservoir in the week coupling limit, under the condition of quantum detailed balance and independence of rotational and dissipative evolutions. The Davies channels are characterized for one-qubit and one-qutrit systems.
We investigate non-random quantum channels generated from the representation the- ory of orthogonal quantum groups to perform numerical computations for estimates of their minimum output entropies. In doing so, we address the violation of the additiv- ity conjecture for minimum output entropies, previously established through probabilistic proofs. This violation is relevant because given two quantum channels whose minimum output entropies sum to a value greater than the minimum output entropy of their tensor product channel it can be shown that more information can be sent with greater fidelity via the two channels in parallel than by using each separately. This is directly related to the relevance of quantum entanglement in quantum information theory. \nWe numerically compute minimum output entropies for single quantum channels and tensor products of quantum channels with respect to both Von Neumann and Renyi en- tropies. We then proceed to compute entropy estimates for nonplanar channels directly with Temperley-Lieb Category Theory. We conclude by discussing which of our choices for channels are optimal for entangled inputs.
One of the central problems of quantum information theory [1] is the additivity conjecture for the channel capacity of quantum communication channels [2]–[4]. Recently Shor showed [5] that the validity of this conjecture for all quantum channels was equivalent to a whole series of (super)additivity properties for other important characteristics such as minimal output entropy and entanglementof formation. The present paper introduces the new property of strong additivity (additivity for channels with input constraints) with several equivalent formulations, establishes that it is satisfied for some nontrivial classes of channels and notes that the validity of the additivity conjecture for all channels implies strong additivity. Let H, H′ be finite-dimensional unitary spaces. By a quantum channel we mean a completely positive trace-preserving linear map Φ: B(H) → B(H′), where B(H) is the algebra of all operators on H. In particular, Φ generates an affine map of the convex set S(H) of states (density operators) on the space H into the set S(H′) of states on H′ [1]. The quantum analogue of Shannon’s theorem, established in [4], gives the following expression for the classical channel capacity:
One of the most challenging open problems in quantum information theory is to clarify and quantify how entanglement behaves when part of an entangled state is sent through a quantum channel. Of central importance in the description of a quantum channel or completely positive map (CP-map) is the dual state associated to it. The present paper is a collection of well-known, less known and new results on quantum channels, presented in a unified way. We will show how this dual state induces nice characterizations of the extremal maps of the convex set of CP-maps, and how normal forms for states defined on a Hilbert space with a tensor product structure lead to interesting parameterizations of quantum channels.