Pith. sign in

REVIEW 3 major objections 4 minor 1 cited by

Generalized Quantum Stein's Lemma for Classical-Quantum Dynamical Resources

T0 review · 3 major / 4 minor · reviewed 2026-08-04 · deepseek-v4-flash

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

Pith's one-line read Generalized quantum Stein's lemma for CQ channels: discrimination error exponent equals the regularized relative entropy of resource.

desk verdict Main theorem isn't proven because Lemma 7's inequality goes the wrong way; the rest of the machinery is plausible and worth a referee's time. read the letter →

arxiv 2509.07271 v1 pith:MVRKQBNO submitted 2025-09-08 quant-ph

Masahito Hayashi , Hayata Yamasaki This is my paper
classification quant-ph MSC 81P4594A1794A40 PACS 03.67.Hk03.67.-a
keywords generalizedquantumStein'slemmaclassical-quantumchannelsresourcetheorieschannelconversionhypothesistestingerrorexponentsregularizedrelativeentropyreversibleframeworkcapacities
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

This paper proves a generalized quantum Stein's lemma directly for classical-quantum (CQ) channels: when many independent copies of a channel are tested against any convex, compact, tensor-closed set of 'free' channels, the optimal exponential rate at which the type II error decays equals the regularized relative entropy of the channel to that set. The equality is the channel analogue of the generalized quantum Stein's lemma already known for quantum states, and it extends the reversible resource-theory framework from static states to dynamical resources. On top of the lemma, the paper derives a 'second law' for CQ channels: under asymptotically resource-non-generating operations, any two resource channels interconvert at a rate equal to the ratio of their regularized relative entropies. Because this derivation drops the asymptotic-continuity assumption that earlier channel frameworks required, it applies to conventional channel coding, where optimizing over inputs is essential. If correct, the paper reduces CQ channel discrimination and conversion to a single resource measure.

What carries the argument

The paper adapts three state-setting tools to channels with classical inputs: (1) a pinching superchannel that, for each input, pinches the candidate channel's output to make it commute with the free channel's output, preserving error exponents up to o(n); (2) an information-spectrum projection test on the commuting pair; (3) Rényi-divergence upper bounds on type II errors, made additive by the fact that for CQ channels the divergence of a tensor product splits into a sum of maxes over independent inputs. A minimax argument based on the Choi operator lets the worst free channel be moved outside the minimization over inputs and POVMs. The direct part is driven by an 'update lemma' that iterat

What would settle it

Take two two-input CQ channels with qubit outputs, choose ε ∈ (0,1), compute β_ε(Φ1∥Φ2) by optimizing over input distributions and POVMs, and compare it with β_ε(Φ1(x*)∥Φ2(x*)) for the input x* maximizing the sandwiched Rényi divergence. If the minimized channel-level error is strictly smaller, Lemma 7's inequality (94) fails; repeating this for increasing n would also show whether Proposition 9's bound can be restored.

Watch

Extended reading notes

Core claim

Theorem 4 states that for any finite-input/finite-output CQ channel Φ and any family F of free CQ channels satisfying four axioms (a full-rank free channel exists, compactness, tensor closure, convexity), the limit of −(1/n) log β_ε(Φ^⊗n ∥ F) exists and equals the limit of (1/n) D(Φ^⊗n ∥ F). Here β_ε is the minimal worst-case type II error when n copies of Φ are tested against any member of F while the type I error is kept below ε, and D is the max-over-inputs quantum relative entropy, minimized over free channels. The central quantitative content is that input optimization—choosing a distribution over classical inputs and a POVM per input—does not change the achievable exponent beyond the r

Load-bearing premise

The strong-converse proof rests on Lemma 7's bound comparing the CQ-channel type II error to the type II error at a single worst input; the direction of that inequality is asserted as −log β_ε(Φ1∥Φ2) ≤ −log β_ε(Φ1(x*)∥Φ2(x*)), but the minimization in the definition makes the reverse direction the generally true one. If this bound cannot be repaired, the upper half of Theorem 4 does not follow as written.

Editorial extensions

