Pith. sign in

REVIEW 6 minor 39 references

Very Strong Irreversibility of Quantum Entanglement

T0 review · 0 major / 6 minor · reviewed 2026-07-30 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Entanglement stays irreversible even when large fixed error is allowed: formation and distillation thresholds separate exponentially.

desk verdict Resolves Lami–Regula’s finite-error cost conjecture with an exponential strong-converse gap under NE, plus clean analytic C-PPT-P families; the math holds up. read the letter →

arxiv 2607.27195 v1 pith:7USNMXJS submitted 2026-07-29 quant-ph

Tulja Varun Kondra , Raphael Brinster , Hermann Kampermann , Dagmar Bru{ss} , Nikolai Wyderka This is my paper · ORCID
classification quant-ph PACS 03.67.Mn03.65.Ud03.67.-a
keywords quantumentanglementirreversibilitystrongconversecostdistillablenon-entanglingoperationsPPT-preservingmapssemidefiniteprogramming
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Some mixed entangled states cost pure entanglement to make, yet yield none back under local operations. This paper shows the gap survives even if one allows a fixed nonzero error that never goes to zero, and in fact any protocol that tries to beat the gap must fail with error that races exponentially to one as more copies are used. The authors settle a conjecture for a standard two-qutrit example under the largest class of operations that never create entanglement, prove an efficiently computable lower bound on the exponential formation cost, and give analytically solvable antisymmetric families under completely PPT-preserving maps that exhibit the same exponential separation. A sympathetic reader cares because the result draws a sharp line between entanglement and thermodynamics: allowing imperfect conversion does not restore a second-law-like reversibility.

What carries the argument

A single-copy SDP quantity called the kernel-robust tempered negativity N⊥(ρ) (infimum of ∥(P+Q)Γ∥∞ over Hermitian Q supported on the kernel of ρ with ∥Q∥∞≤1/2). When N⊥(ρ)<1 it lower-bounds the exponential strong-converse entanglement cost by −log N⊥(ρ), via an asymptotic family of truncated tensor-product witnesses whose off-support mass decays exponentially by Chernoff bounds.

What would settle it

Exhibit a sequence of non-entangling formation protocols for ω₃ whose rate stays strictly below 1 yet whose output fidelity with ω₃⊗n does not decay exponentially (or stays bounded away from zero); or show that every feasible SDP witness Q for N⊥(ω₃) yields ∥(P+Q)Γ∥∞≥1.

Watch

Extended reading notes

Core claim

There exist mixed entangled states, including the two-qutrit state ω₃ and analytic weighted antisymmetric families, for which the exponential strong-converse distillable entanglement is strictly smaller than the exponential strong-converse entanglement cost, both under non-entangling (and PPT-preserving) maps and under completely PPT-preserving maps. Explicitly, for ω₃ the two rates equal log₂(3/2) and 1; any protocol operating beyond either threshold has fidelity decaying exponentially in the number of copies.

Load-bearing premise

The formation lower bound stands or falls with a technical construction of truncated multi-copy witness operators that stay controlled under partial transpose while their weight outside the support of the state decays exponentially.

Editorial extensions

If this is right

  • Fixed nonzero error cannot restore asymptotic reversibility of mixed-state entanglement under non-entangling operations.
  • Any attempt to form or distill beyond the stated thresholds fails with error that approaches one exponentially fast in the number of copies.
  • The SDP quantity N⊥ supplies an efficiently computable certificate of exponential formation cost for rank-deficient states.
  • Under completely PPT-preserving maps, every weighted complete-bipartite antisymmetric state with trace-norm of the weight matrix strictly less than 1 is exponentially irreversible, with exact rates log₂(1+∥P̃∥₁) versus 1.
  • No comparable exponential separation was previously known even for the stricter class of LOCC.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same witness technique may lift to other resource theories whose free sets admit a dual robustness formulation controlled by partial transpose or a similar cone.
  • Because the C-PPT-P separation already sits inside LOCC, an explicit LOCC protocol family matching the analytic rates would close the last remaining gap mentioned by the authors.
  • Polynomial (rather than exponential) error growth is ruled out as a route to approximate reversibility for these states; only error that stays bounded away from one could still conceivably close the gap.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 6 minor

