The Min-Rains Relative Entropy Is Not Tight for Exact PPT Entanglement Distillation

Chengkai Zhu; Xin Wang

The Min-Rains Relative Entropy Is Not Tight for Exact PPT Entanglement Distillation

T0 review · 0 major / 3 minor · reviewed 2026-08-16 · deepseek-v4-flash

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

Pith's one-line read The additive min-Rains relative entropy is not an exact formula for regularized zero-error PPT entanglement distillation.

desk verdict Exact rational certificates show the min-Rains relative entropy is genuinely not tight for exact PPT distillation, via a simple rigidity lemma and a tensor-stable witness worth building on. read the letter →

arxiv 2608.12135 v1 pith:GUCD7E3P submitted 2026-08-12 quant-ph

Chengkai Zhu , Xin Wang This is my paper · ORCID

classification quant-ph MSC 81P4081P45 PACS 03.67.-a03.67.Mn

keywords exactentanglementdistillationPPToperationsmin-Rainsrelativeentropyregularizeddistillablerange-supportedtensorwitnessqutritcounterexamplesemidefiniteprogrammingtheory

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

Exact entanglement distillation asks how many maximally entangled pairs can be produced with zero error, and under operations that preserve positivity of partial transpose a natural candidate formula has been the additive min-Rains relative entropy. This paper proves that formula is not tight: there is a three-dimensional subspace of two qutrits for which every state with that support has regularized exact distillation rate strictly below the min-Rains value. The separation comes from a constraint that the min-Rains relaxation drops: any feasible one-shot effect must act as the identity on the support of the input state. The paper establishes the gap with exact rational certificates, so the conclusion does not rest on numerical approximation.

What carries the argument

The load-bearing mechanism is Lemma 2.1 together with a range-supported tensor witness. Lemma 2.1 says that any operator $E$ with $P\le E\le 1$ must satisfy $EP=PE=P$, so $E$ is fixed to the identity on the support and has no support-complement coherences. Given any $T$ with $PT=T$ and $\operatorname{Tr}T=1$, Hölder's inequality then yields $W_0(P^{\otimes n})\ge \|T^{\Gamma}\|_1^{-n}$, so the one-shot SDP value cannot drop faster than an exponential with exponent $\log\|T^{\Gamma}\|_1$. The paper constructs $T$ as three rank-one blocks on the edge subspaces and a three-by-three coherence block after partial transpose, computes $\|T^{\Gamma}\|_1$ from its two singular values, and pairs it with a feasible dual certificate $R$ for the min-Rains SDP to get the strict ordering. The witness is allowed to be non-Hermitian, which is why it can detect the identity action missed by Hermitian dual relaxations.

What would settle it

Evaluate the semidefinite program for $W_0(P)$ on the projection in Eq. (3.2) with exact rational arithmetic. The theorem forces $W_0(P)\ge 250/391\approx 0.639386$, while the min-Rains certificate gives $M(P)\le 6393/10000=0.6393$; the two one-shot values differ in the fourth decimal, so an exact or high-precision SDP directly checks the one-shot gap. If the computed $W_0(P)$ were no larger than $M(P)$, the range-witness inequality would be false and the regularization argument would collapse.

Watch

Extended reading notes

Core claim

The central discovery is an explicit rank-three projection $P$ in $\mathbb{C}^3\otimes\mathbb{C}^3$, spanned by three two-edge vectors, such that for every state $\rho$ with support $P$, $$$E^{{\infty}}$_{0,\mathrm{PPT}}(\rho) \le \log\|$T^{{\Gamma}}$\|_1 < \log\frac{391}{250} < -\log\frac{6393}{10000} \le R_{\min}(\rho).$$ The operator $T$ is a non-Hermitian 'range-supported tensor witness' with $PT=T$ and $\operatorname{Tr}T=1$; its partial-transpose trace norm is computed exactly from two singular values. The Hermitian operator $R$ used for the lower side dominates $P$, but has an eigenvalue larger than one, which is why the min-Rains program misses the effect constraint. Because the constants are rational and the comparisons are exact, the strict inequality is a theorem, not a numerical accident. The conclusion is that the discarded constraint $E\le 1$ survives arbitrary tensor powers, and the min-Rains relative entropy does not give the exact regularized rate.

