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.
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.
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.
We establish two results on the asymptotic equipartition property (AEP) for quantum channels. First, the AEP formulated using smoothing over completely positive trace-preserving maps fails in general. Second, the AEP with smoothing over subchannels (completely positive trace-nonincreasing maps) is equivalent to the strong converse for parallel quantum channel Stein's lemma, to a sharp threshold for the channel hockey-stick divergence, and to an AEP for the channel Lorenz divergence. The counterexample reveals a surprising separation between channel and subchannel smoothing. Although states and classical channels admit a sharp, dimension-independent completion bound, which we establish, the corresponding single-shot gap for quantum channels is unbounded already for qubits. This separation persists asymptotically: we construct qutrit channel pairs with finite max-relative entropy whose CPTP-smoothed rate strictly exceeds the regularized channel relative entropy. The asymptotic gap between channel and subchannel smoothing is unbounded across the family, even when the subchannel approximation error decays exponentially. To establish the equivalences, we develop a uniform filter that converts Lorenz smoothing into a single nearby subchannel. The four conjectured formulations thus share a common asymptotic threshold, whose validity for general channel pairs remains open. Together, these results separate this threshold question from the obstruction imposed by exact trace preservation.
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.
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 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(ρ) and Gq,sk(ρ) 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, Aq,sk(ρ) and Gq,sk(ρ) also satisfy monotonicity and strong monotonicity. Furthermore, we establish the order relations of the measures Aq,sk(ρ) and Gq,sk(ρ) 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.
Abstract Quantum entanglement and quantum entropy are crucial concepts in the study of multipartite quantum systems. In this work, we show how the notion of concurrence vector, re-expressed in a particularly useful form, provides new insights and computational tools for the analysis of both. In particular, using this approach for a general multipartite pure state, one can easily prove known relations in an easy way and to build up new relations between the concurrences associated with the different bipartitions. The approach is also useful to derive sufficient conditions for genuine entanglement in generic multipartite systems that are computable in polynomial time. From an entropy-of-entanglement perspective, the approach is powerful to prove properties of the Tsallis-2 entropy, such as the subadditivity, and to derive new ones, e.g., a modified version of the strong subadditivity which is always fulfilled; thanks to the purification theorem these results hold for any multipartite state, whether pure or mixed.
Multipartite entanglement is the premier resource for quantum technologies. Yet, its exact quantification in the laboratory is notoriously challenging, typically requiring the full knowledge of high dimensional quantum states. Here, we construct observable bounds to multipartite entanglement for systems of arbitrary size, which are functions of the local and global state purities, and correlation functions. First, we derive experimentally accessible upper and lower limits to both the bipartite entanglement of formation and the squashed entanglement of bipartite systems, by leveraging cornerstone results of quantum information theory: the entropy strong subadditivity inequality and the Koashi-Winter monogamy relation. Then, we convert them into bounds to the entanglement up to degree k for arbitrary states, and to the genuine k-partite entanglement, by employing a recently proposed method. Finally, we analytically and numerically test these results, by bounding the multipartite entanglement of several relevant states and mixtures, including the important classes of GHZ, Dicke, W states, and random pure states.