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

Robustness of Entanglement Manipulation for almost i.i.d. sources

Nilanjana Datta

quant-phSubmitted Jun 4, 2026• Announced Jun 5, 2026• 0 citations• Revised Oct 8, 2026 (v2)
v1 · Jun 4, 2026v2 · Oct 8, 2026
arXivHTMLPDF

Abstract

We study the robustness of asymptotic entanglement manipulation for Mazzola--Sutter--Renner (MSR) almost-iid sources, which allow a sublinear number of deviations from tensor-power structure. For pure sources along $|φ\rangle_{AB}$, every concentration rate below $S(φ_A)$ is achievable by a single Schur--Weyl protocol depending only on the rate and local Hilbert spaces. For general sources along $ρ_{AB}$, every distillation rate below $E_D(ρ_{AB})$ is achievable by a single LOCC protocol sequence independent of the particular source and defect size. Its error vanishes exponentially and uniformly for each prescribed defect bound $r_n=o(n)$, yielding an optimal universal distillation rate equal to $E_D(ρ_{AB})$. For dilution, the entanglement cost of every MSR almost-iid target sequence along $ρ_{AB}$ is at most $E_F^\infty(ρ_{AB})$, the regularized entanglement of formation of the reference state. Consequently, every MSR almost-iid sequence along a pure reference state $|φ\rangle_{AB}$ is asymptotically reversible, with distillable entanglement and entanglement cost equal to $S(φ_A)$, even when its individual states are mixed. The proofs establish structural and entropic properties of MSR almost-iid sources that may be useful in other information-theoretic settings.

Comments
Added universal entanglement distillation for MSR almost-iid sources with any prescribed $r_n=o(n)$, with uniform exponential error bounds. Extended asymptotic reversibility along pure reference states to include mixed MSR almost-iid sequences. Updated exposition and comparison with recent work. (38 pages)

Related papers

Robust classical and quantum communication over almost-iid channels

Liuhang Ye, Bjarne Bergh, Nilanjana Datta

The independent and identically distributed (iid) paradigm for asymptotic communication through quantum channels describes $n$ uses of a channel $Φ$ by $Φ^{\otimes n}$. Since exact tensor-power behaviour is an idealization, we ask whether the asymptotic capacities of $Φ$ remain achievable for channel sequences that are almost-iid along $Φ$. We consider sequences of Choi-almost-iid channels whose normalized Choi states are Mazzola-Sutter-Renner (MSR) almost-iid along the normalized Choi state of $Φ$, with defect parameters $r_n=o(n)$. In Renner's exponential de Finetti theorem for quantum states, almost-iid states appear in the approximating mixture and motivate the MSR almost-iid class. Choi-almost-iid channels play the corresponding role in an exponential de Finetti theorem for quantum channels established in a companion paper. In this paper, we prove that the universal unassisted classical and quantum capacities of the class of Choi-almost-iid channels along $Φ$ equal those of the channel $Φ$. Here universality is within this class: for each rate below the relevant capacity, a code sequence depending on $Φ$ and the rate, but not on the particular channel sequence, achieves vanishing error for every sequence in the class.

quant-pharXiv:2610.00442•Oct 1, 2026•0 citations

Entropy Concentration and Universal Typicality for Almost i.i.d. Quantum Sources

Nilanjana Datta

We establish two concentration principles for almost i.i.d. quantum sources under the weakly almost i.i.d. condition, the broadest condition in the established hierarchy of almost i.i.d. sources. Our results therefore apply also to Wasserstein- and Mazzola-Sutter-Renner almost i.i.d. sources. Weakly almost i.i.d. sources are sequences of multipartite states whose fixed-size marginals converge, on average, to tensor powers of a reference state, while allowing arbitrary global correlations and entanglement. We prove a noncommutative weak law of large numbers for empirical observables, and a universal entropy-concentration principle showing asymptotic concentration on subspaces of exponential dimension governed by the von Neumann entropy of the reference state. These concentration principles provide a unified and conceptually transparent approach to several information-theoretic applications beyond the i.i.d. setting, including direct proofs of universal compression within classes of weakly almost i.i.d. sources sharing a common reference state and asymmetric quantum hypothesis-testing bounds. They also yield concentration of empirical local-measurement frequencies and of empirical averages of commuting single-site observables, with applications to single-site generalized Gibbs ensembles, together with bounds on smooth and spectral entropies.

quant-pharXiv:2605.20092•May 20, 2026•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•0 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

Quantum Shannon theory made robust: a tale of three protocols for almost i.i.d. sources

Filippo Girardi, Nilanjana Datta, Giacomo De Palma +1 more

