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

α -logarithmic negativity

Xin Wang, Mark M. Wilde

Published Sep 23, 2020• 26 citations
arXivHTMLPDF

Abstract

The logarithmic negativity of a bipartite quantum state is a widely employed entanglement measure in quantum information theory due to the fact that it is easy to compute and serves as an upper bound on distillable entanglement. More recently, the $\ensuremath{\kappa}$ entanglement of a bipartite state was shown to be an entanglement measure that is both easily computable and has a precise information-theoretic meaning, being equal to the exact entanglement cost of a bipartite quantum state when the free operations are those that completely preserve the positivity of the partial transpose [Xin Wang and Mark M. Wilde, Phys. Rev. Lett. 125, 040502 (2020)]. In this paper, we provide a nontrivial link between these two entanglement measures by showing that they are the extremes of an ordered family of $\ensuremath{\alpha}$-logarithmic negativity entanglement measures, each of which is identified by a parameter $\ensuremath{\alpha}\ensuremath{\in}\left[1,\ensuremath{\infty}\right]$. In this family, the original logarithmic negativity is recovered as the smallest with $\ensuremath{\alpha}=1$, and the $\ensuremath{\kappa}$ entanglement is recovered as the largest with $\ensuremath{\alpha}=\ensuremath{\infty}$. We prove that the $\ensuremath{\alpha}$-logarithmic negativity satisfies the following properties: entanglement monotone, normalization, faithfulness, and subadditivity. We also prove that it is neither convex nor monogamous. Finally, we define the $\ensuremath{\alpha}$-logarithmic negativity of a quantum channel as a generalization of the notion for quantum states, and we show how to generalize many of the concepts to arbitrary resource theories.

DOI
10.1103/physreva.102.032416

Related papers

Dynamical Entanglement

Gilad Gour, Carlo Maria Scandolo

Unlike the entanglement of quantum states, very little is known about the entanglement of bipartite channels, called dynamical entanglement. Here we work with the partial transpose of a superchannel, and use it to define computable measures of dynamical entanglement, such as the negativity. We show that a version of it, the max-logarithmic negativity, represents the exact asymptotic dynamical entanglement cost. We discover a family of dynamical entanglement measures that provide necessary and sufficient conditions for bipartite channel simulation under local operations and classical communication and under operations with positive partial transpose.

arXiv:2009.12304•Physical Review Letters•Oct 30, 2020•53 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

Logarithmic negativity typically equals exact entanglement cost

Bowen Ouyang, Jonah Kudler-Flam

Quantum entanglement plays a leading role in modern understanding of physical systems, from quantum phases of matter to quantum gravity. In quantum information theory, one seeks operationally meaningful quantifiers of entanglement, which for large quantum systems are notoriously difficult to evaluate due to the lack of computationally efficient algorithms. In this Letter, we show that for large random induced mixed states the logarithmic negativity, an efficiently computable entanglement measure, generically coincides with the exact entanglement cost under positive-partial-transpose-preserving operations, thereby acquiring a precise operational interpretation. Our results establish logarithmic negativity as an exact characterization of entanglement in generic many-body states and provide a tractable route for quantifying entanglement in complex quantum systems.

quant-pharXiv:2607.01320•Jul 3, 2026•0 citations

Resource theory of entanglement for bipartite quantum channels

Stefan Bäuml, Siddhartha Das, Xin Wang +1 more

The traditional perspective in quantum resource theories concerns how to use free operations to convert one resourceful quantum state to another one. For example, a fundamental and well known question in entanglement theory is to determine the distillable entanglement of a bipartite state, which is equal to the maximum rate at which fresh Bell states can be distilled from many copies of a given bipartite state by employing local operations and classical communication for free. It is the aim of this paper to take this kind of question to the next level, with the main question being: What is the best way of using free channels to convert one resourceful quantum channel to another? Here we focus on the the resource theory of entanglement for bipartite channels and establish several fundamental tasks and results regarding it. In particular, we establish bounds on several pertinent information processing tasks in channel entanglement theory, and we define several entanglement measures for bipartite channels, including the logarithmic negativity and the $κ$-entanglement. We also show that the max-Rains information of [Bäuml et al., Physical Review Letters, 121, 250504 (2018)] has a divergence interpretation, which is helpful for simplifying the results of this earlier work.

