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/0611253 · Journal of Physics A Mathematical and General

Bounds on action of local quantum channels

Peter Štelmachovič, Vladimír Bužek

Published Jun 15, 2005• 0 citations
arXivHTMLPDF

Abstract

We derive an upper bound on the action of a direct product of two quantum maps (channels) acting on multi-partite quantum states. We assume that the individual channels $Λ_j$ affect single-particle states so, that for an arbitrary input $ρ_j$, the distance $D_j (Λ_j [ ρ_j ], ρ_j)$ between the input $ρ_j$ and the output $Λ_j [ ρ_j ]$ of the channel is less than $ε$. Given this assumption we show that for an arbitrary {\em separable} two-partite state $ρ_{12}$ the distance between the input $ρ_{12}$ and the output $Λ_1\otimesΛ_2[ρ_{12} ]$ fulfills the bound $D_{12} (Λ_1 \otimes Λ_2 [ ρ_{12} ], ρ_{12}) \leq \sqrt{2+ 2 \sqrt{(1-1/d_1)(1-1/d_2)}} ε$ where $d_1$ and $d_2$ are dimensions of first and second quantum system respectively. On the contrary, entangled states are transformed in such a way, that the bound on the action of the local channels is $D_{12} (Λ_1 \otimes Λ_2 [ ρ_{12} ], ρ_{12}) \leq 2 \sqrt{2 - 1/d} \: ε$, where $d$ is the dimension of the smaller of the two quantum systems passing through the channels. Our results show that the fundamental distinction between the set of separable and the set of entangled states results into two different bounds which in turn can be exploited for a discrimination between the two sets of states. We generalize our results to multi-partite channels.

DOI
10.1088/0305-4470/38/26/014

Related papers

Entanglement-induced state ordering under local operations

Mário Ziman, Vladimír Bužek

We analyze how entanglement between two components of a bipartite system behaves under the action of local channels of the form $\mathcal{E}\ensuremath{\bigotimes}\mathcal{I}$. We show that a set of maximally entangled states is by the action of $\mathcal{E}\ensuremath{\bigotimes}\mathcal{I}$ transformed into the set of states that exhibit the same degree of entanglement. Moreover, this degree represents an upper bound on entanglement that is available at the output of the channel irrespective of what the input state of the composite system is. We show that within this bound the entanglement-induced state ordering is ``relative'' and can be changed by the action of local channels. That is, two states ${\ensuremath{\varrho}}_{1}^{(\mathrm{in})}$ and ${\ensuremath{\varrho}}_{2}^{(\mathrm{in})}$ such that the entanglement $E[{\ensuremath{\varrho}}_{1}^{(\mathrm{in})}]$ of the first state is larger than the entanglement $E[{\ensuremath{\varrho}}_{2}^{(\mathrm{in})}]$ of the second state are transformed into states ${\ensuremath{\varrho}}_{1}^{(\mathrm{out})}$ and ${\ensuremath{\varrho}}_{2}^{(\mathrm{out})}$ such that $E[{\ensuremath{\varrho}}_{2}^{(\mathrm{out})}]>E[{\ensuremath{\varrho}}_{1}^{(\mathrm{out})}]$.

arXiv:quant-ph/0510017•Physical Review A•Jan 1, 2006•24 citations

Concurrence versus purity: Influence of local channels on Bell states of two qubits

Mário Ziman, Vladimír Bužek

We analyze how a maximally entangled state of two qubits (e.g., the singlet ${\ensuremath{\psi}}_{s}$) is affected by the action of local channels described by completely positive maps $\mathcal{E}$. We analyze the concurrence and the purity of states ${\ensuremath{\varrho}}_{\mathcal{E}}=\mathcal{E}\ensuremath{\bigotimes}\mathcal{I}[{\ensuremath{\psi}}_{s}]$. Using the concurrence-versus-purity phase diagram we characterize local channels $\mathcal{E}$ by their action on the singlet state ${\ensuremath{\psi}}_{s}$. We specify a region of the concurrence-versus-purity diagram that is achievable from the singlet state via the action of unital channels. We show that even the most general (including nonunital) local channels acting just on a single qubit of the original singlet state cannot generate the maximally entangled mixed states. We study in detail various time evolutions of the original singlet state induced by local Markovian semigroups. We show that the decoherence process is represented in the concurrence-versus-purity diagram by a line that forms the lower bound of the achievable region for unital maps. On the other hand, the depolarization process is represented by a line that forms the upper bound of the region of maps induced by unital maps.