Load-bearing premise

The argument rests on the imported one-shot characterization that exact PPT distillation from a state is determined by the semidefinite program $W_0(P)=\min\{\|E^{\Gamma}\|_\infty: P\le E\le 1\}$ for the support projection $P$; if that characterization were not exact for actual PPT operations, the strict gap proved here would be a statement about the program rather than about distillation.

Editorial extensions

If this is right

For every state supported on the constructed qutrit subspace, the regularized exact PPT distillable entanglement is at most $\log(391/250)$, a number strictly smaller than the min-Rains value $-\log(6393/10000)$.
The one-shot constraint $E\le 1$ is asymptotically relevant: the strict one-shot gap between $W_0(P)$ and $M(P)$ does not disappear after tensor powers.
The min-Rains relative entropy cannot be used as the closed-form formula for exact PPT distillable entanglement; any exact formula must encode the identity action on the input support.
Because the bound holds for every state with support $P$, the separation is a geometric property of the subspace, not of a particular density matrix inside it.

Reading between the lines

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

The range-witness test suggests a general search strategy for other counterexamples: for a candidate support, optimize $\|T^{\Gamma}\|_1 M(P)$ over operators $T$ with $PT=T$ and $\operatorname{Tr}T=1$; a value below one certifies a separation, and this paper's proof only requires finding one such pair.
The reciprocal weight pattern and the quarter-turn phase that make the coherence block simple hint that larger gaps may be attainable by weighted cycle supports with more edges or different phases, though the optimum for the present family is not proved.
If exact LOCC distillation ever gets a support-only one-shot characterization analogous to $W_0$, the same identity-on-support rigidity would likely force the corresponding relaxed entropy to fail tightness as well, in any dimension where such a witness exists.
The paper leaves open the exact value of $E^{\infty}_{0,\mathrm{PPT}}(\rho_{\star})$ for the constructed support; the certified upper and lower bounds differ by about $2\times 10^{-4}$ bits, so pinning down the value might reveal the next constraint an exact formula must include.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

Two things to know about arXiv:2608.12135. First, the separation is genuine: the min-Rains relative entropy is not tight for exact PPT distillation, and the proof is exact, with rational arithmetic closing a gap of 337/3910000. Second, the paper's real contribution is the method, not just the scalar answer. The observation that every feasible exact-distillation effect acts as the identity on the input support (Lemma 2.1) is simple and powerful, and the tensor-stable range-supported witness (Theorem 2.2) turns that rigidity into a blocklength-robust upper bound. That is the part people will build on.

The counterexample is well chosen: a rank-three qutrit subspace built from three weighted cycle edges. The certificates T and R are explicit, and the verification is complete: R-P positivity is checked block by block with positive determinants, the partial transpose spectrum of R is computed via the characteristic polynomial, and the singular values of T^Gamma are bounded by rationals. I spot-checked the key claims and found the arithmetic consistent. The norm margin is tiny but rigid, with no fitted slack covering a gap.

The weak spots are modest. The paper imports the Wang-Duan characterization W0(P)=min{||E^Gamma||_infinity : P<=E<=1} without re-deriving it; that is standard and published, so it is not a defect, but a referee should verify that the stated version applies to arbitrary states with support P, including the rounding relations in Eqs. (2.2)-(2.4). The handwritten check of the singular-value decomposition of K in Eqs. (3.22)-(3.23) contains a small typo: the vector b2 should have (-iz/2, alpha, iz/2), not (iz/2, alpha, -iz/2). It changes nothing, since the two rank-one terms still have orthogonal input/output spaces and the singular values stated in Eq. (3.25) are unaffected. Still, it should be fixed. The absence of code for the numerical search is minor; Section 4 reconstructs the search transparently, and the final proof is self-contained.