Summary. The manuscript establishes exponential strong-converse irreversibility of mixed-state entanglement. For the Lami–Regula state ω₃ it proves E^{exp(†)}_{d,KP}(ω₃)=log₂(3/2)<1=E^{exp(†)}_{c,KP}(ω₃) under non-entangling and PPT-preserving maps, so any protocol beyond either threshold has fidelity decaying exponentially in the number of copies. This resolves and strengthens the finite-error conjecture of Lami and Regula. The formation lower bound is obtained from a single-copy SDP quantity (kernel-robust tempered negativity / α⋆) via an explicit truncated-tensor witness construction (Lemma 3). For completely PPT-preserving operations the authors give matching one-shot bounds in terms of R_max and the additive quantity E^{1/2}_{N,PPT₂}, and construct analytically solvable weighted antisymmetric states β_P̃ with R_max(β_P̃)=log₂(1+∥P̃∥₁)<1=E^{1/2}_{N,PPT₂}(β_P̃) whenever ∥P̃∥₁<1, yielding the same exponential separation (and, by sandwiching, under LOCC).

Significance. The result is a clear advance in the resource theory of entanglement. It closes a stated conjecture, upgrades irreversibility from vanishing and fixed error to the exponential strong-converse regime, and supplies efficiently computable single-copy certificates (SDP for NE/KP; closed-form R_max and E^{1/2}_{N,PPT₂} for an analytic family under C-PPT-P). The C-PPT-P families also give, to the authors’ knowledge, the first exponential strong-converse cost–distillable gap that applies even under LOCC. The contrast with reversible thermodynamic resource theories is sharpened in a technically controlled way. Explicit operator inequalities for ω₃, additivity of E^{1/2}_{N,PPT₂}, and concrete preparation protocols that saturate the cost side are genuine strengths.

minor comments (6)
  1. [Abstract] Abstract: the phrase “persists even at the level of polynomially (in the number of copies) growing error” is ambiguous relative to the exponential strong-converse theorems actually proved (fidelity ≤ 2^{-γn}). Prefer wording that matches the definitions (fixed error < 1, or exponential approach of the error to 1).
  2. [Abstract] Abstract and elsewhere: missing spaces in compounds such as “theexponentialstrong-converseirreversibility” and “exhibiting theexponentialstrong-converseirreversibility”; fix in copy-editing.
  3. [MAIN RESULTS] Main text after Eq. (26): the elementary choice Q=−Φ₃/2 already saturates α⋆(ω₃)=1/2, so the general Lemma 3 machinery is not needed for the conjecture resolution. A one-sentence forward pointer that the ω₃ cost bound is elementary would help readers who only need the headline result.
  4. [Supplemental Material, Lemma 3] Supplemental Material, Lemma 3: the free parameters c=1.1 and the restriction η≤1/22 are fixed for convenience. A brief remark that any c>1 with cη<1 and sufficiently small η works (with κ(c,η)>0) would make the robustness of the Chernoff/KL argument clearer.
  5. [DEFINITIONS AND BACKGROUND] Definitions of E^{exp(†)}_{d/c,F}: the main text sketches the exponential rates; the precise inf/sup formulations appear only in the Supplement. Cross-referencing the Supplement definitions at first use in the main text would improve readability.
  6. [MAIN RESULTS] Eq. (19) and the distillation argument for ω₃ use the separable majorant σ₃=P₃/3 and Tr(Φ_M τ)≤1/M for τ∈K. This is standard; citing the precise Fuchs–van de Graaf form used for 1−ε_d^n≤√f_n would make the exponential decay step fully self-contained.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: separations follow from independent operator bounds and explicit protocols, not from defining cost equal to distillable rate.

full rationale

