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

Supremum of Entanglement Measure for Symmetric Gaussian States, and Entangling Capacity

Jhih-Yuan Kao

Published Aug 10, 2020• 1 citation
arXivHTMLPDF

Abstract

In this thesis there are two topics: On the entangling capacity, in terms of negativity, of quantum operations, and on the supremum of negativity for symmetric Gaussian states. Positive partial transposition (PPT) states are an important class of states in quantum information. We show a method to calculate bounds for entangling capacity, the amount of entanglement that can be produced by a quantum operation, in terms of negativity, a measure of entanglement. The bounds of entangling capacity are found to be associated with how non-PPT (PPT preserving) an operation is. A length that quantifies both entangling capacity/entanglement and PPT-ness of an operation or state can be defined, establishing a geometry characterized by PPT-ness. The distance derived from the length bounds the relative entangling capability, endowing the geometry with more physical significance. For a system composed of permutationally symmetric Gaussian modes, by identifying the boundary of valid states and making necessary change of variables, the existence and exact value of the supremum of logarithmic negativity (and negativity likewise) between any two blocks can be shown analytically. Involving only the total number of interchangeable modes and the sizes of respective blocks, this result is general and easy to be applied for such a class of states.

DOI
10.48550/arxiv.2008.03893

Related papers

Supremum of block entanglement for symmetric Gaussian states

Jhih-Yuan Kao, Chung-Hsien Chou

For a system composed of permutationally symmetric Gaussian modes, by identifying the boundary of valid states and making necessary change of variables, the existence and exact value of the supremum of logarithmic negativity (and negativity likewise) between any two blocks can be shown analytically. Involving only the total number of interchangeable modes and the sizes of respective blocks, this result is general and easy to be applied for such a class of states.

Scientific Reports•May 3, 2018•0 citations

Entangling capacities and the geometry of quantum operations

Jhih-Yuan Kao, Chung-Hsien Chou

Quantum operations are the fundamental transformations on quantum states. In this work, we study the relation between entangling capacities of operations, geometry of operations, and positive partial transpose (PPT) states, which are an important class of states in quantum information. We show a method to calculate bounds for entangling capacity, the amount of entanglement that can be produced by a quantum operation, in terms of negativity, a measure of entanglement. The bounds of entangling capacity are found to be associated with how non-PPT (PPT preserving) an operation is. A length that quantifies both entangling capacity/entanglement and PPT-ness of an operation or state can be defined, establishing a geometry characterized by PPT-ness. The distance derived from the length bounds the relative entangling capability, endowing the geometry with more physical significance. We also demonstrate the equivalence of PPT-ness and separability for unitary operations.

Scientific Reports•Sep 29, 2020•6 citations

Gaussian measures of entanglement versus negativities: Ordering of two-mode Gaussian states

Gerardo Adesso, Fabrizio Illuminati

We study the entanglement of general (pure or mixed) two-mode Gaussian states of continuous-variable systems by comparing the two available classes of computable measures of entanglement: entropy-inspired Gaussian convex-roof measures and positive partial transposition--inspired measures (negativity and logarithmic negativity). We first review the formalism of Gaussian measures of entanglement, adopting the framework introduced in M. M. Wolf et al., Phys. Rev. A 69, 052320 (2004), where the Gaussian entanglement of formation was defined. We compute explicitly Gaussian measures of entanglement for two important families of nonsymmetric two-mode Gaussian state: namely, the states of extremal (maximal and minimal) negativities at fixed global and local purities, introduced in G. Adesso et al., Phys. Rev. Lett. 92, 087901 (2004). This analysis allows us to compare the different orderings induced on the set of entangled two-mode Gaussian states by the negativities and by the Gaussian measures of entanglement. We find that in a certain range of values of the global and local purities (characterizing the covariance matrix of the corresponding extremal states), states of minimum negativity can have more Gaussian entanglement of formation than states of maximum negativity. Consequently, Gaussian measures and negativities are definitely inequivalent measures of entanglement on nonsymmetric two-mode Gaussian states, even when restricted to a class of extremal states. On the other hand, the two families of entanglement measures are completely equivalent on symmetric states, for which the Gaussian entanglement of formation coincides with the true entanglement of formation. Finally, we show that the inequivalence between the two families of continuous-variable entanglement measures is somehow limited. Namely, we rigorously prove that, at fixed negativities, the Gaussian measures of entanglement are bounded from below. Moreover, we provide some strong evidence suggesting that they are as well bounded from above.

arXiv:quant-ph/0506124•Physical Review A•Sep 28, 2005•233 citations

Quantifying entanglement in two-mode Gaussian states