Who is this for? Anyone working on Rains bounds, SDP relaxations of distillable entanglement, or the asymptotic structure of exact entanglement manipulation. It answers an explicit open question from WD17 and BDWW19, so it deserves a serious referee. I would send it to a good quant-ph referee with a request to re-verify the arithmetic in Section 3 and to check whether the non-Hermitian witness technique extends to other supports. After a minor revision fixing the typo and perhaps adding a short code snippet for the certificates, it should be accepted.

Referee Report

0 major / 3 minor

Summary. The paper addresses the asymptotic tightness of the min-Rains relative entropy as a single-letter upper bound on the regularized exact PPT distillable entanglement. It introduces a 'range-supported tensor witness' T satisfying PT=T and TrT=1, and proves (Theorem 2.2) that for every n, W0(P^⊗n) ≥ ||T^Γ||_1^{-n}, giving E^∞_{0,PPT}(ρ) ≤ log||T^Γ||_1 for every state with support projection P. Pairing such a witness with a feasible dual certificate R ≥ P for the min-Rains SDP yields a strict separation criterion (Corollary 2.3). The main construction is an explicit rank-three qutrit–qutrit projection P (Section 3) with rational certificates T and R satisfying ||T^Γ||_1 < 391/250 and ||R^Γ||_∞ = 6393/10000, separated by the exact margin 337/3910000. Consequently every state supported on P has E^∞_{0,PPT}(ρ) < R_min(ρ), answering in the negative the question left open in [WD17] and [BDWW19].

Significance. Assuming the standard Wang–Duan one-shot characterization (Eq. (2.2)), the result is sound and settles an open problem in entanglement theory. The significance is twofold: it disproves the conjectured exactness of the min-Rains relative entropy for exact PPT distillation, and it introduces a new tensor-stable technique (the range-supported witness) that converts the fixed-action rigidity of feasible distillation effects into a single-letter bound. The counterexample is unusually verifiable: all certificates are explicit rational matrices, the semidefinite comparisons are reduced to 2×2 determinants and elementary eigenvalue computations, and the final margin is an exact rational number. This makes the proof easy to audit and the result likely to be influential for further studies of asymptotic exact entanglement manipulation.

minor comments (3)

[Section 2 (after Eq. (2.9))] The sentence 'where (i) is the strong duality established in Ref. [WD17] follows from the standard Slater condition [VB96]' is grammatically garbled; it should read, for example, 'where (i) is the strong duality, established in Ref. [WD17] via the standard Slater condition [VB96].'
[Section 3.1, Eqs. (3.22)–(3.23)] The decomposition of K is correct as printed: with b2 = (iz/2, α, -iz/2)^T one has b2† = (-iz/2, α, iz/2), and a1 b1† + a2 b2† reproduces Eq. (3.21). Displaying b2† explicitly would remove any doubt for readers; the flagged 'typo' does not affect the singular values in Eq. (3.25) or the final bound.
[Section 2, Eq. (2.2)] The proof relies on the Wang–Duan one-shot characterization without re-derivation. This is an appropriate citation of a standard published result, but a one-sentence reminder that all subsequent conclusions are conditional on Eq. (2.2) would help the reader distinguish the internal proof from the imported theorem.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found; the separation proof is self-contained after standard imported SDP characterization.

full rationale

The derivation is not circular. The central claim, Theorem 3.1, is established by constructing explicit operators T and R and verifying, by exact rational arithmetic, the inequalities PT=T, TrT=1, R>=P, ||T^Gamma||_1 < 391/250, ||R^Gamma||_inf = 6393/10000, and 391/250 < 10000/6393. These certificates are not fitted to the unknown values of E^infinity or R_min; they are independent, explicit operators whose relevant norms are computed directly. The upper bound E^infinity <= log ||T^Gamma||_1 follows from Theorem 2.2, whose proof uses only Lemma 2.1, Hölder's inequality, and the multiplicativity of the trace norm under tensor powers. The lower bound R_min >= -log ||R^Gamma||_inf follows from dual feasibility in the standard min-Rains SDP. The only imported ingredient is the Wang-Duan one-shot characterization W0(P)=min{||E^Gamma||_inf : P<=E<=1} and the strong duality for the min-Rains program; these are published, standard results, cited explicitly, and they are inputs to the argument rather than conclusions derived from it. Although several cited results are from the same research group, the paper does not invoke any unverified self-citation to forbid alternatives or to force the separation; the separation is certified by self-contained exact inequalities. Thus no step in the derivation reduces, by construction or by fitted parameter, to the claim being proved.

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