If this is right

  • Optimal discrimination of a CQ channel from any free set is fully characterized by the regularized relative entropy; no separate computation of input distributions is needed in the limit.
  • CQ channel conversion becomes reversible: every resource channel is asymptotically equivalent to a number of 'resource units' equal to R∞_R, so interconversion rates are ratios of this single quantity.
  • Conventional channel coding with input optimization falls inside the framework, so the capacity of a CQ channel and reverse-Shannon-type conversion rates emerge as special cases.
  • The state version of the generalized quantum Stein's lemma is recovered when there is a single channel input, unifying static and dynamical resource theories.
  • Known capacity bounds for replacer-free sets are reproduced without additional operational assumptions beyond the asymptotically resource-non-generating property.

Reading between the lines

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

  • A repaired proof of the strong converse would make the equality robust; the most direct check is to test Lemma 7's inequality numerically on two-input CQ channels, since the current inequality direction appears reversed.
  • If Theorem 19 holds, any asymptotically resource-non-generating protocol for CQ channels is governed by one number; this suggests a collapse of many channel-coding rates into a single-parameter family, and can be tested by comparing rates under non-signaling versus entanglement-assisted operations.
  • The techniques isolate where classical inputs do the work: additivity via separated maxima, the pinching superchannel, and the polynomial bound on distinct eigenvalues. Generalizing to fully quantum channels would require replacing all three, so the QQ case is a genuinely separate problem.
  • Because replacer channels form the zero-resource set and have zero capacity, the ratio formula directly predicts the rate of noiseless channel simulation, which is measurable in principle.
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

3 major / 4 minor

Summary. The paper claims a direct generalization of the generalized quantum Stein's lemma to classical-quantum (CQ) channels. The central result, Theorem 4, states that for a CQ channel Φ and any free-set family F satisfying axioms CQ1–CQ4, the optimal type-II exponent for distinguishing Φ^⊗n from F equals the regularized relative entropy of resource: lim_n −(1/n) log β_ε(Φ^⊗n∥F) = lim_n (1/n) D(Φ^⊗n∥F). The proof is organized as a strong-converse part (Proposition 9) and a direct part (Proposition 18), built on CQ adaptations of pinching, information-spectrum, and Rényi-type bounds. On this basis, the paper constructs a reversible QRT framework for CQ channel conversion under asymptotically resource-non-generating operations (Theorem 19), characterizes the regularized relative entropy through logarithmic generalized robustness (Proposition 24), and applies the framework to channel-capacity and reverse-Shannon-type scenarios.

Significance. If correct, this would be a genuine advance: it is a channel-level (not Choi-state) version of the generalized Stein's lemma, it removes the asymptotic-continuity assumption of Ref. [23], and it yields a reversible resource theory for a non-trivial class of dynamical resources, with channel coding as an application. The manuscript also contains useful standalone ingredients, including additivity of CQ channel divergences (Lemma 1), the minimax characterization (Proposition 5), and CQ versions of pinching and information-spectrum methods. The results are not machine-checked, and the written proof has load-bearing gaps detailed below; I therefore do not regard the main claims as established in the present form.

major comments (3)
  1. [§III C 1, Lemma 7, Eq. (94)] The inequality in Eq. (94) has the wrong direction. By definition (70), β_ε(Φ1∥Φ2) = min_p min_{T_x∈T_{ε,Φ1,p}} Σ_x p(x) Tr[T_x Φ2(x)] ≤ β_ε(Φ1(x*)∥Φ2(x*)), since the right-hand side is obtained by taking p = δ_{x*}. Hence -log β_ε(Φ1∥Φ2) ≥ -log β_ε(Φ1(x*)∥Φ2(x*)), the reverse of (94). The chain (94)–(96) therefore does not establish the claimed upper bound (92). This is load-bearing: Lemma 8 passes (92) to the set F, and Proposition 9 uses Lemma 8 to prove the strong-converse inequality (102), which is one half of Theorem 4 (65). The statement of Lemma 7 may be recoverable by a different route, e.g. through β_ε(Φ1∥Φ2) = min_p β_ε(ρ_p∥σ_p) with ρ_p = Σ_x p(x)|x⟩⟨x|⊗Φ1(x) and σ_p defined similarly, together with the state bound (91) and an inequality of the form D̃_α(ρ_p∥σ_p) ≤ eD_α(Φ1∥Φ2); but that argument is not present. As written, the strong-converse proof is invalid.
  2. [§IV C 2, Proposition 27] The proof of Proposition 27 states that 'Applying the generalized quantum Stein’s lemma ... we have a sequence {ε_n} ... satisfying lim_n ε_n = 0' together with the type-I bounds (434) and the type-II bound (435) at rate R^∞_R(Φ_in) − δ/3. However, Theorem 4 is stated and proved only for a fixed parameter ε ∈ (0,1); it does not imply a vanishing-type-I version with ε_n → 0 and an exponential type-II bound with the same optimal exponent. Since this stronger variant is needed for the direct half of Theorem 19, it must be stated and proved separately (or derived from Theorem 4 by an additional argument that controls the decay of ε_n). This is not a presentation matter; it is an unproven dependency in the main conversion theorem.
  3. [§III C 2, Lemma 16 and Proposition 18] Lemma 16, Eqs. (227) and (229), invokes Lemma 7 at (231)–(232), so the proof gap in Lemma 7 propagates into the direct part. Lemma 16 is used in Lemma 17 (the update lemma), and Lemma 17 is used in the proof of Proposition 18, the direct half of Theorem 4. Thus the sign error in Eq. (94) affects both halves of the main theorem as written, not only the strong-converse half. If Lemma 7 is repaired in the way suggested above, the uses in Lemma 16 must be re-examined with the repaired bound and the required CQ-state inequalities made explicit.