Spyros Tserkis, Timothy C. Ralph

Entangled two-mode Gaussian states are a key resource for quantum information technologies such as teleportation, quantum cryptography, and quantum computation, so quantification of Gaussian entanglement is an important problem. Entanglement of formation is unanimously considered a proper measure of quantum correlations, but for arbitrary two-mode Gaussian states no analytical form is currently known. In contrast, logarithmic negativity is a measure that is straightforward to calculate and so has been adopted by most researchers, even though it is a less faithful quantifier. In this work, we derive an analytical lower bound for entanglement of formation of generic two-mode Gaussian states, which becomes tight for symmetric states and for states with balanced correlations. We define simple expressions for entanglement of formation in physically relevant situations and use these to illustrate the problematic behavior of logarithmic negativity, which can lead to spurious conclusions.

arXiv:1705.03612•Physical Review A•Dec 29, 2017•78 citations

Computable and Faithful Lower Bound on Entanglement Cost

Xin Wang, Mingrui Jing, Chengkai Zhu

Quantifying the minimum entanglement needed to prepare quantum states and implement quantum processes is a key challenge in quantum information theory. In this Letter, we develop computable and faithful lower bounds on the entanglement cost under quantum operations that completely preserve the positivity of partial transpose (PPT operations), by introducing the generalized divergence of k-negativity, a generalization of logarithmic negativity. Our bounds are efficiently computable via semidefinite programming and provide nontrivial values for all states that are non-PPT (NPT), establishing their faithfulness for the resource theory of NPT entanglement. Notably, we find and affirm the irreversibility of asymptotic entanglement manipulation under PPT operations for full-rank entangled states. Furthermore, we extend our methodology to derive lower bounds on the entanglement cost of both point-to-point and bipartite quantum channels. Our bound demonstrates improvements over previously known computable bounds for a wide range of quantum states and channels. These findings push the boundaries of understanding the structure of entanglement and the fundamental limits of entanglement manipulation.

arXiv:2311.10649•Physical Review Letters•May 15, 2025•1 citation

Irreversibility of Asymptotic Entanglement Manipulation Under Quantum Operations Completely Preserving Positivity of Partial Transpose

Xin Wang, Runyao Duan

We demonstrate the irreversibility of asymptotic entanglement manipulation under quantum operations that completely preserve the positivity of partial transpose (PPT), resolving a major open problem in quantum information theory. Our key tool is a new efficiently computable additive lower bound for the asymptotic relative entropy of entanglement with respect to PPT states, which can be used to evaluate the entanglement cost under local operations and classical communication (LOCC). We find that for any rank-two mixed state supporting on the 3⊗3 antisymmetric subspace, the amount of distillable entanglement by PPT operations is strictly smaller than one entanglement bit (ebit) while its entanglement cost under PPT operations is exactly one ebit. As a by-product, we find that for this class of states, both the Rains's bound and its regularization are strictly less than the asymptotic relative entropy of entanglement. So, in general, there is no unique entanglement measure for the manipulation of entanglement by PPT operations. We further show a computable sufficient condition for the irreversibility of entanglement distillation by LOCC (or PPT) operations.