arXiv:quant-ph/0508106•Physical Review A•Nov 22, 2005•56 citations

Axiomatic Approach to Quantum Superchannels

Daly, Pádraig

Quantum superchannels are maps whose input and output are quantum channels. Rather than taking the domain to be the space of all linear maps we motivate and define superchannels on the operator system spanned by quantum channels. Extension theorems for completely positive maps allow us to apply the characterisation theorem for superchannels to this smaller set of maps. These extensions are non unique, showing two different superchannels act the same on all input quantum channels, and so this new definition on the smaller domain captures more precisely the action of superchannels as transformations between quantum channels. The non uniqueness can affect the auxilliary dimension needed for the characterisation as well as the tensor product of the superchannels.

arXiv:2210.00370•Oct 1, 2022•2 citations

Entanglement measures: state ordering vs local operations

Mário Ziman, Vladimír Bužek

A set of all states of a bi-partite quantum system can be divided into subsets each of which contains states with the same degree of entanglement. In this paper we address a question whether local operations (without classical communication) affect the entanglement-induced state ordering. We show that arbitrary unilocal channel (i.e., a channel that acts on one sub-system of a bi-partite system only) might change the ordering for an arbitrary nontrivial measure of entanglement. A slightly weaker result holds for the maximally entangled states. In particular, the maximally entangled states might not remain the most entangled ones at the output of a unilocal noise channel.

arXiv:0707.4401•Jul 30, 2007•7 citations

Entanglement purification via separable superoperators

Eric M. Rains

One of the fundamental concepts of quantum information theory is that of entanglement purification; that is, the transformation of a partially entangled state into a smaller-dimensional, more completely entangled state. Of particular interest are protocols for entanglement purification (EPPs) that alternate purely local operations with one- or two-way classical communication. In the present work, we consider a more general, but simpler, class of transformations, called separable superoperators. Since every EPP is a separable superoperator, bounds on separable superoperators apply as well to EPPs; we use this fact to give a new upper bound on the rate of EPPs on Bell-diagonal states, and thus on the capacity of Bell-diagonal channels.

arXiv:quant-ph/9707002•Jul 1, 1997•114 citations

Entanglement in single-shot quantum channel discrimination

Daniel Puzzuoli

Single-shot quantum channel discrimination is the fundamental task of determining, given only a single use, which of two known quantum channels is acting on a system. In this thesis we investigate the well-known phenomenon that entanglement to an auxiliary system can provide an advantage in this task. In particular, we consider the questions: (1) How much entanglement is in general necessary to achieve an optimal discrimination strategy? (2) What is the maximal advantage provided by entanglement? \n \nGiven a linear map Ψ : L(Cn) → L(Cm), its multiplicity maps are defined as the family of linear maps Ψ ⊗ 1L(Ck) : L(Cn ⊗ Ck) → L(Cm ⊗ Ck), where 1L(Ck) is the identity on L(Ck). Due to the Holevo-Helstrom theorem, the optimal performance using an auxiliary system of dimension k is quantified in terms of the norm of Ψ⊗1L(Ck), where Ψ is a linear map that depends on the parameters of the discrimination problem. Hence, the advantage provided by entanglement is represented in the growth of the norm of Ψ ⊗ 1L(Ck ) with k, a classic phenomenon in the theory of operator algebras. \n \nWe formalize question (1) by investigating, relative to the input and output dimensions of the channels to be discriminated, how large of an auxiliary system is necessary to achieve an optimal strategy. Mathematically, this is connected to when the norm of Ψ ⊗ 1L(Ck) stops growing with k. It is well- known that an auxiliary system of dimension equal to the input is always sufficient to achieve an optimal strategy, and that this is sometimes necessary when the output dimension is at least as large as the input. We prove that, even when the output dimension is arbitrarily small compared to the input, it is still sometimes necessary to use an auxiliary system as large as the input to achieve an optimal strategy. \n \nFor question (2), we investigate, with respect to a fixed input dimension, how large the gap between the optimal performances with and without entanglement can be. Mathematically, this is quantified by the rate of growth of the norm of Ψ ⊗ 1L(Ck ) in k. It is known that matrix transposition has the fastest possible growth, and we prove that it is essentially the unique linear map with this property. We use this to prove that a discrimination problem defined in terms of the Werner-Holevo channels is essentially the unique game satisfying a norm relation that states that the game can be won with certainty using entanglement, but is hard to win without entanglement. \n \nAlong the way, we prove characterizations of the structure of maximal entanglement, as measured according to the entanglement negativity, as well as relative to a large class of entanglement measures. We also give various characterizations of complete trace-norm isometries, and reversible quantum channels.

