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

Distillable entanglement is continuous

Lukas Schmitt, David Sutter

quant-phSubmitted Oct 26, 2026• Announced Oct 27, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper addresses whether two-way LOCC distillable entanglement $E_D$ is continuous for arbitrary finite-dimensional bipartite states. Previous results established lower semicontinuity and continuity inside the set of distillable states, but did not cover all boundary cases, including approaches to pure states or to the distillable–nondistillable boundary. For $\tfrac12\|\rho-\sigma\|_1\leq\varepsilon<1/16$ and $d=\min\{\dim A,\dim B\}$, it proves the asymptotic continuity bound $|E_D(\rho)-E_D(\sigma)|\leq4\sqrt{\varepsilon}\log d+4h(\sqrt{\varepsilon})$, where $h$ is binary entropy and logarithms are base two. Thus the dimension dependence is logarithmic, with no spectral assumptions on either state. The proof is operational. An LOCC conversion protocol turns $n+O(n^{2/3})$ copies of either state into an approximation of $n-O(n^{2/3})$ copies of the other, with vanishing error and an auxiliary ebit cost per copy tending to zero with their trace distance. It first prepares a common intermediate mixture, then extracts the target using a nonlocal projective measurement. A collective Grover-search procedure locates rare measurement outcomes, reducing the entanglement expenditure. Concatenating conversion with distillation, and bounding the net gain achievable with supplied ebits, yields continuity. The same construction gives the displayed bound for entanglement cost $E_C$, although the paper notes that an existing continuity bound for $E_C$ is slightly tighter. The conversion result concerns asymptotic, vanishing-error protocols; it does not provide a finite-copy performance guarantee.

No sign of AI-generated text

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

Comments
17 pages, 2 figures

Related papers

Error exponents for tripartite-to-bipartite entanglement transformations

Péter Vrana

We consider distillation of ebits between a specified pair of subsystems from pure tripartite states by local operations and classical communication. It is known that, allowing an asymptotically vanishing error, the maximal rate is the minimum of the von Neumann entropies of the two corresponding marginals, and under asymptotic stochastic local operations and classical communication the maximal rate is given by a minimization over a one-parameter family of entanglement measures. In this paper, we determine the direct and strong converse error exponents, and the optimal rate for deterministic transformations.

arXiv:2507.13778•Jul 18, 2025•0 citations

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

The Asymptotic Spectrum of LOCC Transformations

Asger Kjærulff Jensen, Péter Vrana

We study the exact, non-deterministic conversion of multipartite pure quantum states into one-another via local operations and classical communication (LOCC) and asymptotic entanglement transformation under such channels. In particular, we consider the maximal number of copies of any given target state that can be extracted exactly from many copies of any given initial state as a function of the exponential decay in the success probability, known as the converse error exponent. We give a formula for the optimal rate presented as an infimum over the asymptotic spectrum of LOCC conversion. A full understanding of exact asymptotic extraction rates between pure states in the converse regime thus depends on a full understanding of this spectrum. We present a characterization of spectral points and use it to describe the spectrum in the bipartite case. This leads to a full description of the spectrum and thus an explicit formula for the asymptotic extraction rate between pure bipartite states, given a converse error exponent. This extends the result on entanglement concentration in [1], where the target state is fixed as the Bell state. In the limit of vanishing converse error exponent, the rate formula provides an upper bound on the exact asymptotic extraction rate between two states, when the probability of success goes to 1. In the bipartite case, we prove that this bound holds with equality.

arXiv:1807.05130•IEEE Transactions on Information Theory•Jul 16, 2019•20 citations

Correlated Catalysis Removes the Strong Converse for Entanglement Distillation

Piotr Masajada, Aby Philip, Alexander Streltsov

Entanglement distillation converts noisy shared quantum states into maximally entangled pairs using local operations and classical communication. The distillable entanglement $E_D$ determines the maximum asymptotic rate at which this process can be performed reliably. For several classes of quantum states, distillation above this rate obeys a strong converse: the fidelity with the target state vanishes asymptotically. Here we show that correlated catalysis removes the strong converse for every distillable bipartite state. Specifically, at any target rate $R>E_D$, the optimal asymptotic fidelity is given by $E_D/R$. Thus, although catalysis does not increase the maximum reliable distillation rate, it allows nonvanishing fidelity at every finite rate. Remarkably, this advantage persists even when the catalyst is returned exactly at every finite blocklength and the correlations between the output and catalyst vanish asymptotically. We further characterize the catalyst size required to sustain nonvanishing fidelity above the reliable distillation rate.