arXiv:1606.09421•Physical Review Letters•Nov 3, 2017•32 citations
In this thesis there are two topics: On the entangling capacity, in terms of negativity, of quantum operations, and on the supremum of negativity for symmetric Gaussian states. Positive partial transposition (PPT) states are an important class of states in quantum information. We show a method to calculate bounds for entangling capacity, the amount of entanglement that can be produced by a quantum operation, in terms of negativity, a measure of entanglement. The bounds of entangling capacity are found to be associated with how non-PPT (PPT preserving) an operation is. A length that quantifies both entangling capacity/entanglement and PPT-ness of an operation or state can be defined, establishing a geometry characterized by PPT-ness. The distance derived from the length bounds the relative entangling capability, endowing the geometry with more physical significance. For a system composed of permutationally symmetric Gaussian modes, by identifying the boundary of valid states and making necessary change of variables, the existence and exact value of the supremum of logarithmic negativity (and negativity likewise) between any two blocks can be shown analytically. Involving only the total number of interchangeable modes and the sizes of respective blocks, this result is general and easy to be applied for such a class of states.
Quantum operations are the fundamental transformations on quantum states. In this work, we study the relation between entangling capacities of operations, geometry of operations, and positive partial transpose (PPT) states, which are an important class of states in quantum information. We show a method to calculate bounds for entangling capacity, the amount of entanglement that can be produced by a quantum operation, in terms of negativity, a measure of entanglement. The bounds of entangling capacity are found to be associated with how non-PPT (PPT preserving) an operation is. A length that quantifies both entangling capacity/entanglement and PPT-ness of an operation or state can be defined, establishing a geometry characterized by PPT-ness. The distance derived from the length bounds the relative entangling capability, endowing the geometry with more physical significance. We also demonstrate the equivalence of PPT-ness and separability for unitary operations.
We study the entanglement of general (pure or mixed) two-mode Gaussian states of continuous-variable systems by comparing the two available classes of computable measures of entanglement: entropy-inspired Gaussian convex-roof measures and positive partial transposition--inspired measures (negativity and logarithmic negativity). We first review the formalism of Gaussian measures of entanglement, adopting the framework introduced in M. M. Wolf et al., Phys. Rev. A 69, 052320 (2004), where the Gaussian entanglement of formation was defined. We compute explicitly Gaussian measures of entanglement for two important families of nonsymmetric two-mode Gaussian state: namely, the states of extremal (maximal and minimal) negativities at fixed global and local purities, introduced in G. Adesso et al., Phys. Rev. Lett. 92, 087901 (2004). This analysis allows us to compare the different orderings induced on the set of entangled two-mode Gaussian states by the negativities and by the Gaussian measures of entanglement. We find that in a certain range of values of the global and local purities (characterizing the covariance matrix of the corresponding extremal states), states of minimum negativity can have more Gaussian entanglement of formation than states of maximum negativity. Consequently, Gaussian measures and negativities are definitely inequivalent measures of entanglement on nonsymmetric two-mode Gaussian states, even when restricted to a class of extremal states. On the other hand, the two families of entanglement measures are completely equivalent on symmetric states, for which the Gaussian entanglement of formation coincides with the true entanglement of formation. Finally, we show that the inequivalence between the two families of continuous-variable entanglement measures is somehow limited. Namely, we rigorously prove that, at fixed negativities, the Gaussian measures of entanglement are bounded from below. Moreover, we provide some strong evidence suggesting that they are as well bounded from above.
Entangled two-mode Gaussian states are a key resource for quantum information technologies such as teleportation, quantum cryptography, and quantum computation, so quantification of Gaussian entanglement is an important problem. Entanglement of formation is unanimously considered a proper measure of quantum correlations, but for arbitrary two-mode Gaussian states no analytical form is currently known. In contrast, logarithmic negativity is a measure that is straightforward to calculate and so has been adopted by most researchers, even though it is a less faithful quantifier. In this work, we derive an analytical lower bound for entanglement of formation of generic two-mode Gaussian states, which becomes tight for symmetric states and for states with balanced correlations. We define simple expressions for entanglement of formation in physically relevant situations and use these to illustrate the problematic behavior of logarithmic negativity, which can lead to spurious conclusions.
Quantifying the minimum entanglement needed to prepare quantum states and implement quantum processes is a key challenge in quantum information theory. In this Letter, we develop computable and faithful lower bounds on the entanglement cost under quantum operations that completely preserve the positivity of partial transpose (PPT operations), by introducing the generalized divergence of k-negativity, a generalization of logarithmic negativity. Our bounds are efficiently computable via semidefinite programming and provide nontrivial values for all states that are non-PPT (NPT), establishing their faithfulness for the resource theory of NPT entanglement. Notably, we find and affirm the irreversibility of asymptotic entanglement manipulation under PPT operations for full-rank entangled states. Furthermore, we extend our methodology to derive lower bounds on the entanglement cost of both point-to-point and bipartite quantum channels. Our bound demonstrates improvements over previously known computable bounds for a wide range of quantum states and channels. These findings push the boundaries of understanding the structure of entanglement and the fundamental limits of entanglement manipulation.
We demonstrate the irreversibility of asymptotic entanglement manipulation under quantum operations that completely preserve the positivity of partial transpose (PPT), resolving a major open problem in quantum information theory. Our key tool is a new efficiently computable additive lower bound for the asymptotic relative entropy of entanglement with respect to PPT states, which can be used to evaluate the entanglement cost under local operations and classical communication (LOCC). We find that for any rank-two mixed state supporting on the 3⊗3 antisymmetric subspace, the amount of distillable entanglement by PPT operations is strictly smaller than one entanglement bit (ebit) while its entanglement cost under PPT operations is exactly one ebit. As a by-product, we find that for this class of states, both the Rains's bound and its regularization are strictly less than the asymptotic relative entropy of entanglement. So, in general, there is no unique entanglement measure for the manipulation of entanglement by PPT operations. We further show a computable sufficient condition for the irreversibility of entanglement distillation by LOCC (or PPT) operations.