The paper’s central claims are one-sided inequalities and explicit constructions, not tautologies. E^{exp(†)}_{c,KP} ≥ −log N_⊥(ρ) is proved from dual robustness witnesses and a truncated tensor-product construction (Lemma 3); N_⊥ is an independent SDP over kernel operators Q, not defined as the cost. For ω₃ the bound saturates via the elementary feasible point Q=−Φ₃/2 (α=1/2) together with the known exact preparation by one Bell pair, while distillation is upper-bounded by the operator inequality ω₃ ≤ (3/2)σ₃ with σ₃ separable. Under C-PPT-P, R_max and additive E^{1/2}_{N,PPT₂} are standard comparison quantities; the gap on β_P̃ is computed from singular values of P̃ and an explicit PPT₂ witness, with cost = 1 from preparing each |a_ij⟩ from one ebit plus shared randomness. Citations to Lami–Regula and Wang–Duan supply the upstream state and vanishing-error gap; they are not load-bearing uniqueness theorems that force the exponential separation by definition. No fitted inputs are relabeled as predictions, and no quantity is defined in terms of the rate it is claimed to bound.

Assumptions & free parameters 0 free parameters · 6 assumptions · 3 invented entities

Load-bearing content is mathematical: cone-preserving maps, robustness duals, Rains set, Chernoff tail bounds, and fidelity/trace-distance relations. No fitted physical constants. New named quantities (kernel-robust tempered negativity, exponential strong-converse thresholds, PPT₂) are definitions introduced to state the bounds, not ontological postulates. Background resource-theory facts (LOCC ⊂ NE, LOCC ⊂ C-PPT-P, robustness of Bell pairs, Fuchs–van de Graaf) are taken from the literature.

assumptions (6)
  • domain assumption Standard robustness of m Bell pairs equals 2^m−1, and robustness is monotone under KP maps (used to bound Tr(W_n Ω_n)).
    Invoked in Supplemental proof of Theorem 2 step (c); classical entanglement-robustness fact from Vidal–Tarrach / resource-theory literature.
  • standard math Fuchs–van de Graaf: 1−T(ρ,Φ) ≤ √F(ρ,Φ) for pure Φ, used to turn fidelity upper bounds into exponential error lower bounds.
    Main text distillation argument for ω₃ after Eq. (29).
  • standard math Chernoff/Hoeffding-type binomial tail bounds (KL form) control the truncated expansion of P^{⊗n} in the W_n witness construction.
    Lemma 3 in Supplemental Material; without exponential tails the c_n decay claim fails.
  • domain assumption Completely PPT-preserving channels map the Rains set into itself and PPT₂ into itself (Lemma 4).
    Needed for one-shot conversion bounds under C-PPT-P; proved in-supplement from complete positivity of Γ∘Λ∘Γ.
  • domain assumption Exact additivity E^{1/2}_{N,PPT₂}(ρ^{⊗n})=n E^{1/2}_{N,PPT₂}(ρ) from Wang–Jing–Zhu (2025).
    Cited and used for the formation exp-converse lower bound under C-PPT-P; not re-proved here.
  • domain assumption Positive TP K-preserving maps send K-states to K-states, and every normalized τ∈K satisfies Tr(Φ_M τ)≤1/M.
    Core of the ω₃ distillation exp-converse argument (Eqs. 27–29).
invented entities (3)
  • Kernel-robust tempered negativity N_⊥(ρ) / α⋆(ρ)
    purpose: Single-copy SDP lower bound on exponential strong-converse entanglement cost under KP/NE maps.
    Defined in Definition 1 / Eqs. (20)–(22) as an infimum over kernel operators Q; not claimed as a physical substance, but is a new technical resource monotone-like quantity.
  • Exponential strong-converse distillable entanglement and cost E^{exp(†)}_{d/c,F}
    purpose: Formalize rates beyond which error approaches 1 exponentially fast in n.
    Defined in main text and Supplemental Eqs. (52)–(53); definitional scaffolding for the strengthened irreversibility claim.
  • Comparison set PPT₂ and quantity E^{1/2}_{N,PPT₂}
    purpose: SDP-computable formation lower bound under C-PPT-P, paired against R_max for irreversibility certificates.
    PPT₂ appears as Eq. (33)/(135); closely related to recent entanglement-cost bounds (Wang et al. 2025) but specialized here for exp-converse formation.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Very Strong Irreversibility of Quantum Entanglement." pith.science (2026). https://pith.science/paper/7USNMXJS

@misc{pith2026260727195,
  author       = {Pith},
  title        = {Pith review of: Very Strong Irreversibility of Quantum Entanglement},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7USNMXJS}},
  note         = {Machine review of arXiv:2607.27195}
}
read the original 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.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

