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:2209.08689 · Physical Review A

Bounds on the breaking time for entanglement-breaking channels

Fattah Sakuldee, Łukasz Rudnicki

Published Feb 27, 2023• 6 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.107.022430

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

Fundamental speed limits on entanglement dynamics of bipartite quantum systems

Vivek Pandey, Swapnil Bhowmick, Brij Mohan +2 more

The speed limit on entanglement is defined as the maximal rate at which entanglement can be generated or degraded in a physical process. We derive the speed limits on entanglement, using the relative entropy of entanglement and trace-distance entanglement, for unitary and arbitrary quantum dynamics, where we assume that the dynamics of the closest separable state can be approximately described by the closest separable dynamics of the actual dynamics of the system. For the unitary dynamics of isolated bipartite systems which are described by pure states, the rate of entanglement production is bounded by the product of fluctuations of the system's driving Hamiltonian and the surprisal operator, with an additional term reflecting the time-dependent nature of the closest separable state. Removing restrictions on the purity of the input and on the unitarity of the evolution, the two terms in the bound get suitably altered. Furthermore, we find a lower bound on the time required to generate or degrade a certain amount of entanglement by arbitrary quantum dynamics. We demonstrate the tightness of our speed limits on entanglement by considering quantum processes of practical interest.

arXiv:2303.07415•Physical Review A•Nov 14, 2024•8 citations

Converting separable conditions to entanglement-breaking conditions

Ryo Namiki

We present a general method to derive entanglement breaking (EB) conditions for continuous-variable quantum gates. We start with an arbitrary entanglement witness and reach an EB condition. The resultant EB condition is applicable not only for quantum channels but also for general quantum operations; namely, the trace-non-increasing class of completely positive maps. We illustrate our method associated with a quantum benchmark based on the input ensemble of Gaussian distributed coherent states. We also exploit our idea for channels acting on finite-dimensional systems and present a Schmidt-number benchmark based on input states of two mutually unbiased bases and measurements of generalized Pauli operators.

arXiv:1503.07109•Physical Review A•Oct 20, 2016•1 citation

Divisibility of qubit channels and dynamical maps

David Davalos, Mário Ziman, Carlos Pineda

The concept of divisibility of dynamical maps is used to introduce an analogous concept for quantum channels by analyzing the simulability of channels by means of dynamical maps. In particular, this is addressed for Lindblad divisible, completely positive divisible and positive divisible dynamical maps. The corresponding L-divisible, CP-divisible and P-divisible subsets of channels are characterized (exploiting the results by Wolf et al. \cite{cirac}) and visualized for the case of qubit channels. We discuss the general inclusions among divisibility sets and show several equivalences for qubit channels. To this end we study the conditions of L-divisibility for finite dimensional channels, especially the cases with negative eigenvalues, extending and completing the results of Ref.~\cite{Wolf2008}. Furthermore we show that transitions between every two of the defined divisibility sets are allowed. We explore particular examples of dynamical maps to compare these concepts. Finally, we show that every divisible but not infinitesimal divisible qubit channel (in positive maps) is entanglement breaking, and open the question if something similar occurs for higher dimensions.

arXiv:1812.11437•Quantum•May 20, 2019•38 citations

Quantum channel detection

Chiara Macchiavello, Matteo A. C. Rossi

We present a method to detect properties of quantum channels, assuming that some a priori information about the form of the channel is available. The method is based on a correspondence with entanglement detection methods for multipartite density matrices based on witness operators. We first illustrate the method in the case of entanglement-breaking channels and nonseparable random unitary channels and show how it can be implemented experimentally by means of local measurements. We then study the detection of nonseparable maps and show that for pairs of systems of dimension higher than two the detection operators are not the same as in the random unitary case, highlighting a richer separability structure of quantum channels with respect to quantum states. Finally we consider the set of PPT maps, developing a technique to reveal NPT maps.

arXiv:1208.5121•Physical Review A•Oct 30, 2013•24 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 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 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.
The speed limit on entanglement is defined as the maximal rate at which entanglement can be generated or degraded in a physical process. We derive the speed limits on entanglement, using the relative entropy of entanglement and trace-distance entanglement, for unitary and arbitrary quantum dynamics, where we assume that the dynamics of the closest separable state can be approximately described by the closest separable dynamics of the actual dynamics of the system. For the unitary dynamics of isolated bipartite systems which are described by pure states, the rate of entanglement production is bounded by the product of fluctuations of the system's driving Hamiltonian and the surprisal operator, with an additional term reflecting the time-dependent nature of the closest separable state. Removing restrictions on the purity of the input and on the unitarity of the evolution, the two terms in the bound get suitably altered. Furthermore, we find a lower bound on the time required to generate or degrade a certain amount of entanglement by arbitrary quantum dynamics. We demonstrate the tightness of our speed limits on entanglement by considering quantum processes of practical interest.
We present a general method to derive entanglement breaking (EB) conditions for continuous-variable quantum gates. We start with an arbitrary entanglement witness and reach an EB condition. The resultant EB condition is applicable not only for quantum channels but also for general quantum operations; namely, the trace-non-increasing class of completely positive maps. We illustrate our method associated with a quantum benchmark based on the input ensemble of Gaussian distributed coherent states. We also exploit our idea for channels acting on finite-dimensional systems and present a Schmidt-number benchmark based on input states of two mutually unbiased bases and measurements of generalized Pauli operators.
The concept of divisibility of dynamical maps is used to introduce an analogous concept for quantum channels by analyzing the simulability of channels by means of dynamical maps. In particular, this is addressed for Lindblad divisible, completely positive divisible and positive divisible dynamical maps. The corresponding L-divisible, CP-divisible and P-divisible subsets of channels are characterized (exploiting the results by Wolf et al. \cite{cirac}) and visualized for the case of qubit channels. We discuss the general inclusions among divisibility sets and show several equivalences for qubit channels. To this end we study the conditions of L-divisibility for finite dimensional channels, especially the cases with negative eigenvalues, extending and completing the results of Ref.~\cite{Wolf2008}. Furthermore we show that transitions between every two of the defined divisibility sets are allowed. We explore particular examples of dynamical maps to compare these concepts. Finally, we show that every divisible but not infinitesimal divisible qubit channel (in positive maps) is entanglement breaking, and open the question if something similar occurs for higher dimensions.
We present a method to detect properties of quantum channels, assuming that some a priori information about the form of the channel is available. The method is based on a correspondence with entanglement detection methods for multipartite density matrices based on witness operators. We first illustrate the method in the case of entanglement-breaking channels and nonseparable random unitary channels and show how it can be implemented experimentally by means of local measurements. We then study the detection of nonseparable maps and show that for pairs of systems of dimension higher than two the detection operators are not the same as in the random unitary case, highlighting a richer separability structure of quantum channels with respect to quantum states. Finally we consider the set of PPT maps, developing a technique to reveal NPT maps.