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.40215

Universal distillation of quantum entanglement

Ryuji Takagi, Kaito Watanabe, Takaya Matsuura, Hayato Arai, Masahito Hayashi

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 2 citations
arXivHTMLPDF

Abstract

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.

AI Summary

Can a fixed LOCC protocol distill entanglement from an unknown bipartite state at the same asymptotic rate as a protocol designed with full knowledge of that state? This paper answers affirmatively for arbitrary finite-dimensional i.i.d. inputs: $E_d(\rho_{AB})$ is universally achievable. The protocol has a measurement-dependent, announced output length; for every state, its average trace-distance error vanishes and the probability of obtaining a rate below $E_d(\rho_{AB})-\delta$ tends to zero for every $\delta>0$. The construction combines tomography on a sublinear number of copies with state merging for compound sources. First, it establishes universal achievability of the hashing bound $I_c(A|B)_\rho$, requiring only $O(\log d_A+\log d_B+\log n)$ bits of backward classical communication. To reach $E_d$, it uses LOCC preprocessing followed by compound-source merging. A canonical measurement representation controls coherent-information continuity without bounding Bob’s output dimension. The main technical result is uniform convergence of regularized, LOCC-optimized coherent information to $E_d$ on compact subsets of full-rank distillable states. Vanishing depolarizing noise handles rank-deficient inputs. As a channel application, $E_d(J_{\mathcal N})$ is universally achievable with LOCC assistance, attaining the two-way quantum capacity for teleportation-covariant channels. The result is information-theoretic, not computationally efficient, and concerns first-order asymptotic rates with statewise convergence. Non-i.i.d. sources, second-order rates, and optimal error exponents remain open. Universal achievement of the one-way distillable rate still uses backward communication, albeit at vanishing rate.

No sign of AI-generated textAI use disclosed
ChatGPT 5.6 Sol and 6 Astra were used to find technical mistakes and their revision, which were reviewed by the authors.

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

Comments
7+17 pages; See also an independent work by Tirone et al. posted concurrently on arXiv with this manuscript

Related papers

Universal Entanglement Distillation

Salvatore Tirone, Francesco Anna Mele, Vittorio Giovannetti +1 more

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.

quant-pharXiv:2609.40080•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

Bell-pair distillation under imperfect operations

András Kinyó, Tamás Kiss, Orsolya Kálmán

We recently proposed an entanglement distillation protocol based on local operations and classical communication that probabilistically and universally distills a maximally entangled Bell pair from multiple copies of an unknown two-qubit state [Phys. Rev. Lett. 135, 260202 (2025)]. Here, we investigate the robustness of this protocol against imperfections in its implementation. We consider several incoherent and coherent gate-error models, as well as measurement readout errors, and determine the regimes in which distillation enhances the fidelity with the target Bell state. We find that the protocol remains effective over substantial error ranges, although its robustness depends strongly on the type of error. We further analyze asymmetric errors between the two parties and identify conditions under which complementary postselection outcomes yield identical distillation dynamics, allowing the success probability to be enhanced.

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

Universal quantum resource distillation via composite generalised quantum Stein's lemma

Ludovico Lami, Bartosz Regula, Ryuji Takagi

The performance of quantum resource manipulation protocols, including key examples such as distillation of quantum entanglement, is measured in terms of the rate at which desired target states can be produced from a given noisy state. However, to achieve optimal rates, known protocols require precise tailoring to the quantum state in question, demanding a perfect knowledge of the input and allowing no errors in its preparation. Here we show that distillation of quantum resources in the framework of resource non-generating operations can be performed universally: optimal rates of distillation can be achieved with no knowledge of the input state whatsoever, certifying the robustness of quantum resource distillation. The findings apply in particular to the purification of quantum entanglement under non-entangling maps, where the optimal rates are governed by the regularised relative entropy of entanglement. Our result relies on an extension of the generalised quantum Stein's lemma in quantum hypothesis testing to a composite setting where the null hypothesis is no longer a fixed quantum state, but is rather composed of i.i.d. copies of an unknown state. The solution of this asymptotic problem is made possible through new developments in one-shot quantum information and a refinement of the blurring technique from [Lami, arXiv:2408.06410].

quant-pharXiv:2605.15174•May 15, 2026•11 citations

One-shot entanglement distillation beyond local operations and classical communication

Bartosz Regula, Kun Fang, Xin Wang +1 more

Abstract We study the task of entanglement distillation in the one-shot setting under different classes of quantum operations which extend the set of local operations and classical communication (LOCC). Establishing a general formalism which allows for a straightforward comparison of their exact achievable performance, we relate the fidelity of distillation under these classes of operations with a family of entanglement monotones and the rates of distillation with a class of smoothed entropic quantities based on the hypothesis testing relative entropy. We then characterise exactly the one-shot distillable entanglement of several classes of quantum states and reveal many simplifications in their manipulation. We show in particular that the ε-error one-shot distillable entanglement of any pure state is the same under all sets of operations ranging from one-way LOCC to separability-preserving operations or operations preserving the set of states with positive partial transpose, and can be computed exactly as a quadratically constrained linear program. We establish similar operational equivalences in the distillation of isotropic and maximally correlated states, reducing the computation of the relevant quantities to linear or semidefinite programs. We also show that all considered sets of operations achieve the same performance in environment-assisted entanglement distillation from any state.

