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:0801.2531 · Mathematische Annalen

Quantum channels that preserve entanglement

William Arveson

Published Sep 23, 2008• 12 citations
arXivHTMLPDF
DOI
10.1007/s00208-008-0288-2

Related papers

Dynamics of quantum entanglement in quantum channels

Shi‐Dong Liang

Quantum Information Processing•Jun 19, 2017•0 citations

Certifying the dimensionality of any quantum channel with minimal assumptions

Saheli Mukherjee, Bivas Mallick, Pratik Ghosal

High-dimensional entanglement offers significant advantages over its low-dimensional counterpart in various information-processing tasks. However, to harness these advantages, it is crucial that the quantum channels used to store or transmit the subsystems of an entangled system not only preserve entanglement but also maintain its dimensionality above a certain threshold. The maximum entanglement dimension that a channel can preserve is referred to as its effective dimensionality, since the channel cannot be used to transmit information of dimension greater than that in a single use. In this work, we present a method to certify whether a quantum channel can preserve entanglement dimension above a given threshold. Unlike existing approaches, our method is faithful, i.e., it can be applied to any channel, and avoids common assumptions such as preparation of entangled states, auxiliary side channels, or perfect measurement devices. Moreover, the method can be extended to faithfully certify other classes of non-resource-breaking channels, such as non-nonpositive-partial-transpose-breaking channels (non-NPT-breaking channels). Finally, we discuss possible experimental realizations of our certification scheme through explicit examples.

quant-pharXiv:2511.10758•Physical Review A•Nov 17, 2025•1 citation

Exact entanglement cost of quantum states and channels under positive-partial-transpose-preserving operations

Xin Wang, Mark M. Wilde

This paper establishes single-letter formulas for the exact entanglement cost of simulating quantum channels under free quantum operations that completely preserve positivity of the partial transpose (PPT). First, we introduce the $\ensuremath{\kappa}$-entanglement measure for point-to-point quantum channels, based on the idea of the $\ensuremath{\kappa}$ entanglement of bipartite states, and we establish several fundamental properties for it, including amortization collapse, monotonicity under PPT superchannels, additivity, normalization, faithfulness, and nonconvexity. Second, we introduce and solve the exact entanglement cost for simulating quantum channels in both the parallel and sequential settings, along with the assistance of free PPT-preserving operations. In particular, we establish that the entanglement cost in both cases is given by the same single-letter formula, the $\ensuremath{\kappa}$-entanglement measure of a quantum channel. We further show that this cost is equal to the largest $\ensuremath{\kappa}$ entanglement that can be shared or generated by the sender and receiver of the channel. This formula is calculable by a semidefinite program, thus allowing for an efficiently computable solution for general quantum channels. Noting that the sequential regime is more powerful than the parallel regime, another notable implication of our result is that both regimes have the same power for exact quantum channel simulation, when PPT superchannels are free. For several basic Gaussian quantum channels, we show that the exact entanglement cost is given by the Holevo-Werner formula [Holevo and Werner, Phys. Rev. A 63, 032312 (2001)], giving an operational meaning of the Holevo-Werner quantity for these channels.

arXiv:1809.09592•Physical Review A•Jan 26, 2023•13 citations

Entanglement-breaking of quantum dynamical channels

Long-Mei Yang, Tao Li, Shao-Ming Fei +1 more

arXiv:1906.01999•Quantum Information Processing•Jun 4, 2019•1 citation

Quantum Entanglement Theory

Michigan State University Press eBooks•Jan 1, 2026•0 citations

Entanglement-saving channels

Ludovico Lami, Vittorio Giovannetti

The set of Entanglement Saving (ES) quantum channels is introduced and characterized. These are completely positive, trace preserving transformations which when acting locally on a bipartite quantum system initially prepared into a maximally entangled configuration, preserve its entanglement even when applied an arbitrary number of times. In other words, a quantum channel ψ is said to be ES if its powers ψn are not entanglement-breaking for all integers n. We also characterize the properties of the Asymptotic Entanglement Saving (AES) maps. These form a proper subset of the ES channels that is constituted by those maps that not only preserve entanglement for all finite n but which also sustain an explicitly not null level of entanglement in the asymptotic limit n → ∞. Structure theorems are provided for ES and for AES maps which yield an almost complete characterization of the former and a full characterization of the latter.

arXiv:1505.00461•Journal of Mathematical Physics•Mar 1, 2016•16 citations
High-dimensional entanglement offers significant advantages over its low-dimensional counterpart in various information-processing tasks. However, to harness these advantages, it is crucial that the quantum channels used to store or transmit the subsystems of an entangled system not only preserve entanglement but also maintain its dimensionality above a certain threshold. The maximum entanglement dimension that a channel can preserve is referred to as its effective dimensionality, since the channel cannot be used to transmit information of dimension greater than that in a single use. In this work, we present a method to certify whether a quantum channel can preserve entanglement dimension above a given threshold. Unlike existing approaches, our method is faithful, i.e., it can be applied to any channel, and avoids common assumptions such as preparation of entangled states, auxiliary side channels, or perfect measurement devices. Moreover, the method can be extended to faithfully certify other classes of non-resource-breaking channels, such as non-nonpositive-partial-transpose-breaking channels (non-NPT-breaking channels). Finally, we discuss possible experimental realizations of our certification scheme through explicit examples.
This paper establishes single-letter formulas for the exact entanglement cost of simulating quantum channels under free quantum operations that completely preserve positivity of the partial transpose (PPT). First, we introduce the $\ensuremath{\kappa}$-entanglement measure for point-to-point quantum channels, based on the idea of the $\ensuremath{\kappa}$ entanglement of bipartite states, and we establish several fundamental properties for it, including amortization collapse, monotonicity under PPT superchannels, additivity, normalization, faithfulness, and nonconvexity. Second, we introduce and solve the exact entanglement cost for simulating quantum channels in both the parallel and sequential settings, along with the assistance of free PPT-preserving operations. In particular, we establish that the entanglement cost in both cases is given by the same single-letter formula, the $\ensuremath{\kappa}$-entanglement measure of a quantum channel. We further show that this cost is equal to the largest $\ensuremath{\kappa}$ entanglement that can be shared or generated by the sender and receiver of the channel. This formula is calculable by a semidefinite program, thus allowing for an efficiently computable solution for general quantum channels. Noting that the sequential regime is more powerful than the parallel regime, another notable implication of our result is that both regimes have the same power for exact quantum channel simulation, when PPT superchannels are free. For several basic Gaussian quantum channels, we show that the exact entanglement cost is given by the Holevo-Werner formula [Holevo and Werner, Phys. Rev. A 63, 032312 (2001)], giving an operational meaning of the Holevo-Werner quantity for these channels.
The set of Entanglement Saving (ES) quantum channels is introduced and characterized. These are completely positive, trace preserving transformations which when acting locally on a bipartite quantum system initially prepared into a maximally entangled configuration, preserve its entanglement even when applied an arbitrary number of times. In other words, a quantum channel ψ is said to be ES if its powers ψn are not entanglement-breaking for all integers n. We also characterize the properties of the Asymptotic Entanglement Saving (AES) maps. These form a proper subset of the ES channels that is constituted by those maps that not only preserve entanglement for all finite n but which also sustain an explicitly not null level of entanglement in the asymptotic limit n → ∞. Structure theorems are provided for ES and for AES maps which yield an almost complete characterization of the former and a full characterization of the latter.