The central claim needs three kinds of input: the published Wang-Duan SDP characterizations that define the two compared quantities, completely standard operator-inequality tools, and the explicit coefficients of the two certificates, which were found numerically but are verified with exact rational arithmetic in the paper. No hidden parameters are left to the reader: every number entering the final inequality chain is printed and checked exactly. No new physical entities are postulated.

free parameters (3)

T coefficients x, y, z = x=1319/5000, y=444/5000, z=737/5000
Define the range witness T in Eqs. (3.11)-(3.14). Found by numerical optimization (Section 4.2), then rounded to rationals that keep x+y+z=1/2 exact. Every required inequality is then verified exactly in the proof.
R coefficients m, r, e = m=6393/10000, r=933/2500, e=3607/10000
Define the min-Rains dual certificate R in Eqs. (3.30)-(3.32). Found by numerical optimization (Section 4.3), then moved to the feasible side of the determinant and spectral constraints. Verified exactly, including the margin m^2 - (2r^2+e^2) = 17/390625.
Support vectors: weights and phases = ratios 8:7, 7:8, 1:1; phases 0, 0, pi/2
Define the counterexample support P in Eq. (3.2), found by the outer search over weighted cycle supports (Section 4.1). The separation theorem is proven for exactly this support, so these parameters are part of the construction rather than of a model fit.

assumptions (4)

domain assumption Wang-Duan characterization: one-shot exact PPT distillation is governed by W_0(P) = min{||E^Gamma||_infinity : P <= E <= 1} and depends only on the support P.
Invoked in Section 2, Eqs. (2.2)-(2.4). The paper defines E^infinity_{0,PPT} through W_0(P^{tensor n}) and does not re-derive this published 2016 result. If it were inexact, the separation would not apply to the operational distillation rate.
domain assumption Wang-Duan min-Rains duality and multiplicativity: M(P) = min{||R^Gamma||_infinity : R >= P}, and M(P tensor Q) = M(P)M(Q).
Used in Section 2, Eq. (2.9) and Eq. (2.10), to identify R_min(rho) with -log M(P) and to make it single-letter additive. The strict separation itself needs only weak duality, which is elementary and implicit in Corollary 2.3.
standard math Standard analytic tools: Holder's inequality for trace norms, multiplicativity ||A tensor B||_1 = ||A||_1 ||B||_1, Fekete's lemma, and Slater-type SDP duality.
Used in Theorem 2.2 (Eq. (2.19)), in Lemma A.1 for the regularization, and in the duality step (2.8)-(2.9).
standard math The partial transpose is trace-preserving and Hilbert-Schmidt self-adjoint: Tr(XY) = Tr(X^Gamma Y^Gamma).
Used in Eq. (2.19) of Theorem 2.2 to move the partial transpose from E onto T_n before applying Holder's inequality.

how reviews work

0 comments

Cite this review

Pith. "Pith review of The Min-Rains Relative Entropy Is Not Tight for Exact PPT Entanglement Distillation." pith.science (2026). https://pith.science/paper/GUCD7E3P

@misc{pith2026260812135,
  author       = {Pith},
  title        = {Pith review of: The Min-Rains Relative Entropy Is Not Tight for Exact PPT Entanglement Distillation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GUCD7E3P}},
  note         = {Machine review of arXiv:2608.12135}
}

read the original abstract

