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:2609.24168

A complete characterization of eventually entanglement breaking unital quantum channels

B. V. Rajarama Bhat, Pankaj Dey, Biswarup Saha

math.OAmath-phmath.FAquant-phSubmitted Sep 21, 2026• Announced Sep 22, 2026• 0 citations
arXivHTMLPDF

Abstract

We obtain a complete characterization of eventually entanglement breaking (EEB) unital channels in terms of some simple commutation properties of their eigenvectors. Specifically, the following properties are equivalent for a unital channel: (i) it is EEB; (ii) it is eventually positive partial transpose (PPT); (iii) it is eventually mixed twisted dephasing; and (iv) its eigenvectors corresponding to non-zero eigenvalues commute with all its peripheral eigenvectors. Similar results hold for one-parameter semigroups of unital quantum channels, where continuity forces such semigroups to become primitive. We employ a matrix integral technique inspired by a result of Watrous. We also characterize the extreme points of the convex set of unital EB channels and, using this characterization and the theory of equiangular tight frames (ETFs), identify several extreme points beyond the twisted dephasing channels.

Comments
32 pages and 2 figures. Comments are welcome

Related papers

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 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.

•Sep 30, 2019•12 citations

Eventually entanglement breaking divisible quantum dynamics

Krzysztof Szczygielski, Dariusz Chruściński

Abstract It is shown that a large class of quantum dynamical maps on complex matrix algebras governed by time-local Master Equations tend to become entanglement breaking in the course of time. Such situation seems to be generic for quantum evolution and in particular, completely positive dynamical semigroups with a unique faithful stationary state enjoy this property. Inspired by this observation, we propose a new concept of eventually entanglement breaking divisible (eEB-divisible) dynamics. A dynamical map is eEB-divisible if any propagator becomes entanglement breaking in finite time. It turns out that eEB-divisibility is quite general and holds for a large class of quantum evolutions.

arXiv:2407.16583•Journal of Physics A Mathematical and Theoretical•Nov 15, 2024•2 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•16 citations

Eventually entanglement breaking maps

Mizanur Rahaman, Samuel Jaques, Vern I. Paulsen

We analyze linear maps on matrix algebras that become entanglement breaking after composing a finite or infinite number of times with themselves. This means that the Choi matrix of the iterated linear map becomes separable in the tensor product space. If a linear map becomes entanglement breaking after finitely many iterations, we say that the map has a finite index of separability. In particular, we show that every unital positive partial transpose (PPT) channel has a finite index of separability and that the class of unital channels that have a finite index of separability is a dense subset of the unital channels. We construct concrete examples of maps which are not PPT but have a finite index of separability. We prove that there is a large class of unital channels that are asymptotically entanglement breaking. Our work is motivated by Christandl’s PPT-squared conjecture. This conjecture states that every PPT channel, when composed with itself, becomes entanglement breaking.

arXiv:1801.05542•Journal of Mathematical Physics•Jun 1, 2018•32 citations

C∗-extreme points of entanglement breaking maps

B. V. Rajarama Bhat, Repana Devendra, Nirupama Mallick +1 more

In this paper, we study the [Formula: see text]-convex set of unital entanglement breaking (EB-)maps on matrix algebras. General properties and an abstract characterization of [Formula: see text]-extreme points are discussed. By establishing a Radon–Nikodym-type theorem for a class of EB-maps we give a complete description of the [Formula: see text]-extreme points. It is shown that a unital EB-map [Formula: see text] is [Formula: see text]-extreme if and only if it has Choi-rank equal to [Formula: see text]. Finally, as a direct consequence of the Holevo form of EB-maps, we derive a non-commutative analog of the Krein–Milman theorem for [Formula: see text]-convexity of the set of unital EB-maps.

arXiv:2202.00341•Reviews in Mathematical Physics•Dec 5, 2022•7 citations

Entanglement-breaking channels with general outcome operator algebras

Yui Kuramochi