arXiv:1907.04181•Jan 1, 2019•26 citations

Anyonic Partial Transpose I: Quantum Information Aspects

Hassan Shapourian, Roger S. K. Mong, Shinsei Ryu

A basic diagnostic of entanglement in mixed quantum states is known as the partial transpose and the corresponding entanglement measure is called the logarithmic negativity. Despite the great success of logarithmic negativity in characterizing bosonic many-body systems, generalizing the partial transpose to fermionic systems remained a technical challenge until recently when a new definition that accounts for the Fermi statistics was put forward. In this paper, we propose a way to generalize the partial transpose to anyons with (non-Abelian) fractional statistics based on the apparent similarity between the partial transpose and the braiding operation. We then define the anyonic version of the logarithmic negativity and show that it satisfies the standard requirements such as monotonicity to be an entanglement measure. In particular, we elucidate the properties of the anyonic logarithmic negativity by computing it for a toy density matrix of a pair of anyons within various categories. We conjecture that the subspace of states with a vanishing logarithmic negativity is a set of measure zero in the entire space of anyonic states, in contrast with the ordinary qubit systems where this subspace occupies a finite volume. We prove this conjecture for multiplicity-free categories.

arXiv:2012.02222•Dec 3, 2020•5 citations

Quantifying the unextendibility of entanglement*

Kun Wang, Xin Wang, Mark M. Wilde

Abstract Entanglement is a striking feature of quantum mechanics, and it has a key property called unextendibility. In this paper, we present a framework for quantifying and investigating the unextendibility of general bipartite quantum states. First, we define the unextendible entanglement, a family of entanglement measures based on the concept of a state-dependent set of free states. The intuition behind these measures is that the more entangled a bipartite state is, the less entangled each of its individual systems is with a third party. Second, we demonstrate that the unextendible entanglement is an entanglement monotone under two-extendible quantum operations, including local operations and one-way classical communication as a special case. Normalization and faithfulness are two other desirable properties of unextendible entanglement, which we establish here. We further show that the unextendible entanglement provides efficiently computable benchmarks for the rate of exact entanglement or secret key distillation, as well as the overhead of probabilistic entanglement or secret key distillation.