arXiv:1906.01648•New Journal of Physics•Sep 24, 2019•40 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
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.
Can a fixed LOCC protocol distill entanglement from an unknown bipartite state at the same asymptotic rate as a protocol designed with full knowledge of that state? This paper answers affirmatively for arbitrary finite-dimensional i.i.d. inputs: Ed(ρAB)E_d(\rho_{AB})Ed​(ρAB​) is universally achievable. The protocol has a measurement-dependent, announced output length; for every state, its average trace-distance error vanishes and the probability of obtaining a rate below Ed(ρAB)−δE_d(\rho_{AB})-\deltaEd​(ρAB​)−δ tends to zero for every δ>0\delta>0δ>0.
The construction combines tomography on a sublinear number of copies with state merging for compound sources. First, it establishes universal achievability of the hashing bound Ic(A∣B)ρI_c(A|B)_\rhoIc​(A∣B)ρ​, requiring only O(log⁡dA+log⁡dB+log⁡n)O(\log d_A+\log d_B+\log n)O(logdA​+logdB​+logn) bits of backward classical communication. To reach EdE_dEd​, it uses LOCC preprocessing followed by compound-source merging. A canonical measurement representation controls coherent-information continuity without bounding Bob’s output dimension. The main technical result is uniform convergence of regularized, LOCC-optimized coherent information to EdE_dEd​ on compact subsets of full-rank distillable states. Vanishing depolarizing noise handles rank-deficient inputs.
As a channel application, Ed(JN)E_d(J_{\mathcal N})Ed​(JN​) is universally achievable with LOCC assistance, attaining the two-way quantum capacity for teleportation-covariant channels. The result is information-theoretic, not computationally efficient, and concerns first-order asymptotic rates with statewise convergence. Non-i.i.d. sources, second-order rates, and optimal error exponents remain open. Universal achievement of the one-way distillable rate still uses backward communication, albeit at vanishing rate.
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 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 recently proposed an entanglement distillation protocol based on local operations and classical communication that probabilistically and universally distills a maximally entangled Bell pair from multiple copies of an unknown two-qubit state [Phys. Rev. Lett. 135, 260202 (2025)]. Here, we investigate the robustness of this protocol against imperfections in its implementation. We consider several incoherent and coherent gate-error models, as well as measurement readout errors, and determine the regimes in which distillation enhances the fidelity with the target Bell state. We find that the protocol remains effective over substantial error ranges, although its robustness depends strongly on the type of error. We further analyze asymmetric errors between the two parties and identify conditions under which complementary postselection outcomes yield identical distillation dynamics, allowing the success probability to be enhanced.
The performance of quantum resource manipulation protocols, including key examples such as distillation of quantum entanglement, is measured in terms of the rate at which desired target states can be produced from a given noisy state. However, to achieve optimal rates, known protocols require precise tailoring to the quantum state in question, demanding a perfect knowledge of the input and allowing no errors in its preparation. Here we show that distillation of quantum resources in the framework of resource non-generating operations can be performed universally: optimal rates of distillation can be achieved with no knowledge of the input state whatsoever, certifying the robustness of quantum resource distillation. The findings apply in particular to the purification of quantum entanglement under non-entangling maps, where the optimal rates are governed by the regularised relative entropy of entanglement. Our result relies on an extension of the generalised quantum Stein's lemma in quantum hypothesis testing to a composite setting where the null hypothesis is no longer a fixed quantum state, but is rather composed of i.i.d. copies of an unknown state. The solution of this asymptotic problem is made possible through new developments in one-shot quantum information and a refinement of the blurring technique from [Lami, arXiv:2408.06410].
Abstract We study the task of entanglement distillation in the one-shot setting under different classes of quantum operations which extend the set of local operations and classical communication (LOCC). Establishing a general formalism which allows for a straightforward comparison of their exact achievable performance, we relate the fidelity of distillation under these classes of operations with a family of entanglement monotones and the rates of distillation with a class of smoothed entropic quantities based on the hypothesis testing relative entropy. We then characterise exactly the one-shot distillable entanglement of several classes of quantum states and reveal many simplifications in their manipulation. We show in particular that the ε-error one-shot distillable entanglement of any pure state is the same under all sets of operations ranging from one-way LOCC to separability-preserving operations or operations preserving the set of states with positive partial transpose, and can be computed exactly as a quadratically constrained linear program. We establish similar operational equivalences in the distillation of isotropic and maximally correlated states, reducing the computation of the relevant quantities to linear or semidefinite programs. We also show that all considered sets of operations achieve the same performance in environment-assisted entanglement distillation from any state.
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.