The asymptotic rates of information-theoretic protocols - including error exponents, data-compression rates, and channel capacities - are traditionally derived under the idealised assumption that the underlying resources are independent and identically distributed (i.i.d.). Somewhat surprisingly, even slight departures from the exact i.i.d. structure can drastically alter the asymptotic behaviour predicted by the i.i.d. theory. If the precise nature of the perturbation is known, for instance in the case of a pointwise defect, one can design a bespoke protocol that compensates for it, e.g. by discarding the corrupted subsystem. In realistic physical settings, however, exact i.i.d. behaviour cannot be guaranteed, and deviations from the ideal regime cannot generally be identified precisely. This raises a fundamental question: which notions of almost i.i.d. structure are sufficiently robust to preserve the asymptotic predictions of quantum Shannon theory? We investigate this question for three central information-theoretic tasks: asymmetric hypothesis testing, classical and quantum data compression, and classical communication through quantum channels. Rather than designing protocols tailored to specific defects, we seek robust protocols that remain asymptotically optimal and that are universal within a broad class of almost i.i.d. resources whose precise deviations from the ideal regime are unknown. To this end, we study three inequivalent notions of almost i.i.d. structure, and determine which of them preserve the asymptotic rates and error exponents predicted by the i.i.d. theory. Along the way, we introduce the notion of an almost i.i.d. process and a new distance measure between quantum channels - the club distance - designed to capture stability under local perturbations. These notions may be of independent interest.

quant-pharXiv:2605.18726•May 19, 2026•0 citations

Finite-Blocklength and Exponential Analyses for Universal Entanglement and Coherence Distillation under Various Free Operations

Zhiwen Lin, Ke Li, Kun Fang

Historically, entanglement and coherence distillation focused on the distillable rate under full knowledge of the initial state. In this paper, we develop a unified finite-blocklength and asymptotic theory for universal distillation from convex compact sequences of possible states stable under tensor products. We first resolve an open question by showing that two regularized variants of the generalized quantum Hoeffding divergence need not coincide, and establish fundamental properties of the Hoeffding divergence and anti-divergence. For universal entanglement distillation, we connect finite-blocklength performance under non-entangling, PPT-preserving, and dually free operations to composite correlated hypothesis testing, yielding reliability functions for non-entangling and PPT-preserving operations characterized by regularized quantum Hoeffding divergences and strong converse bounds via the anti-divergence. We recover the entanglement concentration error exponent, zero-rate exponents under a continuity condition, and distillable entanglements, and characterize the dually free cases by regularized relative entropies under restricted measurements. Additionally, five concrete noise models justify the black-box assumptions for both resources. For coherence distillation under maximally incoherent and dephasing-covariant incoherent operations, we extend the one-shot semidefinite program characterization to universal inputs; relating a relaxed optimization to hypothesis testing yields the high-rate reliability function. A coherent-seed approach extends the single-state formula to the entire direct regime when the zero-error rate is positive. Finally, we completely characterize the states with positive zero-error coherence distillation rate, show that the rate equals the order-zero Petz Rényi relative entropy of coherence, and derive dimension-independent one-shot bounds ......