39 extracted references · 3 linked inside Pith

  1. [1]

    Lami and B

    L. Lami and B. Regula, No second law of entanglement manipulation after all, Nature Physics19, 184 (2023), arXiv:2111.02438

    arXiv 2023

  2. [2]

    Horodecki, P

    R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, Quantum entanglement, Reviews of Mod- ern Physics81, 865 (2009)

    2009

  3. [3]

    Einstein, B

    A. Einstein, B. Podolsky, and N. Rosen, Can quantum- mechanical description of physical reality be considered complete?, Physical Review47, 777 (1935)

    1935

  4. [4]

    Schrödinger, Discussion of probability relations be- tween separated systems, Mathematical Proceedings of the Cambridge Philosophical Society31, 555 (1935)

    E. Schrödinger, Discussion of probability relations be- tween separated systems, Mathematical Proceedings of the Cambridge Philosophical Society31, 555 (1935)

    1935

  5. [5]

    J. S. Bell, On the Einstein Podolsky Rosen paradox, Physics Physique Fizika1, 195 (1964)

    1964

  6. [6]

    J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, Proposed experiment to test local hidden-variable theories, Physical Review Letters23, 880 (1969)

    1969

  7. [7]

    C. H. Bennett and S. J. Wiesner, Communication via one- and two-particle operators on Einstein–Podolsky–Rosen states, Physical Review Letters69, 2881 (1992)

    1992

  8. [8]

    C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, Teleporting an unknown quantum state via dual classical and Einstein–Podolsky– Rosen channels, Physical Review Letters70, 1895 (1993)

    1993

