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

Universal Entanglement Distillation

Salvatore Tirone, Francesco Anna Mele, Vittorio Giovannetti, Ludovico Lami

quant-phcs.ITSubmitted Sep 30, 2026• Announced Oct 1, 2026• 2 citations
arXivHTMLPDF

Abstract

We present a universal entanglement distillation protocol that asymptotically achieves the distillable entanglement of any unknown bipartite state in a fixed finite dimension. That is, its ebit yield attains every rate below the optimum that would be available if the state were known, with vanishing trace-distance error. Our approach combines tomography by local operations and classical communication with an adaptive distillation routine, using a local robustness lemma to control finite-sample estimation errors. We also characterize worst-case distillation from a family of states: the optimal uniform rate is the minimum distillable entanglement on the family's closure. These results show that ignorance of the state need not incur an asymptotic rate penalty.

AI Summary

The paper asks whether an unknown i.i.d. bipartite mixed state can be distilled by LOCC without losing asymptotic rate relative to protocols given its classical description. For fixed, known local dimension $d$, it proves the existence of a single state-agnostic protocol that, for every state $\rho$ and every $0<R<E_d(\rho)$, produces at least $\lceil Rn\rceil$ ebits with probability tending to one and vanishing trace-distance error. The announced output size may be random; the error guarantee is averaged over that size. The central ingredient is a local robustness lemma: every rate strictly below $E_d(\rho)$ is achievable by one sequence of LOCC maps uniformly throughout a sufficiently small neighborhood of $\rho$. This also implies lower semicontinuity of $E_d$. The universal construction spends $o(n)$ copies on LOCC tomography, then selects a robust distillation routine from a slowly expanding finite menu. The tomography procedure combines separable-resource teleportation, tomography at one party, and classical inversion, requiring $O((d^6+d^2\log(1/\delta))/\varepsilon^2)$ copies for trace-distance accuracy $\varepsilon$ and failure probability $\delta$. For any nonempty family $\mathcal X$, the optimal uniform worst-case rate is $\min_{\rho\in\overline{\mathcal X}}E_d(\rho)$. Its achievability follows from robustness, tomography, and a finite-cover argument on the compact closure. The protocol is a non-constructive asymptotic existence result, not an efficient distillation algorithm or a method for calculating $E_d$. It assumes finite dimension and i.i.d. inputs. Optimal LOCC tomography sample complexity and multipartite extensions remain open.

Little sign of AI-generated textAI use disclosedOverclaimsMissing comparison
ChatGPT 5.5 was later used to improve the main result by refining one of the proofs suitably adapting our human-generated arguments.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
33 pages, 1 figure. See also the independent work by Takagi et al., which appeared on the arXiv today

Related papers

Universal distillation of quantum entanglement

Ryuji Takagi, Kaito Watanabe, Takaya Matsuura +2 more

Distillable entanglement---the maximum rate of Bell states extractable from the given noisy entangled states via local operations and classical communication (LOCC)---has been a central quantity to characterize the operational value of entangled states. However, this operational meaning had been known to be valid only under a crucial assumption: both parties know the description of the input state and can choose the protocol tailored to it, which does not necessarily reflect the natural operational setting. Here, we show that the distillable entanglement is the fundamental operational quantity even without this assumption. We present a universal LOCC protocol---whose description does not depend on the input state and thus works universally for any input---that achieves the distillable entanglement of an arbitrary unknown input state. Our result therefore lifts the distillable entanglement to a robust notion of an operationally meaningful quantity and clarifies that input-state knowledge is not necessary to achieve the optimal rate of entanglement distillation. Our protocol is based on state merging for compound states, together with the uniform convergence property of the finite-block quantity toward distillable entanglement.

quant-pharXiv:2609.40215•Oct 1, 2026•2 citations

Computational entanglement distillation beyond pure states: efficient protocols and fundamental limitations

Takeru Utsumi, Jacopo Rizzo, Ryuji Takagi +1 more

The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.

quant-pharXiv:2610.06787•Oct 6, 2026•0 citations

Distillable entanglement is continuous

Lukas Schmitt, David Sutter

We prove continuity of distillable entanglement, the optimal asymptotic rate at which copies of a bipartite state can be converted into maximally entangled pairs by local operations and classical communication (LOCC) with vanishing error. We establish an explicit asymptotic continuity bound that holds for arbitrary bipartite states and depends logarithmically on the system dimension. This bound has the same structure as known continuity bounds for conditional entropy, entanglement cost, and relative entropy of entanglement. Our proof constructs an explicit LOCC protocol that converts either of two arbitrary bipartite states into the other at an ebit cost that vanishes as their trace distance tends to zero.

quant-pharXiv:2610.35722•Oct 27, 2026•0 citations