quant-pharXiv:2601.10190•IEEE International Symposium on Information Theory (ISIT)•Jan 16, 2026•1 citation
We study the robustness of asymptotic entanglement manipulation for Mazzola--Sutter--Renner (MSR) almost-iid sources, which allow a sublinear number of deviations from tensor-power structure. For pure sources along ∣φ⟩AB|φ\rangle_{AB}∣φ⟩AB​, every concentration rate below S(φA)S(φ_A)S(φA​) is achievable by a single Schur--Weyl protocol depending only on the rate and local Hilbert spaces. For general sources along ρABρ_{AB}ρAB​, every distillation rate below ED(ρAB)E_D(ρ_{AB})ED​(ρAB​) is achievable by a single LOCC protocol sequence independent of the particular source and defect size. Its error vanishes exponentially and uniformly for each prescribed defect bound rn=o(n)r_n=o(n)rn​=o(n), yielding an optimal universal distillation rate equal to ED(ρAB)E_D(ρ_{AB})ED​(ρAB​). For dilution, the entanglement cost of every MSR almost-iid target sequence along ρABρ_{AB}ρAB​ is at most EF∞(ρAB)E_F^\infty(ρ_{AB})EF∞​(ρAB​), the regularized entanglement of formation of the reference state. Consequently, every MSR almost-iid sequence along a pure reference state ∣φ⟩AB|φ\rangle_{AB}∣φ⟩AB​ is asymptotically reversible, with distillable entanglement and entanglement cost equal to S(φA)S(φ_A)S(φA​), even when its individual states are mixed. The proofs establish structural and entropic properties of MSR almost-iid sources that may be useful in other information-theoretic settings.
The independent and identically distributed (iid) paradigm for asymptotic communication through quantum channels describes nnn uses of a channel ΦΦΦ by Φ⊗nΦ^{\otimes n}Φ⊗n. Since exact tensor-power behaviour is an idealization, we ask whether the asymptotic capacities of ΦΦΦ remain achievable for channel sequences that are almost-iid along ΦΦΦ. We consider sequences of Choi-almost-iid channels whose normalized Choi states are Mazzola-Sutter-Renner (MSR) almost-iid along the normalized Choi state of ΦΦΦ, with defect parameters rn=o(n)r_n=o(n)rn​=o(n). In Renner's exponential de Finetti theorem for quantum states, almost-iid states appear in the approximating mixture and motivate the MSR almost-iid class. Choi-almost-iid channels play the corresponding role in an exponential de Finetti theorem for quantum channels established in a companion paper. In this paper, we prove that the universal unassisted classical and quantum capacities of the class of Choi-almost-iid channels along ΦΦΦ equal those of the channel ΦΦΦ. Here universality is within this class: for each rate below the relevant capacity, a code sequence depending on ΦΦΦ and the rate, but not on the particular channel sequence, achieves vanishing error for every sequence in the class.
We establish two concentration principles for almost i.i.d. quantum sources under the weakly almost i.i.d. condition, the broadest condition in the established hierarchy of almost i.i.d. sources. Our results therefore apply also to Wasserstein- and Mazzola-Sutter-Renner almost i.i.d. sources. Weakly almost i.i.d. sources are sequences of multipartite states whose fixed-size marginals converge, on average, to tensor powers of a reference state, while allowing arbitrary global correlations and entanglement. We prove a noncommutative weak law of large numbers for empirical observables, and a universal entropy-concentration principle showing asymptotic concentration on subspaces of exponential dimension governed by the von Neumann entropy of the reference state. These concentration principles provide a unified and conceptually transparent approach to several information-theoretic applications beyond the i.i.d. setting, including direct proofs of universal compression within classes of weakly almost i.i.d. sources sharing a common reference state and asymmetric quantum hypothesis-testing bounds. They also yield concentration of empirical local-measurement frequencies and of empirical averages of commuting single-site observables, with applications to single-site generalized Gibbs ensembles, together with bounds on smooth and spectral entropies.
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.
The asymptotic rates of information-theoretic protocols - including error exponents, data-compression rates, and channel capacities - are traditionally derived under the idealised assumption that the underlying resources are independent and identically distributed (i.i.d.). Somewhat surprisingly, even slight departures from the exact i.i.d. structure can drastically alter the asymptotic behaviour predicted by the i.i.d. theory. If the precise nature of the perturbation is known, for instance in the case of a pointwise defect, one can design a bespoke protocol that compensates for it, e.g. by discarding the corrupted subsystem. In realistic physical settings, however, exact i.i.d. behaviour cannot be guaranteed, and deviations from the ideal regime cannot generally be identified precisely. This raises a fundamental question: which notions of almost i.i.d. structure are sufficiently robust to preserve the asymptotic predictions of quantum Shannon theory? We investigate this question for three central information-theoretic tasks: asymmetric hypothesis testing, classical and quantum data compression, and classical communication through quantum channels. Rather than designing protocols tailored to specific defects, we seek robust protocols that remain asymptotically optimal and that are universal within a broad class of almost i.i.d. resources whose precise deviations from the ideal regime are unknown. To this end, we study three inequivalent notions of almost i.i.d. structure, and determine which of them preserve the asymptotic rates and error exponents predicted by the i.i.d. theory. Along the way, we introduce the notion of an almost i.i.d. process and a new distance measure between quantum channels - the club distance - designed to capture stability under local perturbations. These notions may be of independent interest.
Historically, entanglement and coherence distillation focused on the distillable rate under full knowledge of the initial state. In this paper, we develop a unified finite-blocklength and asymptotic theory for universal distillation from convex compact sequences of possible states stable under tensor products. We first resolve an open question by showing that two regularized variants of the generalized quantum Hoeffding divergence need not coincide, and establish fundamental properties of the Hoeffding divergence and anti-divergence. For universal entanglement distillation, we connect finite-blocklength performance under non-entangling, PPT-preserving, and dually free operations to composite correlated hypothesis testing, yielding reliability functions for non-entangling and PPT-preserving operations characterized by regularized quantum Hoeffding divergences and strong converse bounds via the anti-divergence. We recover the entanglement concentration error exponent, zero-rate exponents under a continuity condition, and distillable entanglements, and characterize the dually free cases by regularized relative entropies under restricted measurements. Additionally, five concrete noise models justify the black-box assumptions for both resources. For coherence distillation under maximally incoherent and dephasing-covariant incoherent operations, we extend the one-shot semidefinite program characterization to universal inputs; relating a relaxed optimization to hypothesis testing yields the high-rate reliability function. A coherent-seed approach extends the single-state formula to the entire direct regime when the zero-error rate is positive. Finally, we completely characterize the states with positive zero-error coherence distillation rate, show that the rate equals the order-zero Petz Rényi relative entropy of coherence, and derive dimension-independent one-shot bounds ......