quant-pharXiv:2611.03148•Nov 3, 2026•0 citations

A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation

Eyuri Wakakuwa, Akihito Soeda, Mio Murao

We analyze implementations of bipartite unitaries by means of local operations and classical communication (LOCC) assisted by shared entanglement. We employ concepts and techniques developed in the quantum Shannon theory to study an asymptotic scenario, in which two distant parties perform the same bipartite unitary on infinitely many pairs of inputs. We analyze minimum cost of entanglement and classical communication per copy. For two-round LOCC protocols, we derive a single-letter formula for the minimum cost of entanglement and classical communication, under an additional requirement that the error converges to zero faster than 1/n4, where n is the number of input pairs. The formula is given by the “Markovianizing cost” of a tripartite state associated with the unitary, which can be computed by a finite-step algorithm. We also derive a lower bound on the minimum cost of resources, which applies for protocols with arbitrary number of rounds.

arXiv:1505.04352•IEEE Transactions on Information Theory•May 29, 2017•22 citations

Asymptotic compatibility between local-operations-and-classical-communication conversion and recovery

Kosuke Ito, Wataru Kumagai, Masahito Hayashi

Recently, entanglement concentration was explicitly shown to be irreversible. However, it is still not clear what kind of states can be reversibly converted in the asymptotic setting by local operations and classical communication (LOCC) when neither the initial nor the target state is maximally entangled. We derive the necessary and sufficient condition for the reversibility of LOCC conversions between two bipartite pure entangled states in the asymptotic setting. In addition, we show that conversion can be achieved perfectly with only local unitary operation under such condition except for special cases. Interestingly, our result implies that an error-free reversible conversion is asymptotically possible even between states whose copies can never be locally unitarily equivalent with any finite numbers of copies, although such a conversion is impossible in the finite setting. In fact, we show such an example. Moreover, we establish how to overcome the irreversibility of LOCC conversion in two ways. As for the first method, we evaluate how many copies of the initial state are to be lost to overcome the irreversibility of LOCC conversion. The second method is to add a supplementary state appropriately, which also works for local unitary conversion unlike the first method. Especially, for the qubit system, any nonmaximally pure entangled state can be a universal resource for the asymptotic reversibility when copies of the state are sufficiently many. More interestingly, our analysis implies that far-from-maximally entangled states can be better than nearly maximally entangled states as this type of resource. This fact brings new insight to the resource theory of state conversion.

