Skip to content
Preprint

Very Strong Irreversibility of Quantum Entanglement

Jul 2026 · 0 citations · 38 references
Physics

Abstract

The manipulation of quantum entanglement is fundamentally irreversible: some mixed entangled states require pure entanglement for their preparation, although no pure entanglement can be recovered from them by local operations and classical communication. This irreversibility is known to persist even under the maximal class of operations that do not generate entanglement, revealing a fundamental distinction between entanglement theory and thermodynamics. We construct cases for which any attempt to restore reversibility necessarily incurs an error that increases exponentially with the number of copies. Technically, we demonstrate a strict separation between the exponential strong-converse distillable entanglement and the exponential strong-converse entanglement cost. Our result resolves a conjecture posed by Lami and Regula (Nat. Phys. 19, 184-189 (2023)) and strengthens it by showing that the irreversibility of entanglement persists even at the level of polynomially (in the number of copies) growing error. We further derive a semidefinite-programming lower bound on the exponential strong-converse cost under non-entangling operations. Finally, for the class of completely PPT-preserving operations, we construct analytically solvable families of antisymmetric states exhibiting the exponential strong-converse irreversibility. Remarkably, to our knowledge, no analogous separation between exponential strong converse cost and the analogous distillable entanglement is currently known even under the more restrictive class of LOCC operations.

View source

Similar papers

Open access Sep 2026

Multipartite k ‐Entanglement Measures and Coherence

Characterizing the entanglement in multipartite quantum systems remains a central challenge in the theory of quantum entanglement. We establish a comprehensive framework for constructing ‐entanglement measures by leveraging bipartite entanglement measures and general ‐entanglement measures () with arithmetic and geometric averaging schemes. Numerical examples demonstrate that these measures outperform the existing ones, such as ‐ME concurrence, geometric mean (k‐GM) concurrence, and the generalized ‐entanglement measure by inducing distinct entanglement orderings and offering superior resolution. Furthermore, we reveal the operational relationship between the ‐entanglement and the local quantum coherence, verifying that the persistence of entanglement is intrinsically constrained by the system's capacity to maintain the local coherence. Finally, to overcome the inherent limitation of the conventional three‐tangle in characterizing the genuine multipartite entanglement of the GHZ‐W mixed states, we design a novel GME measure. Numerical results confirm that this measure effectively eliminates the detection blind spots where vanishes, providing a complete and practical mathematical tool for the quantitative analysis of genuine multipartite quantum correlations.

Zi-Han Chen, Hui Zhao, Shao-Ming Fei et al. · 0 citations
Preprint Aug 2026

Flood of multipartite Rains entanglement

Multipartite entanglement admits phenomena such as the activation of genuine multipartite entanglement (GME) and the existence of inequivalent classes of entanglement, and existing bipartite entanglement measures have no unique generalization to this regime. In this work, we define the Rains, monsoon, hurricane, and squall entanglement as generalizations of the bipartite Rains relative entropy, and we establish various properties of these entanglement measures. We also prove that the Rains entanglement is monotone under selective quantum operations that completely preserve the positivity of the partial transpose. We establish single-letter upper bounds on the one-shot and asymptotic rates at which a fixed pure state can be distilled from an arbitrary state in both the standard and probabilistic approximate distillation scenarios. Among the entanglement measures we define, the tightest upper bound on the one-shot pure-state distillation rate is in terms of the Rains entanglement. However, the activation of GME (or, equivalently, the tensor instability of biseparability) makes it unclear if the one-shot bound in terms of the Rains entanglement can be extended to a single-letter asymptotic bound. Instead, we establish upper bounds on the asymptotic pure-state distillation rate in terms of the hurricane and squall entanglement. Upper bounds on the GHZ- and W-distillable entanglement follow as a consequence. Additionally, we define the multipartite max-Rains entanglement, write it as a semidefinite program, and derive a dual program for it. Finally, we analyze these measures for quantum pairwise independent networks, and we establish a conditional gradient (Frank-Wolfe) algorithm for computing the Rains entanglement.

Hailey S. Murray, Sagnik Bhattacharya, M. Cerezo et al. · 0 citations
Preprint Aug 2026

Entangling capability of coherently controlled quantum processes