•Aug 30, 2018•0 citations
We derive an upper bound on the action of a direct product of two quantum maps (channels) acting on multi-partite quantum states. We assume that the individual channels ΛjΛ_jΛj​ affect single-particle states so, that for an arbitrary input ρjρ_jρj​, the distance Dj(Λj[ρj],ρj)D_j (Λ_j [ ρ_j ], ρ_j)Dj​(Λj​[ρj​],ρj​) between the input ρjρ_jρj​ and the output Λj[ρj]Λ_j [ ρ_j ]Λj​[ρj​] of the channel is less than εεε. Given this assumption we show that for an arbitrary {\em separable} two-partite state ρ12ρ_{12}ρ12​ the distance between the input ρ12ρ_{12}ρ12​ and the output Λ1⊗Λ2[ρ12]Λ_1\otimesΛ_2[ρ_{12} ]Λ1​⊗Λ2​[ρ12​] fulfills the bound D12(Λ1⊗Λ2[ρ12],ρ12)≤2+2(1−1/d1)(1−1/d2)εD_{12} (Λ_1 \otimes Λ_2 [ ρ_{12} ], ρ_{12}) \leq \sqrt{2+ 2 \sqrt{(1-1/d_1)(1-1/d_2)}} εD12​(Λ1​⊗Λ2​[ρ12​],ρ12​)≤2+2(1−1/d1​)(1−1/d2​)​​ε where d1d_1d1​ and d2d_2d2​ are dimensions of first and second quantum system respectively. On the contrary, entangled states are transformed in such a way, that the bound on the action of the local channels is D12(Λ1⊗Λ2[ρ12],ρ12)≤22−1/d εD_{12} (Λ_1 \otimes Λ_2 [ ρ_{12} ], ρ_{12}) \leq 2 \sqrt{2 - 1/d} \: εD12​(Λ1​⊗Λ2​[ρ12​],ρ12​)≤22−1/d​ε, where ddd is the dimension of the smaller of the two quantum systems passing through the channels. Our results show that the fundamental distinction between the set of separable and the set of entangled states results into two different bounds which in turn can be exploited for a discrimination between the two sets of states. We generalize our results to multi-partite channels.
We analyze how entanglement between two components of a bipartite system behaves under the action of local channels of the form $\mathcal{E}\ensuremath{\bigotimes}\mathcal{I}$. We show that a set of maximally entangled states is by the action of $\mathcal{E}\ensuremath{\bigotimes}\mathcal{I}$ transformed into the set of states that exhibit the same degree of entanglement. Moreover, this degree represents an upper bound on entanglement that is available at the output of the channel irrespective of what the input state of the composite system is. We show that within this bound the entanglement-induced state ordering is ``relative'' and can be changed by the action of local channels. That is, two states ${\ensuremath{\varrho}}_{1}^{(\mathrm{in})}$ and ${\ensuremath{\varrho}}_{2}^{(\mathrm{in})}$ such that the entanglement $E[{\ensuremath{\varrho}}_{1}^{(\mathrm{in})}]$ of the first state is larger than the entanglement $E[{\ensuremath{\varrho}}_{2}^{(\mathrm{in})}]$ of the second state are transformed into states ${\ensuremath{\varrho}}_{1}^{(\mathrm{out})}$ and ${\ensuremath{\varrho}}_{2}^{(\mathrm{out})}$ such that $E[{\ensuremath{\varrho}}_{2}^{(\mathrm{out})}]>E[{\ensuremath{\varrho}}_{1}^{(\mathrm{out})}]$.
We analyze how a maximally entangled state of two qubits (e.g., the singlet ${\ensuremath{\psi}}_{s}$) is affected by the action of local channels described by completely positive maps E\mathcal{E}E. We analyze the concurrence and the purity of states ${\ensuremath{\varrho}}_{\mathcal{E}}=\mathcal{E}\ensuremath{\bigotimes}\mathcal{I}[{\ensuremath{\psi}}_{s}]$. Using the concurrence-versus-purity phase diagram we characterize local channels E\mathcal{E}E by their action on the singlet state ${\ensuremath{\psi}}_{s}$. We specify a region of the concurrence-versus-purity diagram that is achievable from the singlet state via the action of unital channels. We show that even the most general (including nonunital) local channels acting just on a single qubit of the original singlet state cannot generate the maximally entangled mixed states. We study in detail various time evolutions of the original singlet state induced by local Markovian semigroups. We show that the decoherence process is represented in the concurrence-versus-purity diagram by a line that forms the lower bound of the achievable region for unital maps. On the other hand, the depolarization process is represented by a line that forms the upper bound of the region of maps induced by unital maps.
Quantum superchannels are maps whose input and output are quantum channels. Rather than taking the domain to be the space of all linear maps we motivate and define superchannels on the operator system spanned by quantum channels. Extension theorems for completely positive maps allow us to apply the characterisation theorem for superchannels to this smaller set of maps. These extensions are non unique, showing two different superchannels act the same on all input quantum channels, and so this new definition on the smaller domain captures more precisely the action of superchannels as transformations between quantum channels. The non uniqueness can affect the auxilliary dimension needed for the characterisation as well as the tensor product of the superchannels.
A set of all states of a bi-partite quantum system can be divided into subsets each of which contains states with the same degree of entanglement. In this paper we address a question whether local operations (without classical communication) affect the entanglement-induced state ordering. We show that arbitrary unilocal channel (i.e., a channel that acts on one sub-system of a bi-partite system only) might change the ordering for an arbitrary nontrivial measure of entanglement. A slightly weaker result holds for the maximally entangled states. In particular, the maximally entangled states might not remain the most entangled ones at the output of a unilocal noise channel.
One of the fundamental concepts of quantum information theory is that of entanglement purification; that is, the transformation of a partially entangled state into a smaller-dimensional, more completely entangled state. Of particular interest are protocols for entanglement purification (EPPs) that alternate purely local operations with one- or two-way classical communication. In the present work, we consider a more general, but simpler, class of transformations, called separable superoperators. Since every EPP is a separable superoperator, bounds on separable superoperators apply as well to EPPs; we use this fact to give a new upper bound on the rate of EPPs on Bell-diagonal states, and thus on the capacity of Bell-diagonal channels.
Single-shot quantum channel discrimination is the fundamental task of determining, given only a single use, which of two known quantum channels is acting on a system. In this thesis we investigate the well-known phenomenon that entanglement to an auxiliary system can provide an advantage in this task. In particular, we consider the questions: (1) How much entanglement is in general necessary to achieve an optimal discrimination strategy? (2) What is the maximal advantage provided by entanglement? \n \nGiven a linear map Ψ : L(Cn) → L(Cm), its multiplicity maps are defined as the family of linear maps Ψ ⊗ 1L(Ck) : L(Cn ⊗ Ck) → L(Cm ⊗ Ck), where 1L(Ck) is the identity on L(Ck). Due to the Holevo-Helstrom theorem, the optimal performance using an auxiliary system of dimension k is quantified in terms of the norm of Ψ⊗1L(Ck), where Ψ is a linear map that depends on the parameters of the discrimination problem. Hence, the advantage provided by entanglement is represented in the growth of the norm of Ψ ⊗ 1L(Ck ) with k, a classic phenomenon in the theory of operator algebras. \n \nWe formalize question (1) by investigating, relative to the input and output dimensions of the channels to be discriminated, how large of an auxiliary system is necessary to achieve an optimal strategy. Mathematically, this is connected to when the norm of Ψ ⊗ 1L(Ck) stops growing with k. It is well- known that an auxiliary system of dimension equal to the input is always sufficient to achieve an optimal strategy, and that this is sometimes necessary when the output dimension is at least as large as the input. We prove that, even when the output dimension is arbitrarily small compared to the input, it is still sometimes necessary to use an auxiliary system as large as the input to achieve an optimal strategy. \n \nFor question (2), we investigate, with respect to a fixed input dimension, how large the gap between the optimal performances with and without entanglement can be. Mathematically, this is quantified by the rate of growth of the norm of Ψ ⊗ 1L(Ck ) in k. It is known that matrix transposition has the fastest possible growth, and we prove that it is essentially the unique linear map with this property. We use this to prove that a discrimination problem defined in terms of the Werner-Holevo channels is essentially the unique game satisfying a norm relation that states that the game can be won with certainty using entanglement, but is hard to win without entanglement. \n \nAlong the way, we prove characterizations of the structure of maximal entanglement, as measured according to the entanglement negativity, as well as relative to a large class of entanglement measures. We also give various characterizations of complete trace-norm isometries, and reversible quantum channels.