minor comments (4)
  1. [§II C, Eq. (34)] The limits are written 'lim inf_{n→0}' and 'lim sup_{n→0}'; they should be n→∞.
  2. [§III C 1, Proposition 9 proof] The proof refers to 'Lemma 3' for existence of the limit; the statement is Proposition 3, not Lemma 3.
  3. [§IV C 2, Proposition 27] In the proof, the parameter r is defined in (431), but later the text says 'where we use the definition (447) of r'; Eq. (447) defines r_n. Also the second condition after (427) repeats (427) instead of (428), and 'δ is the constant given by (433)' should refer to (430).
  4. [§III A, Task formulation] In the sentence 'the measurement outcome is T_{x^{(n)}}, we conclude that the unknown CQ channel state was Φ^{⊗n}', the phrase 'CQ channel state' is imprecise; the unknown object is a CQ channel, not a state. This does not affect the mathematics.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: Theorem 4 is derived directly for CQ channels; same-author citations are for proof techniques and are not load-bearing. (A separate correctness gap in Lemma 7's inequality direction is not circularity.)

full rationale

The central derivation is self-contained: Theorem 4 is proved from Proposition 9 (strong converse) and Proposition 18 (direct part), whose supporting lemmas (1, 2, 5-8, 10-17) are stated and proved in this paper rather than imported as black boxes. The heavy citation to Refs. [23,24] is to the state-level generalized quantum Stein's lemma for analogy and for proof techniques (pinching, information spectrum, update lemma); the CQ-channel versions are re-proved here. The only same-author citation that is not purely historical is the use of Ref. [23] to justify Axiom CQ4's necessity (Sec. II C), but this is an axiom-motivation statement, not a step in the proof of the equality (65) or of Theorem 19. No fitted parameter is renamed as a prediction, and no definition is circular. Separately, the paper contains a proof gap: Lemma 7's Eq. (94) asserts -log β_ε(Φ1∥Φ2) ≤ -log β_ε(Φ1(x*)∥Φ2(x*)), whereas the definition (70) gives the reverse inequality; this is a correctness concern for the strong-converse proof as written, not a circularity. Overall, circularity burden is low.

Assumptions & free parameters 0 free parameters · 8 assumptions · 0 invented entities

The central theorems rest on the four QRT axioms plus SC1, all standard domain assumptions. More concerning are two unproved ingredients: the claimed asymptotic continuity of R_R under CQ-channel diamond distance, inherited from [53], and the additivity of RR for replacer free sets. The proof also implicitly assumes a vanishing-error strengthening of Theorem 4.

assumptions (8)
  • domain assumption CQ1: Existence of a full-rank free CQ channel for every input set (supp(Φ(x))⊆supp(Φ_full(x))).
    Ensures relative entropy and Rényi variants are finite; standard in QRTs, stated in Sec. II C.
  • domain assumption CQ2: Each free set F(X→H) is compact.
    Guarantees minima in resource measures exist; standard QRT axiom, Sec. II C.
  • domain assumption CQ3: Free sets are closed under tensor product.
    Used in subadditivity (Lemma 2) and existence of regularized resource (Prop 3).
  • domain assumption CQ4: Each free set is convex.
    Needed for minimax characterization (Prop 5) and the update lemma (Lemma 17).
  • domain assumption SC1: Asymptotically resource-non-generating property measured by generalized robustness.
    Defines the relaxed operation class used in the reversible framework, Sec. IV A.
  • domain assumption Asymptotic continuity of R_R under diamond distance (Eq. 34).
    Asserted to follow from Ref. [53, Lemma 7] with states replaced by CQ channels, but no proof is given; used in Lemma 23 and Prop 26.
  • domain assumption Additivity RR(Φ⊗Φ') = RR(Φ) + RR(Φ') for replacer free sets (Eq. 483).
    Stated without proof in Sec. V B; used to identify R_R^∞ with C[Φ].
  • ad hoc to paper Lemma 7 inequality: −log β_ε(Φ1∥Φ2) ≤ −log β_ε(Φ1(x*)∥Φ2(x*)).
    The proof of the strong converse relies on this inequality, but it has the wrong direction (channel β ≤ single-input β). This is effectively an unproved and false assumption as written.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Generalized Quantum Stein's Lemma for Classical-Quantum Dynamical Resources." pith.science (2026). https://pith.science/paper/MVRKQBNO

@misc{pith2026250907271,
  author       = {Pith},
  title        = {Pith review of: Generalized Quantum Stein's Lemma for Classical-Quantum Dynamical Resources},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/MVRKQBNO}},
  note         = {Machine review of arXiv:2509.07271}
}
read the original abstract

Channel conversion constitutes a pivotal paradigm in information theory and its applications to quantum physics, providing a unified problem setting that encompasses celebrated results such as Shannon's noisy-channel coding theorem. Quantum resource theories (QRTs) offer a general framework to study such problems under a prescribed class of operations, such as those for encoding and decoding. In QRTs, quantum states serve as static resources, while quantum channels give rise to dynamical resources. A recent major advance in QRTs is the generalized quantum Stein's lemma, which characterizes the optimal error exponent in hypothesis testing to discriminate resource states from free states, enabling a reversible QRT framework for static resources where asymptotic conversion rates are fully determined by the regularized relative entropy of resource. However, applications of QRTs to channel conversion require a framework for dynamical resources. The earlier extension of the reversible framework to a fundamental class of dynamical resources, represented by classical-quantum (CQ) channels, relied on state-based techniques and imposed an asymptotic continuity assumption on operations, which prevented its applicability to conventional channel coding scenarios. To overcome this problem, we formulate and prove a generalized quantum Stein's lemma directly for CQ channels, by developing CQ-channel counterparts of the core proof techniques used in the state setting. Building on this result, we construct a reversible QRT framework for CQ channel conversion that does not require the asymptotic continuity assumption, and show that this framework applies to the analysis of channel coding scenarios. These results establish a fully general toolkit for CQ channel discrimination and conversion, enabling their broad application to core conversion problems for this fundamental class of channels.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Generalized quantum Stein's lemma for mixed sources

    quant-ph 2026-05 unverdicted novelty 6.0 of 10

    For composite quantum hypothesis testing with a mixed IID null hypothesis, the optimal type-II error exponent is the worst-case component when type-I error vanishes, but not for fixed nonzero type-I error.

Reference graph

Works this paper leans on

72 extracted references · 52 canonical work pages · cited by 1 Pith paper

  1. [23]

    Dennis, A

    E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, Journal of Mathematical Physics43, 4452 (2002)

    2002

  2. [1]

    (commutativity) for every inputx (n) ∈ Xn, ˜Φ(n) 1 and ˜Φ(n) 2 commute with each other ˜Φ(n) 1 x(n) ˜Φ(n) 2 x(n) = ˜Φ(n) 2 x(n) ˜Φ(n) 1 x(n) ; (159)

    work page

  3. [2]

    (approximation in operator inequality) for every in- putx (n) ∈ Xn, ˜Φ(n) 2 satisfies e−Cn Φ(n) 2 x(n) ≤ ˜Φ(n) 2 x(n) ≤e Cn Φ(n) 2 x(n) ; (160)

    work page

  4. [3]

    (distinguishability bounds) for anyϵ≥0, if we have Cn =o(n)asn→ ∞,(161) it holds that lim inf n→∞ − 1 n log h βϵ ˜Φ(n) 1 ˜Φ(n) 2 i ≤lim inf n→∞ − 1 n log h βϵ Φ(n) 1 Φ(n) 2 i ,(162) lim sup n→∞ − 1 n log h βϵ ˜Φ(n) 1 ˜Φ(n) 2 i ≤lim sup n→∞ − 1 n log h βϵ Φ(n) 1 Φ(n) 2 i ,(163) whereβ ϵ is defined as(70); 17

    work page

  5. [4]

    asymptotic continuity

    (invariance of regularized quantum relative en- tropy) if we have Cn =o(n)asn→ ∞,(164) it holds that lim inf n→∞ 1 n D ˜Φ(n) 1 ˜Φ(n) 2 = lim inf n→∞ 1 n D Φ(n) 1 Φ(n) 2 , (165) lim sup n→∞ 1 n D ˜Φ(n) 1 ˜Φ(n) 2 = lim sup n→∞ 1 n D Φ(n) 1 Φ(n) 2 , (166) whereDis defined as(9). Proof.We first provide construction ofn ˜Φ(n) 1 o n and n ˜Φ(n) 2 o n , followed...

    work page

  6. [5]

    Converse part In this section, we show the converse part of Theo- rem 19. To this end, we first show the following asymp- totic version of the monotonicity of the regularized rel- ative entropy of resource under asymptotically resource- non-generating operations. 32 Lemma 25(Monotonicity of regularized relative entropy of resource under asymptotically res...

    work page

  7. [6]

    Direct part In this section, we present the proof of the direct part of Theorem 19 as follows. Proposition 27(The direct part of the second law for CQ channels).For any familyFof sets of free CQ chan- nels satisfying Axioms CQ1, CQ2, CQ3, and CQ4, any family ˜Oof sequences of superchannels satisfying Ax- iom SC1, and any CQ channelsΦ in ∈ C(Xin → Hin)and ...

    work page

  8. [7]

    it holds that Θ∈ OR; (463)

    work page

Show all 72 references
  1. [8]

    there exists a CPTP linear mapNfromL(H in)to L(Hout)such that, for anyx out ∈ Xout, N= X xin∈Xin pΘ(xin|xout)NΘ,xin,xout ; (464)

  2. [9]

    The first and second conditions are equivalent

    there exist two reference systemsH X,R andH R, an entangle state˜ρ∈ D(H X,R ⊗ HR), a POVMn ˜Λxin|xout o xin onH X,R , and a CPTP linear map ˜NfromL(H in ⊗ HR)toL(H out)such that, for any xin ∈ Xin,x out ∈ Xout, andρ∈ D(H in), we have relations pΘ(xin|xout) = Tr h ˜Λxin|xout ⊗1...

  3. [10]

    Cover and J

    T. Cover and J. Thomas,Elements of Information The- ory(Wiley, 2012)

    2012

  4. [11]

    C. E. Shannon, A mathematical theory of communica- tion, The Bell System Technical Journal27, 379 (1948)

    1948

  5. [12]

    Hayashi,Quantum information theory: Mathematical Foundation(Springer, 2016)

    M. Hayashi,Quantum information theory: Mathematical Foundation(Springer, 2016)

    2016

  6. [13]

    A. S. Holevo,Quantum Systems, Channels, Information (De Gruyter, Berlin, Boston, 2019)

    2019

  7. [14]

    Watrous,The Theory of Quantum Information(Cam- bridge University Press, 2018)

    J. Watrous,The Theory of Quantum Information(Cam- bridge University Press, 2018)

    2018

  8. [15]

    M. M. Wilde,Quantum Information Theory, 2nd ed. (Cambridge University Press, 2017)

    2017

  9. [16]

    Holevo, The capacity of the quantum channel with general signal states, IEEE Transactions on Information Theory44, 269 (1998)

    A. Holevo, The capacity of the quantum channel with general signal states, IEEE Transactions on Information Theory44, 269 (1998)

    1998

  10. [17]

    Schumacher and M

    B. Schumacher and M. D. Westmoreland, Sending classi- cal information via noisy quantum channels, Phys. Rev. A56, 131 (1997)

    1997

  11. [18]

    C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thap- liyal, Entanglement-assisted classical capacity of noisy quantum channels, Phys. Rev. Lett.83, 3081 (1999)

    1999

  12. [19]

    Bennett, P

    C. Bennett, P. Shor, J. Smolin, and A. Thapliyal, Entanglement-assisted capacity of a quantum channel and the reverse shannon theorem, IEEE Transactions on Information Theory48, 2637 (2002)

    2002

  13. [20]

    Lloyd, Capacity of the noisy quantum channel, Phys

    S. Lloyd, Capacity of the noisy quantum channel, Phys. Rev. A55, 1613 (1997)

    1997

  14. [21]

    P. W. Shor, The quantum channel capacity and coherent information, inlecture notes, MSRI Workshop on Quan- tum Computation, Vol. 5 (2002)

    2002

  15. [22]

    Devetak, The private classical capacity and quantum capacity of a quantum channel, IEEE Transactions on Information Theory51, 44 (2005)

    I. Devetak, The private classical capacity and quantum capacity of a quantum channel, IEEE Transactions on Information Theory51, 44 (2005)

    2005

  16. [24]

    Hayden and J

    P. Hayden and J. Preskill, Black holes as mirrors: quan- tum information in random subsystems, Journal of High Energy Physics2007, 120 (2007)

    2007

  17. [25]

    C. H. Bennett, I. Devetak, A. W. Harrow, P. W. Shor, and A. Winter, The quantum reverse shannon theo- rem and resource tradeoffs for simulating quantum chan- nels, IEEE Transactions on Information Theory60, 2926 (2014)

    2014

  18. [26]

    Hayashi, H.-C

    M. Hayashi, H.-C. Cheng, and L. Gao, Resolvability of classical-quantum channels, IEEE Transactions on Infor- mation Theory71, 6061 (2025)

    2025

  19. [27]

    Kuroiwa and H

    K. Kuroiwa and H. Yamasaki, General Quantum Re- source Theories: Distillation, Formation and Consistent Resource Measures, Quantum4, 355 (2020)

    2020

  20. [28]

    Chitambar and G

    E. Chitambar and G. Gour, Quantum resource theories, Rev. Mod. Phys.91, 025001 (2019)

    2019

  21. [29]

    F. G. S. L. Brand˜ ao and M. B. Plenio, Entanglement theory and the second law of thermodynamics, Nature Physics4, 873–877 (2008)

    2008

  22. [30]

    F. G. Brandao and M. B. Plenio, A reversible theory of entanglement and its relation to the second law, Com- munications in Mathematical Physics295, 829 (2010)

    2010

  23. [31]

    F. G. S. L. Brand˜ ao and M. B. Plenio, A generalization of quantum stein’s lemma, Communications in Mathe- matical Physics295, 791 (2010)

    2010

  24. [32]

    Hayashi and H

    M. Hayashi and H. Yamasaki, Generalized quantum 40 stein’s lemma and second law of quantum resource theo- ries (2024), arXiv:2408.02722 [quant-ph]

    2024 arXiv

  25. [33]

    Lami, A solution of the generalized quantum stein’s lemma, IEEE Transactions on Information Theory71, 4454 (2025)

    L. Lami, A solution of the generalized quantum stein’s lemma, IEEE Transactions on Information Theory71, 4454 (2025)

    2025

  26. [34]

    Berta, F

    M. Berta, F. G. S. L. Brand˜ ao, G. Gour, L. Lami, M. B. Plenio, B. Regula, and M. Tomamichel, On a gap in the proof of the generalised quantum Stein’s lemma and its consequences for the reversibility of quantum resources, Quantum7, 1103 (2023)

    2023

  27. [35]

    Yamasaki and K

    H. Yamasaki and K. Kuroiwa, Generalized quantum stein’s lemma: Redeeming second law of resource the- ories (2024), arXiv:2401.01926v2 [quant-ph]

    2024 arXiv

  28. [36]

    K. Fang, H. Fawzi, and O. Fawzi, Generalized quan- tum asymptotic equipartition (2025), arXiv:2411.04035 [quant-ph]

    2025 arXiv

  29. [37]

    Fang, Error exponents of quantum state discrim- ination with composite correlated hypotheses (2025), arXiv:2508.12901 [quant-ph]

    K. Fang, Error exponents of quantum state discrim- ination with composite correlated hypotheses (2025), arXiv:2508.12901 [quant-ph]

    2025

  30. [38]

    F. G. S. L. Brand˜ ao and G. Gour, Reversible framework for quantum resource theories, Phys. Rev. Lett.115, 070503 (2015)

    2015

  31. [39]

    Regula and L

    B. Regula and L. Lami, Reversibility of quantum re- sources through probabilistic protocols, Nature Commu- nications15, 3096 (2024)

    2024

  32. [40]

    Takagi, K

    R. Takagi, K. Wang, and M. Hayashi, Application of the resource theory of channels to communication scenarios, Phys. Rev. Lett.124, 120502 (2020)

    2020

  33. [41]

    Aharonov, A

    D. Aharonov, A. Kitaev, and N. Nisan, Quantum circuits with mixed states, inProceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC ’98 (Association for Computing Machinery, New York, NY, USA, 1998) p. 20–30

    1998

  34. [42]

    Cooney, M

    T. Cooney, M. Mosonyi, and M. M. Wilde, Strong converse exponents for a quantum channel discrimina- tion problem and quantum-feedback-assisted communi- cation, Communications in Mathematical Physics344, 797 (2016)

    2016

  35. [43]

    Gour and A

    G. Gour and A. Winter, How to quantify a dynamical quantum resource, Phys. Rev. Lett.123, 150401 (2019)

    2019

  36. [44]

    Hayashi, Discrimination of two channels by adaptive methods and its application to quantum system, IEEE Transactions on Information Theory55, 3807 (2009)

    M. Hayashi, Discrimination of two channels by adaptive methods and its application to quantum system, IEEE Transactions on Information Theory55, 3807 (2009)

    2009

  37. [45]

    M. M. Wilde, M. Berta, C. Hirche, and E. Kaur, Amor- tized channel divergence for asymptotic quantum chan- nel discrimination, Letters in Mathematical Physics110, 2277 (2020)

    2020

  38. [46]

    Salek, M

    F. Salek, M. Hayashi, and A. Winter, Usefulness of adap- tive strategies in asymptotic quantum channel discrimi- nation, Phys. Rev. A105, 022419 (2022)

    2022

  39. [47]

    Hiai and D

    F. Hiai and D. Petz, The proper formula for relative en- tropy and its asymptotics in quantum probability, Com- munications in mathematical physics143, 99 (1991)

    1991

  40. [48]

    Ogawa and H

    T. Ogawa and H. Nagaoka, Strong converse and stein’s lemma in quantum hypothesis testing, IEEE Transac- tions on Information Theory46, 2428 (2000)

    2000

  41. [49]

    Hayashi, Optimal sequence of quantum measurements in the sense of stein’s lemma in quantum hypothesis test- ing, Journal of Physics A: Mathematical and General35, 10759 (2002)

    M. Hayashi, Optimal sequence of quantum measurements in the sense of stein’s lemma in quantum hypothesis test- ing, Journal of Physics A: Mathematical and General35, 10759 (2002)

    2002

  42. [50]

    Nagaoka and M

    H. Nagaoka and M. Hayashi, An information-spectrum approach to classical and quantum hypothesis testing for simple hypotheses, IEEE Transactions on Informa- tion Theory53, 534 (2007)

    2007

  43. [51]

    Umegaki, Conditional expectation in an operator alge- bra

    H. Umegaki, Conditional expectation in an operator alge- bra. IV. Entropy and information, Kodai Mathematical Seminar Reports14, 59 (1962)

    1962

  44. [52]

    M¨ uller-Lennert, F

    M. M¨ uller-Lennert, F. Dupuis, O. Szehr, S. Fehr, and M. Tomamichel, On quantum R´ enyi entropies: A new generalization and some properties, Journal of Mathe- matical Physics54, 122203 (2013)

    2013

  45. [53]

    M. M. Wilde, A. Winter, and D. Yang, Strong converse for the classical capacity of entanglement-breaking and hadamard channels via a sandwiched r´ enyi relative en- tropy, Communications in Mathematical Physics331, 593 (2014)

    2014

  46. [54]

    Petz, Quasi-entropies for finite quantum systems, Re- ports on Mathematical Physics23, 57 (1986)

    D. Petz, Quasi-entropies for finite quantum systems, Re- ports on Mathematical Physics23, 57 (1986)

    1986

  47. [55]

    E. H. Lieb and W. E. Thirring, Inequalities for the mo- ments of the eigenvalues of the schr¨ odinger hamiltonian and their relation to sobolev inequalities, inStudies in Mathematical Physics, edited by E. H. Lieb, B. Simon, and A. S. Wightman (Princeton University Press, Prin...

    1976

  48. [56]

    Araki, On an inequality of lieb and thirring, Letters in Mathematical Physics19, 167 (1990)

    H. Araki, On an inequality of lieb and thirring, Letters in Mathematical Physics19, 167 (1990)

    1990

  49. [57]

    Bluhm, A

    A. Bluhm, A. Capel, P. Gondolf, and A. P´ erez- Hern´ andez, Continuity of quantum entropic quantities via almost convexity, IEEE Transactions on Information Theory69, 5869 (2023)

    2023

  50. [58]

    continuity of quantum en- tropic quantities via almost convexity

    A. Bluhm, A. Capel, P. Gondolf, and A. P´ erez- Hern´ andez, Corrections to“continuity of quantum en- tropic quantities via almost convexity”, IEEE Transac- tions on Information Theory70, 5410 (2024)

    2024

  51. [59]

    Chiribella, G

    G. Chiribella, G. M. D’Ariano, and P. Perinotti, Quan- tum circuit architecture, Phys. Rev. Lett.101, 060401 (2008)

    2008

  52. [60]

    Chiribella, G

    G. Chiribella, G. M. D’Ariano, and P. Perinotti, Trans- forming quantum operations: Quantum supermaps, Eu- rophysics Letters83, 30004 (2008)

    2008

  53. [61]

    Chiribella, G

    G. Chiribella, G. M. D’Ariano, and P. Perinotti, Theo- retical framework for quantum networks, Phys. Rev. A 80, 022339 (2009)

    2009

  54. [62]

    A. Winter, Tight uniform continuity bounds for quantum entropies: Conditional entropy, relative entropy distance and energy constraints, Communications in Mathemati- cal Physics347, 291 (2016)

    2016

  55. [63]

    Fekete, ¨Uber die verteilung der wurzeln bei gewissen algebraischen gleichungen mit ganzzahligen koeffizienten, Mathematische Zeitschrift17, 228 (1923)

    M. Fekete, ¨Uber die verteilung der wurzeln bei gewissen algebraischen gleichungen mit ganzzahligen koeffizienten, Mathematische Zeitschrift17, 228 (1923)

    1923

  56. [64]

    J. v. Neumann, Zur theorie der gesellschaftsspiele, Math- ematische annalen100, 295 (1928)

    1928

  57. [65]

    Sion, On general minimax theorems., Pacific Journal of Mathematics8, 171–176 (1958)

    M. Sion, On general minimax theorems., Pacific Journal of Mathematics8, 171–176 (1958)

    1958

  58. [66]

    Komiya, Elementary proof for Sion’s minimax theo- rem, Kodai Mathematical Journal11, 5 (1988)

    H. Komiya, Elementary proof for Sion’s minimax theo- rem, Kodai Mathematical Journal11, 5 (1988)

    1988

  59. [67]

    L¨ owner,¨Uber monotone matrixfunktionen, Mathema- tische Zeitschrift38, 177 (1934)

    K. L¨ owner,¨Uber monotone matrixfunktionen, Mathema- tische Zeitschrift38, 177 (1934)

    1934

  60. [68]

    Hiai, Matrix analysis: Matrix monotone functions, matrix means, and majorization, Interdisciplinary Infor- mation Sciences16, 139 (2010)

    F. Hiai, Matrix analysis: Matrix monotone functions, matrix means, and majorization, Interdisciplinary Infor- mation Sciences16, 139 (2010)

    2010

  61. [69]

    Datta, Max-relative entropy of entanglement, alias log robustness, International Journal of Quantum Informa- tion07, 475 (2009)

    N. Datta, Max-relative entropy of entanglement, alias log robustness, International Journal of Quantum Informa- tion07, 475 (2009)

    2009

  62. [70]

    K. Fang, X. Wang, M. Tomamichel, and M. Berta, Quan- tum channel simulation and the channel’s smooth max- information, IEEE Transactions on Information Theory 41 66, 2129 (2020)

    2020

  63. [71]

    Oufkir, M

    A. Oufkir, M. Tomamichel, and M. Berta, Error exponent of activated non-signaling assisted classical-quantum channel coding (2024), arXiv:2410.01084 [quant-ph]

    2024 arXiv

  64. [72]

    Berta, M

    M. Berta, M. Christandl, and R. Renner, The quantum reverse shannon theorem based on one-shot information theory, Communications in Mathematical Physics306, 579 (2011)

    2011

Pith tools

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