arXiv:1504.02967•Physical Review A•Nov 6, 2015•9 citations
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.
The paper addresses whether two-way LOCC distillable entanglement EDE_DED​ is continuous for arbitrary finite-dimensional bipartite states. Previous results established lower semicontinuity and continuity inside the set of distillable states, but did not cover all boundary cases, including approaches to pure states or to the distillable–nondistillable boundary.
For 12∥ρ−σ∥1≤ε<1/16\tfrac12\|\rho-\sigma\|_1\leq\varepsilon<1/1621​∥ρ−σ∥1​≤ε<1/16 and d=min⁡{dim⁡A,dim⁡B}d=\min\{\dim A,\dim B\}d=min{dimA,dimB}, it proves the asymptotic continuity bound
∣ED(ρ)−ED(σ)∣≤4εlog⁡d+4h(ε)|E_D(\rho)-E_D(\sigma)|\leq4\sqrt{\varepsilon}\log d+4h(\sqrt{\varepsilon})∣ED​(ρ)−ED​(σ)∣≤4ε​logd+4h(ε​),
where hhh is binary entropy and logarithms are base two. Thus the dimension dependence is logarithmic, with no spectral assumptions on either state.
The proof is operational. An LOCC conversion protocol turns n+O(n2/3)n+O(n^{2/3})n+O(n2/3) copies of either state into an approximation of n−O(n2/3)n-O(n^{2/3})n−O(n2/3) copies of the other, with vanishing error and an auxiliary ebit cost per copy tending to zero with their trace distance. It first prepares a common intermediate mixture, then extracts the target using a nonlocal projective measurement. A collective Grover-search procedure locates rare measurement outcomes, reducing the entanglement expenditure. Concatenating conversion with distillation, and bounding the net gain achievable with supplied ebits, yields continuity.
The same construction gives the displayed bound for entanglement cost ECE_CEC​, although the paper notes that an existing continuity bound for ECE_CEC​ is slightly tighter. The conversion result concerns asymptotic, vanishing-error protocols; it does not provide a finite-copy performance guarantee.
We consider distillation of ebits between a specified pair of subsystems from pure tripartite states by local operations and classical communication. It is known that, allowing an asymptotically vanishing error, the maximal rate is the minimum of the von Neumann entropies of the two corresponding marginals, and under asymptotic stochastic local operations and classical communication the maximal rate is given by a minimization over a one-parameter family of entanglement measures. In this paper, we determine the direct and strong converse error exponents, and the optimal rate for deterministic transformations.
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.
We study the exact, non-deterministic conversion of multipartite pure quantum states into one-another via local operations and classical communication (LOCC) and asymptotic entanglement transformation under such channels. In particular, we consider the maximal number of copies of any given target state that can be extracted exactly from many copies of any given initial state as a function of the exponential decay in the success probability, known as the converse error exponent. We give a formula for the optimal rate presented as an infimum over the asymptotic spectrum of LOCC conversion. A full understanding of exact asymptotic extraction rates between pure states in the converse regime thus depends on a full understanding of this spectrum. We present a characterization of spectral points and use it to describe the spectrum in the bipartite case. This leads to a full description of the spectrum and thus an explicit formula for the asymptotic extraction rate between pure bipartite states, given a converse error exponent. This extends the result on entanglement concentration in [1], where the target state is fixed as the Bell state. In the limit of vanishing converse error exponent, the rate formula provides an upper bound on the exact asymptotic extraction rate between two states, when the probability of success goes to 1. In the bipartite case, we prove that this bound holds with equality.
Entanglement distillation converts noisy shared quantum states into maximally entangled pairs using local operations and classical communication. The distillable entanglement EDE_DED​ determines the maximum asymptotic rate at which this process can be performed reliably. For several classes of quantum states, distillation above this rate obeys a strong converse: the fidelity with the target state vanishes asymptotically. Here we show that correlated catalysis removes the strong converse for every distillable bipartite state. Specifically, at any target rate R>EDR>E_DR>ED​, the optimal asymptotic fidelity is given by ED/RE_D/RED​/R. Thus, although catalysis does not increase the maximum reliable distillation rate, it allows nonvanishing fidelity at every finite rate. Remarkably, this advantage persists even when the catalyst is returned exactly at every finite blocklength and the correlations between the output and catalyst vanish asymptotically. We further characterize the catalyst size required to sustain nonvanishing fidelity above the reliable distillation rate.
We analyze implementations of bipartite unitaries by means of local operations and classical communication (LOCC) assisted by shared entanglement. We employ concepts and techniques developed in the quantum Shannon theory to study an asymptotic scenario, in which two distant parties perform the same bipartite unitary on infinitely many pairs of inputs. We analyze minimum cost of entanglement and classical communication per copy. For two-round LOCC protocols, we derive a single-letter formula for the minimum cost of entanglement and classical communication, under an additional requirement that the error converges to zero faster than 1/n4, where n is the number of input pairs. The formula is given by the “Markovianizing cost” of a tripartite state associated with the unitary, which can be computed by a finite-step algorithm. We also derive a lower bound on the minimum cost of resources, which applies for protocols with arbitrary number of rounds.
Recently, entanglement concentration was explicitly shown to be irreversible. However, it is still not clear what kind of states can be reversibly converted in the asymptotic setting by local operations and classical communication (LOCC) when neither the initial nor the target state is maximally entangled. We derive the necessary and sufficient condition for the reversibility of LOCC conversions between two bipartite pure entangled states in the asymptotic setting. In addition, we show that conversion can be achieved perfectly with only local unitary operation under such condition except for special cases. Interestingly, our result implies that an error-free reversible conversion is asymptotically possible even between states whose copies can never be locally unitarily equivalent with any finite numbers of copies, although such a conversion is impossible in the finite setting. In fact, we show such an example. Moreover, we establish how to overcome the irreversibility of LOCC conversion in two ways. As for the first method, we evaluate how many copies of the initial state are to be lost to overcome the irreversibility of LOCC conversion. The second method is to add a supplementary state appropriately, which also works for local unitary conversion unlike the first method. Especially, for the qubit system, any nonmaximally pure entangled state can be a universal resource for the asymptotic reversibility when copies of the state are sufficiently many. More interestingly, our analysis implies that far-from-maximally entangled states can be better than nearly maximally entangled states as this type of resource. This fact brings new insight to the resource theory of state conversion.