Exact entanglement distillation converts a noisy bipartite state into a maximally entangled state with zero error. Under completely PPT-preserving operations, the additive min-Rains relative entropy provides a single-letter upper bound on the regularized distillation rate. An interesting problem in entanglement theory dating back to 2016 has been whether this bound is always tight. Here we resolve this question in the negative. The key is a tensor-stable rigidity absent from the min-Rains relaxation: every feasible exact-distillation effect must act as the identity on the support of the input state. We convert this constraint into a new single-letter upper bound using a generally non-Hermitian, range-supported witness. For a rank-three subspace, we show this upper bound lies strictly below the min-Rains relative entropy for every state with that support. Thus, the constraint discarded by the min-Rains relaxation remains relevant under arbitrary tensor powers. Our result rules out the min-Rains relative entropy as a closed-form formula for exact PPT distillable entanglement and reveals the subtle asymptotic structure of exact entanglement manipulation under PPT operations.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

52 extracted references · 37 canonical work pages

[1]

2018 , doi =

John Watrous , title =. 2018 , doi =

2018
[2]

Hayashi, Masahito , doi =

work page
[3]

Khatri, Sumeet and Lami, Ludovico and Wilde, Mark M , mendeley-groups =

work page
[4]

Wang, Xin , journal =

work page
[5]

New Journal of Physics , mendeley-groups =

Wang, Xin and Wilde, Mark M and Su, Yuan , doi =. New Journal of Physics , mendeley-groups =. arXiv , arxivId =:1903.04483 , file =

arXiv 1903
[6]

Pure-state transformations and catalysis under operations that completely preserve positivity of partial transpose , author =. Phys. Rev. A , volume =. 2008 , month =. doi:10.1103/PhysRevA.78.012317 , url =

work page doi:10.1103/physreva.78.012317 2008
[7]

Efficiency of deterministic entanglement transformation , author =. Phys. Rev. A , volume =. 2005 , month =. doi:10.1103/PhysRevA.71.022305 , url =

work page doi:10.1103/physreva.71.022305 2005
[8]

Rigorous treatment of distillable entanglement , author =. Phys. Rev. A , volume =. 1999 , month =. doi:10.1103/PhysRevA.60.173 , url =

work page doi:10.1103/physreva.60.173 1999

Show all 52 references

[9]

Erratum: Bound on distillable entanglement [Phys. Rev. A 60, 179 (1999)] , author =. Phys. Rev. A , volume =. 2000 , month =. doi:10.1103/PhysRevA.63.019902 , url =

1999 doi
[10]

Tutorials in Operations Research: Emerging and Impactful Topics in Operations , mendeley-groups =

Siddhu, Vikesh and Tayur, Sridhar , doi =. Tutorials in Operations Research: Emerging and Impactful Topics in Operations , mendeley-groups =. arXiv , arxivId =:2112.08276 , file =

arXiv
[11]

Zhu, Chengkai and Zhu, Chenghong and Wang, Xin , journal =
[12]

Nature Physics , mendeley-groups =

Hastings, Matthew B , doi =. Nature Physics , mendeley-groups =. arXiv , arxivId =:0809.3972 , file =

arXiv
[13]

IEEE Transactions on Information Theory , keywords =

Portmann, Christopher and Matt, Christian and Maurer, Ueli and Renner, Renato and Tackmann, Bjorn , doi =. IEEE Transactions on Information Theory , keywords =. arXiv , arxivId =:1512.02240 , file =

arXiv
[14]

Quantum , mendeley-groups =

Abbott, Alastair A and Wechs, Julian and Horsman, Dominic and Mhalla, Mehdi and Branciard, Cyril , doi =. Quantum , mendeley-groups =. arXiv , arxivId =:1810.09826 , file =

arXiv
[15]

Chiribella, Giulio and Wilson, Matt and Chau, H. F. , doi =. Physical Review Letters , mendeley-groups =. arXiv , arxivId =:2005.00618 , file =

2005 arXiv
[16]

New Journal of Physics , keywords =

Chiribella, Giulio and Banik, Manik and Bhattacharya, Some Sankar and Guha, Tamal and Alimuddin, Mir and Roy, Arup and Saha, Sutapa and Agrawal, Sristy and Kar, Guruprasad , doi =. New Journal of Physics , keywords =. arXiv , arxivId =:1810.10457 , file =

arXiv
[17]

Physical Review Letters , mendeley-groups =

