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:1906.01999 · Quantum Information Processing

Entanglement-breaking of quantum dynamical channels

Long-Mei Yang, Tao Li, Shao-Ming Fei, Zhi-Xi Wang

Published Jun 4, 2019• 2 citations
arXivHTMLPDF
DOI
10.1007/s11128-019-2349-8

Related papers

Dynamics of quantum entanglement in quantum channels

Shi‐Dong Liang

Quantum Information Processing•Jun 19, 2017•0 citations

Bounds on the breaking time for entanglement-breaking channels

Fattah Sakuldee, Łukasz Rudnicki

Entanglement-breaking channels are quantum channels transforming entangled states to separable states. Despite a detailed discussion of their operational structure, to be found in the literature, studies on dynamical characteristics of this type of maps are yet limited. We consider one of the basic questions: for Lindblad-type dynamics, when does a given channel break entanglement? We discuss the finite-dimensional case where the quantification of entanglement via entanglement witnesses is utilized. For the general setup, we use the method of quantum speed limit to derive lower bounds on entanglement breaking times in terms of an input state, the dynamical map, and the witness operator. Then, with a particular choice of the input state and the entanglement witness, the bounds for the breaking time are turned to solely reflect the characteristics of the dynamics.

arXiv:2209.08689•Physical Review A•Feb 27, 2023•6 citations

Eventually Entanglement Breaking Markovian Dynamics: Structure and Characteristic Times

Eric P. Hanson, Cambyse Rouzé, Daniel Stilck França

Abstract We investigate entanglement breaking times of Markovian evolutions in discrete and continuous time. In continuous time, we characterize which Markovian evolutions are eventually entanglement breaking, that is, evolutions for which there is a finite time after which any entanglement initially present has been destroyed by the noisy evolution. In the discrete-time framework, we consider the entanglement breaking index, that is, the number of times a quantum channel has to be composed with itself before it becomes entanglement breaking. The $$\hbox {PPT}^2$$ PPT2 conjecture is that every PPT quantum channel has an entanglement breaking index of at most 2; we prove that every faithful PPT quantum channel has a finite entanglement breaking index, and more generally, any faithful PPT CP map whose Hilbert–Schmidt adjoint is also faithful is eventually entanglement breaking. We also provide a method to obtain concrete bounds on this index for any faithful quantum channel. To obtain these estimates, we use a notion of robustness of separability to obtain bounds on the radius of the largest separable ball around faithful product states. We also extend the framework of Poincaré inequalities for non-primitive semigroups to the discrete setting to quantify the convergence of quantum semigroups in discrete time, which is of independent interest.

arXiv:1902.08173•Annales Henri Poincaré•Mar 11, 2020•25 citations

Quantum Entanglement Theory

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

Entanglement Breaking Channels in Quantum Information

Katrina Olfert

Quantum channels are central objects of study in quantum information, of which entanglement breaking channels are an interesting subset. Entanglement is considered a fundamental resource and property of quantum mechanics that we can use as a driving force for new theories and to continue research in this area. We exhibit the connection between stochastic matrix theory and the iterative behaviour of entanglement breaking channels and relate the Jordan forms of the entanglement breaking channels and stochastic matrices. We build on this perspective to study the fixed point theory for such channels. We further consider the nullspace structure of entanglement breaking channels, in particular proving that every operator space of trace zero matrices is the nullspace of such a channel. We connect the nullspace of entanglement breaking channels with private subspaces and present examples and discuss connections between quantum privacy and trace zero matrices. Finally, we draw a connection between random unitary channels and entanglement breaking channels.

•Apr 1, 2020•0 citations

Quantum Entanglement and its Applications

Aditi Sen

Current Science•Apr 1, 2017•7 citations
Entanglement-breaking channels are quantum channels transforming entangled states to separable states. Despite a detailed discussion of their operational structure, to be found in the literature, studies on dynamical characteristics of this type of maps are yet limited. We consider one of the basic questions: for Lindblad-type dynamics, when does a given channel break entanglement? We discuss the finite-dimensional case where the quantification of entanglement via entanglement witnesses is utilized. For the general setup, we use the method of quantum speed limit to derive lower bounds on entanglement breaking times in terms of an input state, the dynamical map, and the witness operator. Then, with a particular choice of the input state and the entanglement witness, the bounds for the breaking time are turned to solely reflect the characteristics of the dynamics.
Abstract We investigate entanglement breaking times of Markovian evolutions in discrete and continuous time. In continuous time, we characterize which Markovian evolutions are eventually entanglement breaking, that is, evolutions for which there is a finite time after which any entanglement initially present has been destroyed by the noisy evolution. In the discrete-time framework, we consider the entanglement breaking index, that is, the number of times a quantum channel has to be composed with itself before it becomes entanglement breaking. The PPT2\hbox {PPT}^2PPT2 PPT2 conjecture is that every PPT quantum channel has an entanglement breaking index of at most 2; we prove that every faithful PPT quantum channel has a finite entanglement breaking index, and more generally, any faithful PPT CP map whose Hilbert–Schmidt adjoint is also faithful is eventually entanglement breaking. We also provide a method to obtain concrete bounds on this index for any faithful quantum channel. To obtain these estimates, we use a notion of robustness of separability to obtain bounds on the radius of the largest separable ball around faithful product states. We also extend the framework of Poincaré inequalities for non-primitive semigroups to the discrete setting to quantify the convergence of quantum semigroups in discrete time, which is of independent interest.
Quantum channels are central objects of study in quantum information, of which entanglement breaking channels are an interesting subset. Entanglement is considered a fundamental resource and property of quantum mechanics that we can use as a driving force for new theories and to continue research in this area. We exhibit the connection between stochastic matrix theory and the iterative behaviour of entanglement breaking channels and relate the Jordan forms of the entanglement breaking channels and stochastic matrices. We build on this perspective to study the fixed point theory for such channels. We further consider the nullspace structure of entanglement breaking channels, in particular proving that every operator space of trace zero matrices is the nullspace of such a channel. We connect the nullspace of entanglement breaking channels with private subspaces and present examples and discuss connections between quantum privacy and trace zero matrices. Finally, we draw a connection between random unitary channels and entanglement breaking channels.