Asymptotic adaptive bipartite entanglement-distillation protocol

Erik Hostens, Jeroen Dehaene, Bart De Moor

We present an asymptotic bipartite entanglement-distillation protocol that outperforms all existing asymptotic schemes. This protocol is based on the breeding protocol with the incorporation of two-way classical communication. Like breeding, the protocol starts with an infinite number of copies of a Bell-diagonal mixed state. Breeding can be carried out as successive stages of partial information extraction, yielding the same result: one bit of information is gained at the cost (measurement) of one pure Bell state pair (ebit). The basic principle of our protocol is at every stage to replace measurements on ebits by measurements on a finite number of copies, whenever there are two equiprobable outcomes. In that case, the entropy of the global state is reduced by more than one bit. Therefore, every such replacement results in an improvement of the protocol. We explain how our protocol is organized as to have as many replacements as possible. The yield is then calculated for Werner states.

arXiv:quant-ph/0602205•Physical Review A•Jun 30, 2006•32 citations

Heuristic Lookahead Distillation Protocol Search

Matthew Barber, Stefano Pirandola

Bipartite qubit entanglement distillation is the process of converting noisy ebits into pure ebits using only local operations and classical communication. This is a core operation for quantum repeaters, enabling such crucial tasks as long-distance quantum communication and distributed quantum computing. In this work, we introduce a method for searching for entanglement distillation protocols and, using this technique, distil qubit Werner states at a higher rate than could be achieved using previously discovered protocols. In particular, we demonstrate the advantage of our new distillation strategy by improving the best-known lower bound for the two-way-assisted quantum capacity of the qubit depolarising channel across a wide range of channel parameters, making progress in one of the long-standing problems of quantum information theory.

quant-pharXiv:2608.13644•Aug 17, 2026•4 citations

Universal quantum coding

Jacopo Rizzo, Filippo Girardi, Ludovico Lami +2 more

Entanglement distillation from noisy bipartite states and reliable quantum communication over noisy channels are fundamental tasks in quantum information theory. Yet existing coding schemes typically require prior knowledge of the underlying state or channel, or assume independent or weakly correlated quantum information sources. Here, using Schur-Weyl duality, we establish a universal quantum error-correction principle that overcomes these limitations. We show that the irreducible permutation spaces arising from the local Schur-Weyl decomposition of multiple copies of an unknown bipartite mixed state form maximally entangled quantum code spaces whose error structure is governed entirely by representation theory. Correcting these symmetry-resolved errors yields protocols for entanglement distillation and quantum communication that achieve coherent-information rates with exponentially vanishing error and optimal second-order corrections, even in the case of almost i.i.d. resources. Our approach also provides sharp finite-copy guarantees that are worst-case optimal at every finite block length, including in the sample-efficient regime, where the number of copies scales only polynomially with the number of qubits. Together, these results establish Schur-Weyl duality as a general mechanism for universal, robust, and optimal quantum coding, unifying entanglement distillation, quantum error correction, and quantum communication within a common representation-theoretic framework.