Show all 39 references
  1. [9]

    A. K. Ekert, Quantum cryptography based on Bell’s the- orem, Physical Review Letters67, 661 (1991)

    1991

  2. [10]

    Briegel, W

    H.-J. Briegel, W. Dür, J. I. Cirac, and P. Zoller, Quantum repeaters: The role of imperfect local operations in quan- tum communication, Physical Review Letters81, 5932 (1998)

    1998

  3. [11]

    Raussendorf and H

    R. Raussendorf and H. J. Briegel, A one-way quantum computer, Physical Review Letters86, 5188 (2001)

    2001

  4. [12]

    C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, Mixed-state entanglement and quantum error correction, Physical Review A54, 3824 (1996)

    1996

  5. [13]

    C. H. Bennett, H. J. Bernstein, S. Popescu, and B. Schu- macher, Concentrating partial entanglement by local op- erations, Physical Review A53, 2046 (1996)

  6. [14]

    P. M. Hayden, M. Horodecki, and B. M. Terhal, The asymptotic entanglement cost of preparing a quantum state, Journal of Physics A: Mathematical and General 34, 6891 (2001)

    2001

  7. [15]

    Horodecki, Separability criterion and inseparable mixed states with positive partial transposition, Physics Letters A232, 333 (1997)

    P. Horodecki, Separability criterion and inseparable mixed states with positive partial transposition, Physics Letters A232, 333 (1997)

    1997

  8. [16]

    Horodecki, P

    M. Horodecki, P. Horodecki, and R. Horodecki, Mixed- state entanglement and distillation: Is there a “bound” entanglement in nature?, Physical Review Letters80, 5239 (1998). 6

    1998

  9. [17]

    C. H. Bennett, D. P. DiVincenzo, T. Mor, P. W. Shor, J. A. Smolin, and B. M. Terhal, Unextendible product bases and bound entanglement, Physical Review Letters 82, 5385 (1999)

    1999

  10. [18]

    Vidal and J

    G. Vidal and J. I. Cirac, Irreversibility in asymptotic manipulations of entanglement, Physical Review Letters 86, 5803 (2001)

    2001

  11. [19]

    D. Yang, M. Horodecki, R. Horodecki, and B. Synak- Radtke, Irreversibility for all bound entangled states, Physical Review Letters95, 190501 (2005)

    2005

  12. [20]

    E. H. Lieb and J. Yngvason, The physics and mathematics of the second law of thermodynamics, Physics Reports 310, 1 (1999)

    1999

  13. [21]

    F. G. S. L. Brandão, M. Horodecki, J. Oppenheim, J. M. Renes, and R. W. Spekkens, Resource theory of quantum states out of thermal equilibrium, Physical Review Letters 111, 250404 (2013)

    2013

  14. [22]

    F. G. S. L. Brandão, M. Horodecki, N. H. Y. Ng, J. Op- penheim, and S. Wehner, The second laws of quantum thermodynamics, Proceedings of the National Academy of Sciences112, 3275 (2015)

    2015

  15. [23]

    Chitambar, D

    E. Chitambar, D. Leung, L. Mančinska, M. Ozols, and A. Winter, Everything you always wanted to know about LOCC (but were afraid to ask), Communications in Math- ematical Physics328, 303 (2014)

    2014

  16. [24]

    Chitambar and G

    E. Chitambar and G. Gour, Quantum resource theories, Reviews of Modern Physics91, 025001 (2019)

    2019

  17. [25]

    F. G. S. L. Brandão and N. Datta, One-shot rates for entanglement manipulation under non-entangling maps, IEEE Transactions on Information Theory57, 1754 (2011)

    2011

  18. [26]

    C. A. Fuchs and J. van de Graaf, Cryptographic dis- tinguishability measures for quantum-mechanical states, IEEE Transactions on Information Theory45, 1216 (1999)

    1999

  19. [27]

    K. M. R. Audenaert, M. B. Plenio, and J. Eisert, Entan- glement cost under positive-partial-transpose-preserving operations, Physical Review Letters90, 027901 (2003)

    2003

  20. [28]

    Wang and R

    X. Wang and R. Duan, Irreversibility of asymptotic en- tanglement manipulation under quantum operations com- pletely preserving positivity of partial transpose, Physical Review Letters119, 180506 (2017)

    2017

  21. [29]

    Berta and M

    M. Berta and M. M. Wilde, Amortization does not en- hance the max-Rains information of a quantum channel, New Journal of Physics20, 053044 (2018)

    2018

  22. [30]

    X. Wang, M. Jing, and C. Zhu, Computable and faith- ful lower bound on entanglement cost, Physical Review Letters134, 190202 (2025), arXiv:2311.10649

    2025 arXiv

  23. [31]

    Vidal and R

    G. Vidal and R. F. Werner, Computable measure of en- tanglement, Physical Review A65, 032314 (2002)

    2002

  24. [32]

    Takagi, B

    R. Takagi, B. Regula, and M. M. Wilde, One-shot yield- cost relations in general quantum resource theories, PRX Quantum3, 010348 (2022), arXiv:2110.02212

    2022 arXiv

  25. [33]

    L. Lami, B. Regula, R. Takagi, and G. Ferrari, Framework for resource quantification in infinite-dimensional general probabilistic theories, Physical Review A103, 032424 (2021)

    2021

  26. [34]

    Vidal and R

    G. Vidal and R. Tarrach, Robustness of entanglement, Physical Review A59, 141 (1999)

    1999

  27. [35]

    M. A. Nielsen and I. L. Chuang,Quantum computation and quantum information(Cambridge University Press, 2010)

    2010

  28. [36]

    Boucheron, G

    S. Boucheron, G. Lugosi, and P. Massart,Concentration inequalities: A nonasymptotic theory of independence (Oxford Academic, 2013)

    2013

  29. [37]

    E. M. Rains, A semidefinite program for distillable entan- glement, IEEE Transactions on Information Theory47, 2921 (2001)

    2001

  30. [38]

    Wang and R

    X. Wang and R. Duan, Improved semidefinite program- ming upper bound on distillable entanglement, Physical Review A94, 050301 (2016). 7 SUPPLEMENTAL MATERIAL: VERY STRONG IRREVERSIBILITY OF QUANTUM ENTANGLEMENT Definitions Free cones and operations.We follow the notation of Re...

    2016

  31. [39]

    Consequently, Eexp(†) d,C-PPT-P(β⋆)≤log 2 ( 1 + 1√ 2 ) <1 =E exp(†) c,C-PPT-P(β⋆).(215)

Pith tools

Reviewed July 30, 2026 · model on record in the stance chip above.