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:2509.22152 · IEEE Transactions on Information Theory

Asymptotic Equipartition Property of Subadditive Multipartite Entanglement Measures on Pure States

Dávid Bugár

Published Jun 9, 2026• 0 citations
arXivHTMLPDF

Abstract

We investigate the asymptotic equipartition property (AEP) in the context of multipartite entanglement measures on pure states. In particular, we formulate AEP for subadditive entanglement measures that admit certain weak conditions. This is motivated by the uniqueness of the entanglement entropy in the asymptotic limit in the bipartite case. From an operational perspective, the result is relevant in the LOCCqscenario (asymptotic local operations and classical communication with a sublinear amount of quantum communication). Analogously to the classical AEP, we show that the regularization of smooth, weakly additive entanglement measures - under mild additional assumptions -yields entanglement measures, that are weakly additive and asymptotically continuous. We then evaluate the mentioned regularization and smoothing procedure for a known family of Rényi type multipartite entanglement measures, showing that the resulting entanglement measures reduce to convex combinations of bipartite entanglement entropies.

DOI
10.1109/tit.2026.3701511

Related papers

Multipartite entanglement gambling: The power of asymptotic state transformations assisted by a sublinear amount of quantum communication

Ashish V. Thapliyal, John A. Smolin

Reversible state transformations under entanglement nonincreasing operations give rise to entanglement measures. It is well known that asymptotic local operations and classical communication (LOCC) are required to get a simple operational measure of bipartite pure state entanglement. For bipartite mixed states and multipartite pure states it is likely that a more powerful class of operations will be needed. To this end more powerful versions of state transformations (or reducibilities), namely, LOCCq (asymptotic LOCC with a sublinear amount of quantum communication) and CLOCC (asymptotic LOCC with catalysis) have been considered in the literature. In this paper we show that LOCCq state transformations are only as powerful as asymptotic LOCC state transformations for multipartite pure states. The basic tool we use is multipartite entanglement gambling: Any pure multipartite entangled state can be transformed to an Einstein-Podolsky-Rosen pair shared by some pair of parties and any irreducible m-party pure state $(m>~2)$ can be used to create any other state (pure or mixed) using LOCC. We consider applications of multipartite entanglement gambling to multipartite distillability and to characterizations of multipartite minimal entanglement generating sets. We briefly consider generalizations of this result to mixed states by defining the class of cat-distillable states, i.e., states from which cat states $(|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉)$ may be distilled.

arXiv:quant-ph/0212098•Physical Review A•Dec 31, 2003•10 citations

Explicit Error Bounds for Entanglement Transformations Between Sparse Multipartite States

Dávid Bugár, Péter Vrana

The trade-off relation between the rate and the strong converse exponent for probabilistic asymptotic entanglement transformations between pure multipartite states can in principle be characterised in terms of a class of entanglement measures determined implicitly by a set of strong axioms. A nontrivial family of such functionals has recently been constructed, but their previously known characterisations have so far only made it possible to evaluate them in very simple cases. In this paper we derive a new regularised formula for these functionals in terms of a subadditive upper bound, complementing the previously known superadditive lower bound. The upper and lower bounds evaluated on tensor powers differ by a logarithmically bounded term, which provides a bound on the convergence rate. In addition, we find that on states satisfying a certain sparsity constraint, the upper bound is equal to the value of the corresponding additive entanglement measure, therefore the regularisation is not needed for such states, and the evaluation is possible via a single-letter formula. Our results provide explicit bounds on the success probability of transformations by local operations and classical communication and, due to the additivity of the entanglement measures, also on the strong converse exponent for asymptotic transformations.

arXiv:2309.11429•IEEE Transactions on Information Theory•Apr 1, 2024•3 citations

Polygon relations and subadditivity of entropic measures for discrete and continuous multipartite entanglement

Lijun Liu, Xiaozhen Ge, Shuming Cheng

Abstract In a recent work by us Ge et al [Phys. Rev. A 110, L010402 (2024)], we have derived a series of polygon relations of bipartite entanglement measures that is useful to reveal entanglement properties of discrete, continuous, and even hybrid multipartite quantum systems. In this work, with the information-theoretical measures of Rényi and Tsallis entropies, we study the relationship between the polygon relation and the subadditivity of entropy. In particular, the entropy-polygon relations are derived for pure multi-qubit states and then generalized to multi-mode Gaussian states, by utilizing the known results from the quantum marginal problem. Then the equivalence between the polygon relation and subadditivity is established, in the sense that for all discrete or continuous multipartite states, the polygon relation holds if and only if the underlying entropy is subadditive. As a byproduct, the subadditivity of Rényi and Tsallis entropies is proven for all bipartite Gaussian states. Finally, the difference between polygon relations and monogamy relations is clarified, and generalizations of our results are discussed. Our work provides a better understanding of the rich structure of multipartite states, and hence is expected to be helpful for the study of multipartite entanglement.