quant-pharXiv:2609.38038•Sep 30, 2026•2 citations
We present a universal entanglement distillation protocol that asymptotically achieves the distillable entanglement of any unknown bipartite state in a fixed finite dimension. That is, its ebit yield attains every rate below the optimum that would be available if the state were known, with vanishing trace-distance error. Our approach combines tomography by local operations and classical communication with an adaptive distillation routine, using a local robustness lemma to control finite-sample estimation errors. We also characterize worst-case distillation from a family of states: the optimal uniform rate is the minimum distillable entanglement on the family's closure. These results show that ignorance of the state need not incur an asymptotic rate penalty.
The paper asks whether an unknown i.i.d. bipartite mixed state can be distilled by LOCC without losing asymptotic rate relative to protocols given its classical description. For fixed, known local dimension ddd, it proves the existence of a single state-agnostic protocol that, for every state ρ\rhoρ and every 0<R<Ed(ρ)0<R<E_d(\rho)0<R<Ed​(ρ), produces at least ⌈Rn⌉\lceil Rn\rceil⌈Rn⌉ ebits with probability tending to one and vanishing trace-distance error. The announced output size may be random; the error guarantee is averaged over that size.
The central ingredient is a local robustness lemma: every rate strictly below Ed(ρ)E_d(\rho)Ed​(ρ) is achievable by one sequence of LOCC maps uniformly throughout a sufficiently small neighborhood of ρ\rhoρ. This also implies lower semicontinuity of EdE_dEd​. The universal construction spends o(n)o(n)o(n) copies on LOCC tomography, then selects a robust distillation routine from a slowly expanding finite menu. The tomography procedure combines separable-resource teleportation, tomography at one party, and classical inversion, requiring O((d6+d2log⁡(1/δ))/ε2)O((d^6+d^2\log(1/\delta))/\varepsilon^2)O((d6+d2log(1/δ))/ε2) copies for trace-distance accuracy ε\varepsilonε and failure probability δ\deltaδ.
For any nonempty family X\mathcal XX, the optimal uniform worst-case rate is min⁡ρ∈X‾Ed(ρ)\min_{\rho\in\overline{\mathcal X}}E_d(\rho)minρ∈X​Ed​(ρ). Its achievability follows from robustness, tomography, and a finite-cover argument on the compact closure.
The protocol is a non-constructive asymptotic existence result, not an efficient distillation algorithm or a method for calculating EdE_dEd​. It assumes finite dimension and i.i.d. inputs. Optimal LOCC tomography sample complexity and multipartite extensions remain open.
Distillable entanglement---the maximum rate of Bell states extractable from the given noisy entangled states via local operations and classical communication (LOCC)---has been a central quantity to characterize the operational value of entangled states. However, this operational meaning had been known to be valid only under a crucial assumption: both parties know the description of the input state and can choose the protocol tailored to it, which does not necessarily reflect the natural operational setting. Here, we show that the distillable entanglement is the fundamental operational quantity even without this assumption. We present a universal LOCC protocol---whose description does not depend on the input state and thus works universally for any input---that achieves the distillable entanglement of an arbitrary unknown input state. Our result therefore lifts the distillable entanglement to a robust notion of an operationally meaningful quantity and clarifies that input-state knowledge is not necessary to achieve the optimal rate of entanglement distillation. Our protocol is based on state merging for compound states, together with the uniform convergence property of the finite-block quantity toward distillable entanglement.
The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.
We prove continuity of distillable entanglement, the optimal asymptotic rate at which copies of a bipartite state can be converted into maximally entangled pairs by local operations and classical communication (LOCC) with vanishing error. We establish an explicit asymptotic continuity bound that holds for arbitrary bipartite states and depends logarithmically on the system dimension. This bound has the same structure as known continuity bounds for conditional entropy, entanglement cost, and relative entropy of entanglement. Our proof constructs an explicit LOCC protocol that converts either of two arbitrary bipartite states into the other at an ebit cost that vanishes as their trace distance tends to zero.
We present an asymptotic bipartite entanglement-distillation protocol that outperforms all existing asymptotic schemes. This protocol is based on the breeding protocol with the incorporation of two-way classical communication. Like breeding, the protocol starts with an infinite number of copies of a Bell-diagonal mixed state. Breeding can be carried out as successive stages of partial information extraction, yielding the same result: one bit of information is gained at the cost (measurement) of one pure Bell state pair (ebit). The basic principle of our protocol is at every stage to replace measurements on ebits by measurements on a finite number of copies, whenever there are two equiprobable outcomes. In that case, the entropy of the global state is reduced by more than one bit. Therefore, every such replacement results in an improvement of the protocol. We explain how our protocol is organized as to have as many replacements as possible. The yield is then calculated for Werner states.
Bipartite qubit entanglement distillation is the process of converting noisy ebits into pure ebits using only local operations and classical communication. This is a core operation for quantum repeaters, enabling such crucial tasks as long-distance quantum communication and distributed quantum computing. In this work, we introduce a method for searching for entanglement distillation protocols and, using this technique, distil qubit Werner states at a higher rate than could be achieved using previously discovered protocols. In particular, we demonstrate the advantage of our new distillation strategy by improving the best-known lower bound for the two-way-assisted quantum capacity of the qubit depolarising channel across a wide range of channel parameters, making progress in one of the long-standing problems of quantum information theory.
Entanglement distillation from noisy bipartite states and reliable quantum communication over noisy channels are fundamental tasks in quantum information theory. Yet existing coding schemes typically require prior knowledge of the underlying state or channel, or assume independent or weakly correlated quantum information sources. Here, using Schur-Weyl duality, we establish a universal quantum error-correction principle that overcomes these limitations. We show that the irreducible permutation spaces arising from the local Schur-Weyl decomposition of multiple copies of an unknown bipartite mixed state form maximally entangled quantum code spaces whose error structure is governed entirely by representation theory. Correcting these symmetry-resolved errors yields protocols for entanglement distillation and quantum communication that achieve coherent-information rates with exponentially vanishing error and optimal second-order corrections, even in the case of almost i.i.d. resources. Our approach also provides sharp finite-copy guarantees that are worst-case optimal at every finite block length, including in the sample-efficient regime, where the number of copies scales only polynomially with the number of qubits. Together, these results establish Schur-Weyl duality as a general mechanism for universal, robust, and optimal quantum coding, unifying entanglement distillation, quantum error correction, and quantum communication within a common representation-theoretic framework.