We analytically characterize entanglement generation by two paradigmatic coherently controlled quantum processes, the quantum switch and time-flip. Retaining rather than measuring or discarding the control, we treat the control and target as the bipartite system and assume pure product inputs, so that any output entanglement reflects the entangling capability of the process. For the switch of qubit unitaries, we derive exact expressions for entanglement, together with a geometric characterization and a coherence-entanglement conservation relation. We then extend our analysis to binary random unitary, Pauli, amplitude damping, and generalized amplitude damping channels. We prove that switch of channels commuting under composition cannot entangle a separable input. Yet maximal entanglement is possible even with dissipation, e.g., an entanglement-breaking damping channel switched with a bit-flip can transform a product input into a maximally entangled state. For two generalized amplitude damping channels, a common stationary state prevents entanglement, while different stationary populations can enable it. We present an analogous study for the time-flip of unitary and binary random unitary channels. Our findings provide a systematic analysis of how much entanglement can be generated by coherent control of channel order or input-output direction.

Beyza Aslanbaş, Bedirhan Alkan, G. Karpat · 0 citations
Preprint Aug 2026

PPT Entanglement with Correlated Catalysis: Monotones and Irreversibility

Quantum catalysts can overcome otherwise impossible quantum state transformations without being consumed, and allowing them to become correlated with the output makes this assistance substantially more powerful. This raises a fundamental question for entanglement theory: which limitations on state manipulation remain when such correlated catalysts are freely available? We answer this question in the positive-partial-transpose (PPT) resource theory, which allows a substantially broader class of operations than local operations and classical communication (LOCC). We identify general conditions under which regularized relative-entropy measures become strongly superadditive, and use them to construct monotones that constrain correlated catalytic PPT transformations without any knowledge of the catalyst. In particular, we prove that the regularized PPT relative entropy is fully additive and strongly superadditive, resolving an open problem in entanglement theory. Most importantly, these constraints show that even arbitrary correlated catalysts cannot restore asymptotic reversibility: for an explicit state, the optimal entanglement distillation rate remains strictly smaller than the entanglement cost. Thus, substantial catalytic assistance does not remove some of the fundamental limitations of mixed-state entanglement manipulation.

Jin Ao, Aby Philip, Alexander Streltsov · 0 citations
Preprint Jul 2026

Equi-Entropic Maps for Four-Partite Quantum States

Absolutely maximally entangled states represent a highly constrained form of multipartite entanglement and play an important role in quantum information theory. We investigate a weaker form of uniformity of entanglement for four-party systems of local dimension $d>2$ that requires the three balanced bipartitions to have equal but not necessarily maximal linear entropy. We introduce a linear map $\Xi$ that enforces exact equality of entropies under reshuffling and partial transposition. The transformation arises as the asymptotic limit of an iterative averaging procedure and admits a group-theoretic description in terms of permutations of tensor indices. For Haar-random unitary inputs, a leading-moment analysis supported by numerical simulations predicts highly entangled outputs whose common entropy approaches the maximal value as the local dimension grows. We characterize the algebraic structure, fixed points, and asymptotic behavior of this map and its relation to two-unitary matrices and orthogonal Latin squares.

Wojciech Bruzda, Zahra Raissi · 0 citations
Preprint Aug 2026

Entanglement Generation Beyond Quantum Theory: From Product States to Popescu-Rohrlich Boxes

Entanglement generation is a fundamental dynamical capability in quantum information science and underpins many quantum advantages. While quantum theory enables it through unitary dynamics, boxworld, a generalized probabilistic theory admitting Popescu--Rohrlich boxes with supraquantum correlations, has no reversible transformation capable of generating entanglement. We show that this no-go picture changes fundamentally once reversibility is relaxed to pure-state preservation. We construct a pure-state-preserving transformation that maps every uncorrelated pure state to a Popescu--Rohrlich box and completely classify all pure-state-preserving entangling transformations in the simplest bipartite boxworld. Our results provide the first explicit mechanism for generating beyond-quantum entanglement without introducing mixing and demonstrate a physical distinction between reversibility and pure-state preservation that is obscured by the structure of quantum theory.

Shun Umekawa, Akihiro Hokkyo, Hayato Arai et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.