A unit-preserving and completely positive linear map, or a channel, Λ:A→Ain between C*-algebras A and Ain is called entanglement-breaking (EB) if ω◦(Λ⊗idB) is a separable state for any C*-algebra B and any state ω on the injective C*-tensor product Ain⊗B. In this paper, we establish the equivalence of the following conditions for a channel Λ with a quantum input space and with a general outcome C*-algebra, generalizing the known results in finite dimensions: (i) Λ is EB; (ii) Λ has a measurement-prepare form (Holevo form); (iii) n copies of Λ are compatible for all 2 ≤ n < ∞; (iv) countably infinite copies of Λ are compatible. By using this equivalence, we also show that the set of randomization-equivalence classes of normal EB channels with a fixed input von Neumann algebra is upper and lower Dedekind-closed, i.e., the supremum or infimum of any randomization-increasing or decreasing net of EB channels is also EB. As an example, we construct an injective normal EB channel with an arbitrary outcome operator algebra M acting on an infinite-dimensional separable Hilbert space by using the coherent states and the Bargmann measure.

arXiv:1806.05854•Journal of Mathematical Physics•Oct 1, 2018•2 citations
We obtain a complete characterization of eventually entanglement breaking (EEB) unital channels in terms of some simple commutation properties of their eigenvectors. Specifically, the following properties are equivalent for a unital channel: (i) it is EEB; (ii) it is eventually positive partial transpose (PPT); (iii) it is eventually mixed twisted dephasing; and (iv) its eigenvectors corresponding to non-zero eigenvalues commute with all its peripheral eigenvectors. Similar results hold for one-parameter semigroups of unital quantum channels, where continuity forces such semigroups to become primitive. We employ a matrix integral technique inspired by a result of Watrous. We also characterize the extreme points of the convex set of unital EB channels and, using this characterization and the theory of equiangular tight frames (ETFs), identify several extreme points beyond the twisted dephasing channels.
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 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.
Abstract It is shown that a large class of quantum dynamical maps on complex matrix algebras governed by time-local Master Equations tend to become entanglement breaking in the course of time. Such situation seems to be generic for quantum evolution and in particular, completely positive dynamical semigroups with a unique faithful stationary state enjoy this property. Inspired by this observation, we propose a new concept of eventually entanglement breaking divisible (eEB-divisible) dynamics. A dynamical map is eEB-divisible if any propagator becomes entanglement breaking in finite time. It turns out that eEB-divisibility is quite general and holds for a large class of quantum evolutions.
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.
We analyze linear maps on matrix algebras that become entanglement breaking after composing a finite or infinite number of times with themselves. This means that the Choi matrix of the iterated linear map becomes separable in the tensor product space. If a linear map becomes entanglement breaking after finitely many iterations, we say that the map has a finite index of separability. In particular, we show that every unital positive partial transpose (PPT) channel has a finite index of separability and that the class of unital channels that have a finite index of separability is a dense subset of the unital channels. We construct concrete examples of maps which are not PPT but have a finite index of separability. We prove that there is a large class of unital channels that are asymptotically entanglement breaking. Our work is motivated by Christandl’s PPT-squared conjecture. This conjecture states that every PPT channel, when composed with itself, becomes entanglement breaking.
In this paper, we study the [Formula: see text]-convex set of unital entanglement breaking (EB-)maps on matrix algebras. General properties and an abstract characterization of [Formula: see text]-extreme points are discussed. By establishing a Radon–Nikodym-type theorem for a class of EB-maps we give a complete description of the [Formula: see text]-extreme points. It is shown that a unital EB-map [Formula: see text] is [Formula: see text]-extreme if and only if it has Choi-rank equal to [Formula: see text]. Finally, as a direct consequence of the Holevo form of EB-maps, we derive a non-commutative analog of the Krein–Milman theorem for [Formula: see text]-convexity of the set of unital EB-maps.
A unit-preserving and completely positive linear map, or a channel, Λ:A→Ain between C*-algebras A and Ain is called entanglement-breaking (EB) if ω◦(Λ⊗idB) is a separable state for any C*-algebra B and any state ω on the injective C*-tensor product Ain⊗B. In this paper, we establish the equivalence of the following conditions for a channel Λ with a quantum input space and with a general outcome C*-algebra, generalizing the known results in finite dimensions: (i) Λ is EB; (ii) Λ has a measurement-prepare form (Holevo form); (iii) n copies of Λ are compatible for all 2 ≤ n < ∞; (iv) countably infinite copies of Λ are compatible. By using this equivalence, we also show that the set of randomization-equivalence classes of normal EB channels with a fixed input von Neumann algebra is upper and lower Dedekind-closed, i.e., the supremum or infimum of any randomization-increasing or decreasing net of EB channels is also EB. As an example, we construct an injective normal EB channel with an arbitrary outcome operator algebra M acting on an infinite-dimensional separable Hilbert space by using the coherent states and the Bargmann measure.