arXiv:2401.02066•Physica Scripta•Aug 6, 2024•1 citation

Exact and asymptotic measures of multipartite pure-state entanglement

Charles H. Bennett, Sandu Popescu, Daniel Rohrlich +2 more

Hoping to simplify the classification of pure entangled states of multi $(m)\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ quantum systems, we study exactly and asymptotically (in $n)$ reversible transformations among $n\mathrm{th}$ tensor powers of such states (i.e., $n$ copies of the state shared among the same $m$ parties) under local quantum operations and classical communication (LOCC). For exact transformations, we show that two states whose marginal one-party entropies agree are either locally unitarily equivalent or else LOCC incomparable. In particular we show that two tripartite Greenberger-Horne-Zeilinger states are LOCC incomparable to three bipartite Einstein-Podolsky-Rosen (EPR) states symmetrically shared among the three parties. Asymptotic transformations yield a simpler classification than exact transformations; for example, they allow all pure bipartite states to be characterized by a single parameter---their partial entropy---which may be interpreted as the number of EPR pairs asymptotically interconvertible to the state in question by LOCC transformations. We show that $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states having an $m\ensuremath{-}\mathrm{w}\mathrm{a}\mathrm{y}$ Schmidt decomposition are similarly parametrizable, with the partial entropy across any nontrivial partition representing the number of standard quantum superposition or ``cat'' states $|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉$ asymptotically interconvertible to the state in question. For general $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ states, partial entropies across different partitions need not be equal, and since partial entropies are conserved by asymptotically reversible LOCC operations, a multicomponent entanglement measure is needed, with each scalar component representing a different kind of entanglement, not asymptotically interconvertible to the other kinds. In particular we show that the $m=4$ cat state is not isentropic to, and therefore not asymptotically interconvertible to, any combination of bipartite and tripartite states shared among the four parties. Thus, although the $m=4$ cat state can be prepared from bipartite EPR states, the preparation process is necessarily irreversible, and remains so even asymptotically. For each number of parties $m$ we define a minimal reversible entanglement generating set (MREGS) as a set of states of minimal cardinality sufficient to generate all $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states by asymptotically reversible LOCC transformations. Partial entropy arguments provide lower bounds on the size of the MREGS, but for $m>2$ we know no upper bounds. We briefly consider several generalizations of LOCC transformations, including transformations with some probability of failure, transformations with the catalytic assistance of states other than the states we are trying to transform, and asymptotic LOCC transformations supplemented by a negligible $[o(n)]$ amount of quantum communication.

arXiv:quant-ph/9908073•Physical Review A•Dec 12, 2000•482 citations

Quantifying Multipartite Entanglement Based on unified entropy

Yan Hong, Tongtong Xu, Limin Gao

In this paper, we investigate the characterization of multipartite entanglement based on the unified $(q,s)$-entropy framework. For bipartite quantum states, we propose an entanglement measure $E_{q,s}^{A|B}(ρ)$ based on unified entropy and derive several analytical lower bounds for it using local orthonormal observables. We demonstrate with concrete examples that our lower bounds provide tighter estimates of quantum entanglement than several existing analytical bounds. For multipartite quantum states, based on unified entropy, we propose two measures $A^k_{q,s}(ρ)$ and $G^k_{q,s}(ρ)$ for quantifying $k$-nonseparability, and prove that these measures satisfy several desirable properties, such as faithfulness, local unitary invariance, and convexity. Moreover, we rigorously prove that when the parameters $q$ and $s$ are in certain ranges, $A^k_{q,s}(ρ)$ and $G^k_{q,s}(ρ)$ also satisfy monotonicity and strong monotonicity. Furthermore, we establish the order relations of the measures $A^k_{q,s}(ρ)$ and $G^k_{q,s}(ρ)$ with respect to the parameters $q$ and $s$ for fixed quantum states. In addition, for fixed $q$ and $s$, we also give their order relations for any two pure states.

quant-pharXiv:2608.22684•Aug 25, 2026•0 citations

The uniqueness theorem for entanglement measures

Matthew J. Donald, Michał Horodecki, Oliver Rudolph