Ebler, Daniel and Salek, Sina and Chiribella, Giulio , doi =. Physical Review Letters , mendeley-groups =. arXiv , arxivId =:1711.10165 , file =

arXiv
[18]

Physical Review A , mendeley-groups =

Chiribella, Giulio and D'Ariano, Giacomo Mauro and Perinotti, Paolo and Valiron, Benoit , doi =. Physical Review A , mendeley-groups =
[19]

Physical Review Letters , mendeley-groups =

Zhao, Xiaobin and Yang, Yuxiang and Chiribella, Giulio , doi =. Physical Review Letters , mendeley-groups =. arXiv , arxivId =:1912.02449 , file =

1912 arXiv
[20]

Physical Review A , mendeley-groups =

Bennett, Charles H and DiVincenzo, David P and Fuchs, Christopher A and Mor, Tal and Rains, Eric and Shor, Peter W and Smolin, John A and Wootters, William K , doi =. Physical Review A , mendeley-groups =
[21]

Physical Review Letters , mendeley-groups =

Ghosh, Sibasish and Kar, Guruprasad and Roy, Anirban and SenDe, Aditi and Sen, Ujjwal , file =. Physical Review Letters , mendeley-groups =
[22]

Physical Review Letters , mendeley-groups =

Walgate, Jonathan and Short, Anthony J and Hardy, Lucien and Vedral, Vlatko , file =. Physical Review Letters , mendeley-groups =
[23]

Physical Review Letters , mendeley-groups =

Fan, Heng , file =. Physical Review Letters , mendeley-groups =
[24]

Physical Review Letters , mendeley-groups =

Bandyopadhyay, Somshubhro , file =. Physical Review Letters , mendeley-groups =
[25]

Communications in mathematical physics , mendeley-groups =

Matthews, William and Winter, Andreas , file =. Communications in mathematical physics , mendeley-groups =
[26]

Physical Review Letters , mendeley-groups =

Wang, Xin and Wilde, Mark M and Su, Yuan , doi =. Physical Review Letters , mendeley-groups =. arXiv , arxivId =:1812.10145 , file =

arXiv
[27]

Quantum , month =

Yirka, Justin and Subasi, Yigit , doi =. Quantum , month =. arXiv , arxivId =:2010.03080 , issn =

2010 arXiv
[28]

Physical Review A , mendeley-groups =

Wang, Xin and Duan, Runyao , doi =. Physical Review A , mendeley-groups =
[29]

Physical Review A , month =

Wang, Xin and Duan, Runyao , doi =. Physical Review A , month =
[30]

Physical Review Letters , month =

Christandl, Matthias and K. Physical Review Letters , month =. doi:10.1103/PhysRevLett.102.020504 , eprint =

doi
[31]

Haug, Tobias and Kim, M.S. , doi =. PRX Quantum , keywords =
[32]

Physical Review A , mendeley-groups =

Hayden, Patrick and Winter, Andreas , doi =. Physical Review A , mendeley-groups =. arXiv , arxivId =:0204092 , file =
[33]

Exponential Error Suppression for Near-Term Quantum Devices , author =. Phys. Rev. X , volume =. 2021 , month =. doi:10.1103/PhysRevX.11.031057 , url =

2021 doi
[34]

2022 , eprint=

Quantum Error Mitigation , author=. 2022 , eprint=

2022
[35]

Physical review letters , volume=

Direct estimations of linear and nonlinear functionals of a quantum state , author=. Physical review letters , volume=. 2002 , publisher=

2002
[36]

Journal of Physics A: Mathematical and Theoretical , volume=

Entanglement spectroscopy with a depth-two quantum circuit , author=. Journal of Physics A: Mathematical and Theoretical , volume=. 2019 , publisher=

2019
[37]

Virtual Distillation for Quantum Error Mitigation , author =. Phys. Rev. X , volume =. 2021 , month =. doi:10.1103/PhysRevX.11.041036 , url =

2021 doi
[38]

Bound on distillable entanglement , author =. Phys. Rev. A , volume =. 1999 , month =. doi:10.1103/PhysRevA.60.179 , url =

1999 doi
[39]

, title =