arXiv:1911.07433•New Journal of Physics•Feb 5, 2024•10 citations
The logarithmic negativity of a bipartite quantum state is a widely employed entanglement measure in quantum information theory due to the fact that it is easy to compute and serves as an upper bound on distillable entanglement. More recently, the \ensuremathκ\ensuremath{\kappa}\ensuremathκ entanglement of a bipartite state was shown to be an entanglement measure that is both easily computable and has a precise information-theoretic meaning, being equal to the exact entanglement cost of a bipartite quantum state when the free operations are those that completely preserve the positivity of the partial transpose [Xin Wang and Mark M. Wilde, Phys. Rev. Lett. 125, 040502 (2020)]. In this paper, we provide a nontrivial link between these two entanglement measures by showing that they are the extremes of an ordered family of \ensuremathα\ensuremath{\alpha}\ensuremathα-logarithmic negativity entanglement measures, each of which is identified by a parameter \ensuremathα\ensuremath∈[1,\ensuremath∞]\ensuremath{\alpha}\ensuremath{\in}\left[1,\ensuremath{\infty}\right]\ensuremathα\ensuremath∈[1,\ensuremath∞]. In this family, the original logarithmic negativity is recovered as the smallest with \ensuremathα=1\ensuremath{\alpha}=1\ensuremathα=1, and the \ensuremathκ\ensuremath{\kappa}\ensuremathκ entanglement is recovered as the largest with \ensuremathα=\ensuremath∞\ensuremath{\alpha}=\ensuremath{\infty}\ensuremathα=\ensuremath∞. We prove that the \ensuremathα\ensuremath{\alpha}\ensuremathα-logarithmic negativity satisfies the following properties: entanglement monotone, normalization, faithfulness, and subadditivity. We also prove that it is neither convex nor monogamous. Finally, we define the \ensuremathα\ensuremath{\alpha}\ensuremathα-logarithmic negativity of a quantum channel as a generalization of the notion for quantum states, and we show how to generalize many of the concepts to arbitrary resource theories.
Unlike the entanglement of quantum states, very little is known about the entanglement of bipartite channels, called dynamical entanglement. Here we work with the partial transpose of a superchannel, and use it to define computable measures of dynamical entanglement, such as the negativity. We show that a version of it, the max-logarithmic negativity, represents the exact asymptotic dynamical entanglement cost. We discover a family of dynamical entanglement measures that provide necessary and sufficient conditions for bipartite channel simulation under local operations and classical communication and under operations with positive partial transpose.
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.
Quantum entanglement plays a leading role in modern understanding of physical systems, from quantum phases of matter to quantum gravity. In quantum information theory, one seeks operationally meaningful quantifiers of entanglement, which for large quantum systems are notoriously difficult to evaluate due to the lack of computationally efficient algorithms. In this Letter, we show that for large random induced mixed states the logarithmic negativity, an efficiently computable entanglement measure, generically coincides with the exact entanglement cost under positive-partial-transpose-preserving operations, thereby acquiring a precise operational interpretation. Our results establish logarithmic negativity as an exact characterization of entanglement in generic many-body states and provide a tractable route for quantifying entanglement in complex quantum systems.
The traditional perspective in quantum resource theories concerns how to use free operations to convert one resourceful quantum state to another one. For example, a fundamental and well known question in entanglement theory is to determine the distillable entanglement of a bipartite state, which is equal to the maximum rate at which fresh Bell states can be distilled from many copies of a given bipartite state by employing local operations and classical communication for free. It is the aim of this paper to take this kind of question to the next level, with the main question being: What is the best way of using free channels to convert one resourceful quantum channel to another? Here we focus on the the resource theory of entanglement for bipartite channels and establish several fundamental tasks and results regarding it. In particular, we establish bounds on several pertinent information processing tasks in channel entanglement theory, and we define several entanglement measures for bipartite channels, including the logarithmic negativity and the κκκ-entanglement. We also show that the max-Rains information of [Bäuml et al., Physical Review Letters, 121, 250504 (2018)] has a divergence interpretation, which is helpful for simplifying the results of this earlier work.
A basic diagnostic of entanglement in mixed quantum states is known as the partial transpose and the corresponding entanglement measure is called the logarithmic negativity. Despite the great success of logarithmic negativity in characterizing bosonic many-body systems, generalizing the partial transpose to fermionic systems remained a technical challenge until recently when a new definition that accounts for the Fermi statistics was put forward. In this paper, we propose a way to generalize the partial transpose to anyons with (non-Abelian) fractional statistics based on the apparent similarity between the partial transpose and the braiding operation. We then define the anyonic version of the logarithmic negativity and show that it satisfies the standard requirements such as monotonicity to be an entanglement measure. In particular, we elucidate the properties of the anyonic logarithmic negativity by computing it for a toy density matrix of a pair of anyons within various categories. We conjecture that the subspace of states with a vanishing logarithmic negativity is a set of measure zero in the entire space of anyonic states, in contrast with the ordinary qubit systems where this subspace occupies a finite volume. We prove this conjecture for multiplicity-free categories.
Abstract Entanglement is a striking feature of quantum mechanics, and it has a key property called unextendibility. In this paper, we present a framework for quantifying and investigating the unextendibility of general bipartite quantum states. First, we define the unextendible entanglement, a family of entanglement measures based on the concept of a state-dependent set of free states. The intuition behind these measures is that the more entangled a bipartite state is, the less entangled each of its individual systems is with a third party. Second, we demonstrate that the unextendible entanglement is an entanglement monotone under two-extendible quantum operations, including local operations and one-way classical communication as a special case. Normalization and faithfulness are two other desirable properties of unextendible entanglement, which we establish here. We further show that the unextendible entanglement provides efficiently computable benchmarks for the rate of exact entanglement or secret key distillation, as well as the overhead of probabilistic entanglement or secret key distillation.