We explore and develop the mathematics of the theory of entanglement measures. After a careful review and analysis of definitions, of preliminary results, and of connections between conditions on entanglement measures, we prove a sharpened version of a uniqueness theorem which gives necessary and sufficient conditions for an entanglement measure to coincide with the reduced von Neumann entropy on pure states. We also prove several versions of a theorem on extreme entanglement measures in the case of mixed states. We analyze properties of the asymptotic regularization of entanglement measures proving, for example, convexity for the entanglement cost and for the regularized relative entropy of entangle ment.

arXiv:quant-ph/0105017•Journal of Mathematical Physics•Sep 1, 2002•229 citations
We investigate the asymptotic equipartition property (AEP) in the context of multipartite entanglement measures on pure states. In particular, we formulate AEP for subadditive entanglement measures that admit certain weak conditions. This is motivated by the uniqueness of the entanglement entropy in the asymptotic limit in the bipartite case. From an operational perspective, the result is relevant in the LOCCqscenario (asymptotic local operations and classical communication with a sublinear amount of quantum communication). Analogously to the classical AEP, we show that the regularization of smooth, weakly additive entanglement measures - under mild additional assumptions -yields entanglement measures, that are weakly additive and asymptotically continuous. We then evaluate the mentioned regularization and smoothing procedure for a known family of Rényi type multipartite entanglement measures, showing that the resulting entanglement measures reduce to convex combinations of bipartite entanglement entropies.
Reversible state transformations under entanglement nonincreasing operations give rise to entanglement measures. It is well known that asymptotic local operations and classical communication (LOCC) are required to get a simple operational measure of bipartite pure state entanglement. For bipartite mixed states and multipartite pure states it is likely that a more powerful class of operations will be needed. To this end more powerful versions of state transformations (or reducibilities), namely, LOCCq (asymptotic LOCC with a sublinear amount of quantum communication) and CLOCC (asymptotic LOCC with catalysis) have been considered in the literature. In this paper we show that LOCCq state transformations are only as powerful as asymptotic LOCC state transformations for multipartite pure states. The basic tool we use is multipartite entanglement gambling: Any pure multipartite entangled state can be transformed to an Einstein-Podolsky-Rosen pair shared by some pair of parties and any irreducible m-party pure state (m> 2)(m>~2)(m> 2) can be used to create any other state (pure or mixed) using LOCC. We consider applications of multipartite entanglement gambling to multipartite distillability and to characterizations of multipartite minimal entanglement generating sets. We briefly consider generalizations of this result to mixed states by defining the class of cat-distillable states, i.e., states from which cat states $(|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉)$ may be distilled.
The trade-off relation between the rate and the strong converse exponent for probabilistic asymptotic entanglement transformations between pure multipartite states can in principle be characterised in terms of a class of entanglement measures determined implicitly by a set of strong axioms. A nontrivial family of such functionals has recently been constructed, but their previously known characterisations have so far only made it possible to evaluate them in very simple cases. In this paper we derive a new regularised formula for these functionals in terms of a subadditive upper bound, complementing the previously known superadditive lower bound. The upper and lower bounds evaluated on tensor powers differ by a logarithmically bounded term, which provides a bound on the convergence rate. In addition, we find that on states satisfying a certain sparsity constraint, the upper bound is equal to the value of the corresponding additive entanglement measure, therefore the regularisation is not needed for such states, and the evaluation is possible via a single-letter formula. Our results provide explicit bounds on the success probability of transformations by local operations and classical communication and, due to the additivity of the entanglement measures, also on the strong converse exponent for asymptotic transformations.
Abstract In a recent work by us Ge et al [Phys. Rev. A 110, L010402 (2024)], we have derived a series of polygon relations of bipartite entanglement measures that is useful to reveal entanglement properties of discrete, continuous, and even hybrid multipartite quantum systems. In this work, with the information-theoretical measures of Rényi and Tsallis entropies, we study the relationship between the polygon relation and the subadditivity of entropy. In particular, the entropy-polygon relations are derived for pure multi-qubit states and then generalized to multi-mode Gaussian states, by utilizing the known results from the quantum marginal problem. Then the equivalence between the polygon relation and subadditivity is established, in the sense that for all discrete or continuous multipartite states, the polygon relation holds if and only if the underlying entropy is subadditive. As a byproduct, the subadditivity of Rényi and Tsallis entropies is proven for all bipartite Gaussian states. Finally, the difference between polygon relations and monogamy relations is clarified, and generalizations of our results are discussed. Our work provides a better understanding of the rich structure of multipartite states, and hence is expected to be helpful for the study of multipartite entanglement.
Hoping to simplify the classification of pure entangled states of multi $(m)\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ quantum systems, we study exactly and asymptotically (in n)n)n) reversible transformations among nthn\mathrm{th}nth tensor powers of such states (i.e., nnn copies of the state shared among the same mmm parties) under local quantum operations and classical communication (LOCC). For exact transformations, we show that two states whose marginal one-party entropies agree are either locally unitarily equivalent or else LOCC incomparable. In particular we show that two tripartite Greenberger-Horne-Zeilinger states are LOCC incomparable to three bipartite Einstein-Podolsky-Rosen (EPR) states symmetrically shared among the three parties. Asymptotic transformations yield a simpler classification than exact transformations; for example, they allow all pure bipartite states to be characterized by a single parameter---their partial entropy---which may be interpreted as the number of EPR pairs asymptotically interconvertible to the state in question by LOCC transformations. We show that $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states having an $m\ensuremath{-}\mathrm{w}\mathrm{a}\mathrm{y}$ Schmidt decomposition are similarly parametrizable, with the partial entropy across any nontrivial partition representing the number of standard quantum superposition or ``cat'' states $|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉$ asymptotically interconvertible to the state in question. For general $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ states, partial entropies across different partitions need not be equal, and since partial entropies are conserved by asymptotically reversible LOCC operations, a multicomponent entanglement measure is needed, with each scalar component representing a different kind of entanglement, not asymptotically interconvertible to the other kinds. In particular we show that the m=4m=4m=4 cat state is not isentropic to, and therefore not asymptotically interconvertible to, any combination of bipartite and tripartite states shared among the four parties. Thus, although the m=4m=4m=4 cat state can be prepared from bipartite EPR states, the preparation process is necessarily irreversible, and remains so even asymptotically. For each number of parties mmm we define a minimal reversible entanglement generating set (MREGS) as a set of states of minimal cardinality sufficient to generate all $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states by asymptotically reversible LOCC transformations. Partial entropy arguments provide lower bounds on the size of the MREGS, but for m>2m>2m>2 we know no upper bounds. We briefly consider several generalizations of LOCC transformations, including transformations with some probability of failure, transformations with the catalytic assistance of states other than the states we are trying to transform, and asymptotic LOCC transformations supplemented by a negligible [o(n)][o(n)][o(n)] amount of quantum communication.
In this paper, we investigate the characterization of multipartite entanglement based on the unified (q,s)(q,s)(q,s)-entropy framework. For bipartite quantum states, we propose an entanglement measure Eq,sA∣B(ρ)E_{q,s}^{A|B}(ρ)Eq,sA∣B​(ρ) based on unified entropy and derive several analytical lower bounds for it using local orthonormal observables. We demonstrate with concrete examples that our lower bounds provide tighter estimates of quantum entanglement than several existing analytical bounds. For multipartite quantum states, based on unified entropy, we propose two measures Aq,sk(ρ)A^k_{q,s}(ρ)Aq,sk​(ρ) and Gq,sk(ρ)G^k_{q,s}(ρ)Gq,sk​(ρ) for quantifying kkk-nonseparability, and prove that these measures satisfy several desirable properties, such as faithfulness, local unitary invariance, and convexity. Moreover, we rigorously prove that when the parameters qqq and sss are in certain ranges, Aq,sk(ρ)A^k_{q,s}(ρ)Aq,sk​(ρ) and Gq,sk(ρ)G^k_{q,s}(ρ)Gq,sk​(ρ) also satisfy monotonicity and strong monotonicity. Furthermore, we establish the order relations of the measures Aq,sk(ρ)A^k_{q,s}(ρ)Aq,sk​(ρ) and Gq,sk(ρ)G^k_{q,s}(ρ)Gq,sk​(ρ) with respect to the parameters qqq and sss for fixed quantum states. In addition, for fixed qqq and sss, we also give their order relations for any two pure states.
We explore and develop the mathematics of the theory of entanglement measures. After a careful review and analysis of definitions, of preliminary results, and of connections between conditions on entanglement measures, we prove a sharpened version of a uniqueness theorem which gives necessary and sufficient conditions for an entanglement measure to coincide with the reduced von Neumann entropy on pure states. We also prove several versions of a theorem on extreme entanglement measures in the case of mixed states. We analyze properties of the asymptotic regularization of entanglement measures proving, for example, convexity for the entanglement cost and for the regularized relative entropy of entangle ment.