Rains, Eric M. , title =. IEEE Transactions on Information Theory , volume =. 2001 , doi =

2001
[40]

and Brassard, Gilles and Popescu, Sandu and Schumacher, Benjamin and Smolin, John A

Bennett, Charles H. and Brassard, Gilles and Popescu, Sandu and Schumacher, Benjamin and Smolin, John A. and Wootters, William K. , title =. Physical Review Letters , volume =. 1996 , doi =

1996
[41]

and DiVincenzo, David P

Bennett, Charles H. and DiVincenzo, David P. and Smolin, John A. and Wootters, William K. , title =. Physical Review A , volume =. 1996 , doi =

1996
[42]

Quantum Entanglement , journal =

Horodecki, Ryszard and Horodecki, Pawe. Quantum Entanglement , journal =. 2009 , doi =

2009
[43]

IEEE Transactions on Information Theory , volume =

Fang, Kun and Wang, Xin and Tomamichel, Marco and Duan, Runyao , title =. IEEE Transactions on Information Theory , volume =. 2019 , doi =

2019
[44]

Resource Theory of Entanglement for Bipartite Quantum Channels , year =

B. Resource Theory of Entanglement for Bipartite Quantum Channels , year =. 1907.04181 , archivePrefix =

1907 arXiv
[45]

and Brassard, Gilles and Cr

Bennett, Charles H. and Brassard, Gilles and Cr. Teleporting an Unknown Quantum State via Dual Classical and. Physical Review Letters , volume =. 1993 , doi =

1993
[46]

, title =

Ekert, Artur K. , title =. Physical Review Letters , volume =. 1991 , doi =

1991
[47]

Briegel, Hans-J. and D. Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication , journal =. 1998 , doi =

1998
[48]

Ignacio and Ekert, Artur K

Cirac, J. Ignacio and Ekert, Artur K. and Huelga, Susana F. and Macchiavello, Chiara , title =. Physical Review A , volume =. 1999 , doi =

1999
[49]

Reviews of Modern Physics , volume =

Chitambar, Eric and Gour, Gilad , title =. Reviews of Modern Physics , volume =. 2019 , doi =

2019
[50]

New Journal of Physics , volume =

Regula, Bartosz and Fang, Kun and Wang, Xin and Gu, Mile , title =. New Journal of Physics , volume =. 2019 , doi =. 1906.01648 , archivePrefix =

2019 arXiv
[51]

, title =

Nielsen, Michael A. , title =. Physical Review Letters , volume =. 1999 , doi =

1999
[52]

SIAM Review , volume =

Vandenberghe, Lieven and Boyd, Stephen , title =. SIAM Review , volume =. 1996 , doi =

1996

Pith tools

Reviewed August 16, 2026 · model on record in the stance chip above.

[1] [1]

2018 , doi =

John Watrous , title =. 2018 , doi =

2018

[2] [2]

Hayashi, Masahito , doi =

work page

[3] [3]

Khatri, Sumeet and Lami, Ludovico and Wilde, Mark M , mendeley-groups =

work page

[4] [4]

Wang, Xin , journal =

work page

[5] [5]

New Journal of Physics , mendeley-groups =

Wang, Xin and Wilde, Mark M and Su, Yuan , doi =. New Journal of Physics , mendeley-groups =. arXiv , arxivId =:1903.04483 , file =

arXiv 1903

[6] [6]

Pure-state transformations and catalysis under operations that completely preserve positivity of partial transpose , author =. Phys. Rev. A , volume =. 2008 , month =. doi:10.1103/PhysRevA.78.012317 , url =

work page doi:10.1103/physreva.78.012317 2008

[7] [7]

Efficiency of deterministic entanglement transformation , author =. Phys. Rev. A , volume =. 2005 , month =. doi:10.1103/PhysRevA.71.022305 , url =

work page doi:10.1103/physreva.71.022305 2005

[8] [8]

Rigorous treatment of distillable entanglement , author =. Phys. Rev. A , volume =. 1999 , month =. doi:10.1103/PhysRevA.60.173 , url =

work page doi:10.1103/physreva.60.173 1999