Pith. sign in

REVIEW 2 major objections 4 minor 51 references

A new mixed-order Rényi divergence yields the first exact reliability functions for quantum soft covering and privacy amplification under sandwiched Rényi divergence of order α ≥ 2.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review

2026-07-30 13:58 UTC pith:2YVEJBRT

load-bearing objection First exact soft-covering reliability function under sandwiched Rényi (α≥2), via a clean new mixed-order divergence; restricted ensemble but theorems hold as stated. the 2 major comments →

arxiv 2607.27015 v1 pith:2YVEJBRT submitted 2026-07-29 quant-ph cs.ITmath.FAmath.IT

Reliability Functions of Quantum Soft Covering and Privacy Amplification via a Mixed-Order R\'enyi Divergence

Shi-Bing Li , Hongsen Qiu , Xinyu Zhang This is my paper
classification quant-ph cs.ITmath.FAmath.IT MSC 81P4594A1794A2494A40 PACS 03.67.-a03.67.Dd89.70.Cf
keywords quantum soft coveringprivacy amplificationsandwiched Rényi divergencemixed-order Rényi divergencereliability functionclassical-quantum channelsLieb trace functionalserror exponents
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

This paper builds a mixed-order order-two Rényi divergence from a negative-power Lieb trace functional and shows that it, together with the usual sandwiched Rényi quantities, completely determines two operational error exponents. For quantum soft covering with i.i.d. random codebooks, the reliability function under sandwiched Rényi divergence of order α ≥ 2 is the minimum of a rate gap measured by the new mixed-order mutual information and a rate gap measured by the ordinary sandwiched mutual information. For privacy amplification by random binning the same pattern appears in terms of the corresponding conditional entropies. A sympathetic reader cares because soft covering and privacy amplification sit under identification, channel simulation, and quantum key distribution, and until now the soft-covering reliability function had no exact single-letter formula even in the classical–quantum setting. The work also gives the new divergence a concrete operational meaning rather than leaving it as a formal matrix functional.

Core claim

For α ∈ [2, ∞), the reliability function of quantum soft covering with i.i.d. random codebooks equals min{R − I^{(α)}_2(X:E), (α−1)(R − I_α(X:E))} whenever R exceeds the sandwiched mutual information I_α; the reliability function of privacy amplification by random binning equals min{H^{(α)}_2(X|E) − R, (α−1)(H_α(X|E) − R)} whenever the key rate lies below H_α. Both formulas are exact (matching upper and lower bounds), and they are the first such exact characterizations for quantum soft covering.

What carries the argument

The mixed-order order-two Rényi divergence D^{(α)}_2(ρ∥σ) := log Tr(ρ σ^{(1−α)/α} ρ σ^{−1/α}), generated by a jointly convex negative-power Lieb trace functional. It supplies the mixed-order mutual information and conditional entropy that close the one-shot moment bounds and produce the matching exponents.

Load-bearing premise

The exact formulas are proved only for i.i.d. random codebooks and random binning extractors, and only when the sandwiched order is at least 2.

What would settle it

Pick an explicit classical–quantum state and a rate R above I_α; simulate the expected sandwiched divergence of random soft-covering codes of block length n and check whether −(1/n) log of that quantity converges to min{R − I^{(α)}_2, (α−1)(R − I_α)} rather than to a strictly larger or smaller number.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

Share X Bluesky LinkedIn Reddit HN

If this is right

  • Quantum soft covering under sandwiched Rényi divergence α ≥ 2 now has a single-letter reliability function, removing the previous gap between achievable and converse exponents for i.i.d. random codes.
  • The mixed-order mutual information and conditional entropy acquire direct operational meaning as the quantities that can dominate the error exponent.
  • Privacy amplification by random binning has a matching exact reliability function in the same α ≥ 2 regime.
  • At α = 2 the two competing terms coincide and recover a simple collision-probability identity.
  • The same trace-functional route suggests further divergences may pin down other quantum error exponents once their convexity is established.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the open α ∈ (0, 2) case turns out to need a critical-rate expression, that would indicate a genuine noncommutative phase change rather than a proof artifact.
  • The same mixed-order divergence is a natural candidate for classical–quantum channel resolvability exponents under sandwiched Rényi divergence, which the paper flags but does not resolve.
  • Deterministic or structured codebooks that beat the i.i.d. exponent would immediately demote the claimed reliability function from ensemble-exact to random-coding-exact.
  • Trace-distance reliability functions, still open here, may require different moment inequalities because the paper’s Rosenthal-plus-B_α estimates are tuned to Schatten-α geometry for α ≥ 2.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 4 minor

Summary. The paper introduces a mixed-order order-two Rényi divergence D^{(α)}_2(ρ∥σ)=log Tr(ρ σ^{(1-α)/α} ρ σ^{-1/α}) generated by a negative-power Lieb trace functional, establishes its additivity and comparison properties with the sandwiched Rényi divergence (Props. 1–3), and defines the associated mutual information I^{(α)}_2 and conditional entropy H^{(α)}_2. For α∈[2,∞) it derives exact single-letter reliability functions for i.i.d. random-codebook quantum soft covering (Thm. 9: E^{(α)}_{sc}=min{γ'(α),γ(α-1)} when R>I_α) and for random-binning privacy amplification (Thm. 12: E^{(α)}_{pa}=min{η'(α),η(α-1)} when 0<R<H_α). The proofs rest on a novel operator inequality (Thm. 5) controlling Bregman remainders B_α (Lem. 6), non-commutative Rosenthal bounds, and matching one-shot upper/lower estimates (Props. 11, 13 and Thm. 14) that tensorize. The authors explicitly flag the α∈(0,2) and trace-distance cases as open.

Significance. If correct, the work supplies the first exact reliability function for quantum soft covering and gives clean operational meanings to a new divergence that sits naturally between the order-2 and order-α sandwiched quantities. The analytic core (Thm. 5 + Lem. 6) is a reusable operator estimate of independent interest, and the matching one-shot bounds are obtained by standard but carefully combined tools (complex interpolation, BKS, Rosenthal, martingales/Rademacher). The restriction to i.i.d./random-binning ensembles and α≥2 is already acknowledged by the authors and does not diminish the value of the exact characterizations inside that regime. The results therefore constitute a solid advance in quantum error-exponent theory.

major comments (2)
  1. [Theorems 9, 12; Sect. 7] The central claims (Theorems 9 and 12) are proved only for i.i.d. random codebooks and random binning. While the authors correctly list non-i.i.d. constructions and the α∈(0,2) regime as open problems in Sect. 7, the abstract and introduction still speak of “the reliability function” without always qualifying the ensemble. A brief clarifying sentence in the statements of Thms. 9 and 12 (or immediately after) would prevent over-reading; the mathematics itself is not in doubt.
  2. [Theorem 5; Lemma 6] Theorem 5 supplies the key comparison Tr H A^{α-2} H ≤ c_α (Tr H B^{α-2} H + Tr|H|^α). The constant c_α is absorbed into the exponential rate, so the asymptotic statements are unaffected. Nevertheless, an explicit (even crude) bound on c_α, or a remark that it arises only from the finitely many Young/BKS constants determined by ⌊(α-2)/2⌋, would make the one-shot inequalities (Props. 11 and 13) fully quantitative and easier to reuse.
minor comments (4)
  1. [Sect. 3] Notation oscillates between D^{(α)}_2 and “mixed-order (2,α) sandwiched Rényi relative entropy” (Sect. 3 title). A single consistent name after the definition would help.
  2. [Eq. (5); §5.2] In Eq. (5) the support condition is stated, but later applications (e.g., after (84)) simply restrict to supp ρ_E. A one-line reminder that all operators act on that support would remove any ambiguity.
  3. [Throughout] Typographical inconsistencies: “R´enyi” vs. “Rényi”, occasional missing spaces around ∥, and “order-two” sometimes hyphenated, sometimes not.
  4. [References] Reference [16] is listed as 2026; if it is still a preprint, the arXiv identifier should be given for reproducibility.

Circularity Check

0 steps flagged

No significant circularity: operational exponents are derived from independent one-shot bounds, not forced by the definition of the new divergence.

full rationale

The mixed-order divergence D^{(α)}_2 is introduced from a negative-power Lieb trace functional (Eq. 5) with properties (additivity, comparison to sandwiched D_α) proved via Hölder, ALT, and spectral arguments before any operational task appears. Soft-covering and privacy-amplification reliability functions are defined independently as liminf exponential rates of sandwiched Rényi discrepancy for i.i.d. random codes / random binning (Eqs. 78, 117). Theorems 9 and 12 then equate those rates to min expressions in sandwiched and mixed-order information quantities by matching one-shot upper and lower bounds (Props. 11, 13; Thm. 14) that rely on Rosenthal, complex interpolation, BKS, and a novel operator estimate (Thm. 5), followed by additivity and n→∞. The operational meaning is a consequence of these bounds, not an input to the definition; there are no fitted parameters, no self-citation uniqueness theorems that force the formula, and no renaming of a prior exact exponent. Ensemble/order restrictions flagged in Sect. 7 are scope limits, not circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 6 axioms · 2 invented entities

The central equalities rest on standard finite-dimensional quantum information assumptions, known operator inequalities (Lieb convexity, Araki–Lieb–Thirring, Clarkson–McCarthy, Birman–Koplienko–Solomyak, noncommutative Rosenthal), and the modeling choice that performance is measured by expected sandwiched Rényi divergence for i.i.d. random codes / random binning at α≥2. No numerical free parameters are fitted. The mixed-order divergence is an invented quantity but is given an independent analytic definition and later operational meaning inside the paper.

axioms (6)
  • domain assumption Finite-dimensional Hilbert spaces; states and channels are on finite-dimensional systems; log base 2.
    Used throughout Preliminaries and all proofs; standard in one-shot/asymptotic CQ information theory.
  • standard math Joint convexity of the negative-power Lieb trace functional Ψ_{-p,-1+p,1} implies data-processing for D^{(α)}_2 (α>1).
    Invoked via Lieb (1973) and Lindblad-type DPI arguments in the introduction and Sect. 3.
  • standard math Noncommutative Rosenthal inequality for independent centered self-adjoint matrix random variables in noncommutative L_p.
    Lemma 4 cites Junge–Xu; used for moment bounds on codebook fluctuations.
  • standard math Araki–Lieb–Thirring, Clarkson–McCarthy, Birman–Koplienko–Solomyak, and complex interpolation for Schatten norms hold as stated.
    Applied in Props. 2, 7, Thm. 5, Lem. 8, and appendix lemmas.
  • domain assumption Reliability is defined via liminf of normalized log of expected sandwiched Q_α for i.i.d. random codebooks (soft covering) or random binning (privacy amplification).
    Definitions (78) and (117); excludes deterministic or structured codes and other security metrics.
  • domain assumption Support condition supp ρ ⊆ supp σ (else divergence +∞); all operators restricted to supp ρ_E so ρ_E is full rank on the working space.
    Stated with the definition of D^{(α)}_2 and in Sect. 5.2 notation.
invented entities (2)
  • Mixed-order order-two Rényi divergence D^{(α)}_2(ρ∥σ) = log Tr(ρ σ^{(1-α)/α} ρ σ^{-1/α}) independent evidence
    purpose: Generate mixed-order mutual information and conditional entropy that appear in the exact reliability-function formulas.
    Defined in Eq. (5) from a negative-power Lieb functional; compared to sandwiched D_α and D_2; not identical to standard Rényi families.
  • Mixed-order order-two Rényi mutual information I^{(α)}_2(X:E) and conditional entropy H^{(α)}_2(X|E) independent evidence
    purpose: Single-letter quantities that, together with sandwiched I_α / H_α, characterize the exponents.
    Defined in Eqs. (6)–(7) directly from D^{(α)}_2; operationalized by Theorems 9 and 12.

reviewed 2026-07-30 · how reviews work

0 comments
Cite this review

Pith. "Pith review of Reliability Functions of Quantum Soft Covering and Privacy Amplification via a Mixed-Order R\'enyi Divergence." pith.science (2026). https://pith.science/paper/2YVEJBRT

@misc{pith2026260727015,
  author       = {Pith},
  title        = {Pith review of: Reliability Functions of Quantum Soft Covering and Privacy Amplification via a Mixed-Order R\'enyi Divergence},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2YVEJBRT}},
  note         = {Machine review of arXiv:2607.27015}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

In this paper, we introduce a novel mixed-order R\'enyi divergence and investigate its fundamental properties. Using this divergence, we define a family of mixed-order order-two R\'enyi mutual information and R\'enyi conditional entropy. We derive exact reliability functions of quantum soft covering and privacy amplification under the sandwiched R\'enyi divergence with order $\alpha\in[2,\infty)$. The former is jointly characterized by the sandwiched and mixed-order order-two R\'enyi mutual information quantities, while the latter is characterized by the corresponding conditional entropies. These results provide operational interpretations of the proposed mixed-order R\'enyi divergence. To the best of our knowledge, this is the first exact characterization of the reliability function for quantum soft covering.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

51 extracted references · 1 linked inside Pith

  1. [1]

    Advances in Mathematics11(3), 267–288 (1973)

    Lieb, E.H.: Convex trace functions and the Wigner-Yanase-Dyson conjecture. Advances in Mathematics11(3), 267–288 (1973)

    1973

  2. [2]

    Linear algebra and its applications26, 203–241 (1979)

    Ando, T.: Concavity of certain maps on positive definite matrices and applications to hadamard products. Linear algebra and its applications26, 203–241 (1979)

    1979

  3. [3]

    Reports on mathematical physics23(1), 57–65 (1986)

    Petz, D.: Quasi-entropies for finite quantum systems. Reports on mathematical physics23(1), 57–65 (1986)

    1986

  4. [4]

    Reviews in Mathematical Physics22(9), 1099–1121 (2010)

    Jenˇ cov´ a, A., Ruskai, M.B.: A unified treatment of convexity of relative entropy and related trace functions, with conditions for equality. Reviews in Mathematical Physics22(9), 1099–1121 (2010)

    2010

  5. [5]

    Linear algebra and its applications439(5), 1568–1589 (2013)

    Hiai, F.: Concavity of certain matrix trace and norm functions. Linear algebra and its applications439(5), 1568–1589 (2013)

    2013

  6. [6]

    Linear algebra and its applications490, 174–185 (2016)

    Carlen, E.A., Frank, R.L., Lieb, E.H.: Some operator and trace function convexity theorems. Linear algebra and its applications490, 174–185 (2016)

    2016

  7. [7]

    Advances in Mathematics365, 107053 (2020)

    Zhang, H.: From wigner-yanase-dyson conjecture to carlen-frank-lieb conjecture. Advances in Mathematics365, 107053 (2020)

    2020

  8. [8]

    Epstein, H.: Remarks on two theorems of e. lieb. Communications in Mathematical Physics31(4), 317–325 (1973)

    1973

  9. [9]

    Journal of Mathematical Physics54(12) (2013)

    Frank, R.L., Lieb, E.H.: Monotonicity of a relative R´ enyi entropy. Journal of Mathematical Physics54(12) (2013)

    2013

  10. [10]

    Beigi, S.: Sandwiched R´ enyi divergence satisfies data processing inequality. J. Math. Phys.54, 122202 (2013)

    2013

  11. [11]

    Journal of Mathematical Physics56(2) (2015)

    Audenaert, K.M., Datta, N.: α-z R´ enyi relative entropies. Journal of Mathematical Physics56(2) (2015)

    2015

  12. [12]

    Journal of Mathematical Physics54(12) (2013)

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

    2013

  13. [13]

    Communications in Mathematical Physics331(2), 593–622 (2014)

    Wilde, M.M., Winter, A., Yang, D.: Strong converse for the classical capacity of entanglement-breaking and hadamard channels via a sandwiched R´ enyi relative 30 entropy. Communications in Mathematical Physics331(2), 593–622 (2014)

    2014

  14. [14]

    SpringerBriefs in Mathematical Physics, vol

    Tomamichel, M.: Quantum Information Processing with Finite Resources: Math- ematical Foundations. SpringerBriefs in Mathematical Physics, vol. 5. Springer, Cham (2016)

    2016

  15. [15]

    arXiv preprint arXiv:2410.21976 (2024) arXiv:2410.21976 [quant-ph]

    Rubboli, R., Goodarzi, M.M., Tomamichel, M.: Quantum conditional entropies from convex trace functionals. arXiv preprint arXiv:2410.21976 (2024) arXiv:2410.21976 [quant-ph]

    Pith/arXiv arXiv 2024

  16. [16]

    Rubboli, R., Tomamichel, M.: The Strong Converse Exponent of Composable Randomness Extraction Against Quantum Side Information (2026)

    2026

  17. [17]

    Communications in Mathematical Physics39(2), 111–119 (1974)

    Lindblad, G.: Expectations and entropy inequalities for finite quantum systems. Communications in Mathematical Physics39(2), 111–119 (1974)

    1974

  18. [18]

    Communications in Mathematical Physics40(2), 147–151 (1975)

    Lindblad, G.: Completely positive maps and entropy inequalities. Communications in Mathematical Physics40(2), 147–151 (1975)

    1975

  19. [19]

    IEEE Transactions on Information Theory48(3), 569–579 (2002)

    Ahlswede, R., Winter, A.: Strong converse for identification via quantum channels. IEEE Transactions on Information Theory48(3), 569–579 (2002)

    2002

  20. [20]

    IEEE Transactions on Information Theory60(5), 2926–2959 (2014)

    Bennett, C.H., Devetak, I., Harrow, A.W., Shor, P.W., Winter, A.: The quantum reverse shannon theorem and resource tradeoffs for simulating quantum channels. IEEE Transactions on Information Theory60(5), 2926–2959 (2014)

    2014

  21. [21]

    IEEE Transactions on Information Theory51(1), 44–55 (2005)

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

    2005

  22. [22]

    Physical Review A68(4), 042301 (2003)

    Devetak, I., Winter, A.: Classical data compression with quantum side information. Physical Review A68(4), 042301 (2003)

    2003

  23. [23]

    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences461(2053), 207–235 (2005)

    Devetak, I., Winter, A.: Distillation of secret key and entanglement from quantum states. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences461(2053), 207–235 (2005)

    2053

  24. [24]

    In: Proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, pp

    Winter, A.: Secret, public and quantum correlation cost of triples of random vari- ables. In: Proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, pp. 2270–2274 (2005)

    2005

  25. [25]

    Problems of Information Transmission40(4), 318–336 (2004)

    Cai, N., Winter, A., Yeung, R.W.: Quantum privacy and quantum wiretap channels. Problems of Information Transmission40(4), 318–336 (2004)

    2004

  26. [26]

    IEEE Transactions on Information Theory70(5), 3499–3511 (2024)

    Cheng, H.-C., Gao, L.: Error exponent and strong converse for quantum soft covering. IEEE Transactions on Information Theory70(5), 3499–3511 (2024)

    2024

  27. [27]

    IEEE Transactions on Information Theory 31 70(7), 5077–5091 (2024)

    Shen, Y.-C., Gao, L., Cheng, H.-C.: Optimal second-order rates for quantum soft covering and privacy amplification. IEEE Transactions on Information Theory 31 70(7), 5077–5091 (2024)

    2024

  28. [28]

    Reviews of Modern Physics94(2), 025008 (2022)

    Portmann, C., Renner, R.: Security in quantum cryptography. Reviews of Modern Physics94(2), 025008 (2022)

    2022

  29. [29]

    In: Theory of Cryptography

    Renner, R., K¨ onig, R.: Universally composable privacy amplification against quantum adversaries. In: Theory of Cryptography. Lecture Notes in Computer Science, vol. 3378, pp. 407–425. Springer, Berlin (2005)

    2005

  30. [30]

    PhD thesis, ETH Z¨ urich (2005)

    Renner, R.: Security of quantum key distribution. PhD thesis, ETH Z¨ urich (2005)

    2005

  31. [31]

    Communications in Mathematical Physics333(1), 335–350 (2015)

    Hayashi, M.: Precise evaluation of leaked information with secure randomness extraction in the presence of quantum attacker. Communications in Mathematical Physics333(1), 335–350 (2015)

    2015

  32. [32]

    IEEE Trans

    Li, K., Yao, Y., Hayashi, M.: Tight exponential analysis for smoothing the max- relative entropy and for quantum privacy amplification. IEEE Trans. Inf. Theory 69(3), 1680–1694 (2023)

    2023

  33. [33]

    Communications in Mathematical Physics405(2), 22 (2024)

    Li, K., Yao, Y.: Operational interpretation of the sandwiched r´ enyi divergence of order 1/2 to 1 as strong converse exponents. Communications in Mathematical Physics405(2), 22 (2024)

    2024

  34. [34]

    M¨ uller-Lennert, M., Dupuis, F., Szehr, O., Fehr, S., Tomamichel, M.: On quantum R´ enyi entropies: a new generalization and some properties. J. Math. Phys.54, 122203 (2013)

    2013

  35. [35]

    Wilde, M.M., Winter, A., Yang, D.: Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched R´ enyi relative entropy. Commun. Math. Phys.331(2), 593–622 (2014)

    2014

  36. [36]

    Tohoku Math

    Umegaki, H.: Conditional expectation in an operator algebra. Tohoku Math. J. 6(2), 177–181 (1954)

    1954

  37. [37]

    Tomamichel, M., Berta, M., Hayashi, M.: Relating different quantum gen- eralizations of the conditional R´ enyi entropy. J. Math. Phys.55, 082206 (2014)

    2014

  38. [38]

    Journal of Mathematical Physics51(12), 122201 (2010)

    Temme, K., Kastoryano, M.J., Ruskai, M.B., Wolf, M.M., Verstraete, F.: The χ2-divergence and mixing times of quantum markov processes. Journal of Mathematical Physics51(12), 122201 (2010)

    2010

  39. [39]

    Journal of Functional Analysis273(5), 1810–1869 (2017)

    Carlen, E.A., Maas, J.: Gradient flow and entropy inequalities for quantum markov semigroups with detailed balance. Journal of Functional Analysis273(5), 1810–1869 (2017)

    2017

  40. [40]

    Letters in Mathematical Physics 19, 167–170 (1990) 32

    Araki, H.: On an inequality of Lieb and Thirring. Letters in Mathematical Physics 19, 167–170 (1990) 32

    1990

  41. [41]

    Israel Journal of Mathematics167, 227–282 (2008)

    Junge, M., Xu, Q.: Noncommutative Burkholder/Rosenthal inequalities II: Applications. Israel Journal of Mathematics167, 227–282 (2008)

    2008

  42. [42]

    In: Handbook of the Geometry of Banach Spaces vol

    Pisier, G., Xu, Q.: Noncommutative lp-spaces. In: Handbook of the Geometry of Banach Spaces vol. 2, pp. 1459–1517. North-Holland, Amsterdam (2003)

    2003

  43. [43]

    Unpublished manuscript (2007)

    Xu, Q.: Noncommutative Lp-spaces and martingale inequalities. Unpublished manuscript (2007)

    2007

  44. [44]

    Izvestiya Vysshikh Uchebnykh Zavedenii

    Birman, M.S., Koplienko, L.S., Solomjak, M.Z.: Estimates of the spectrum of a dif- ference of fractional powers of selfadjoint operators. Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika (3), 3–10 (1975). Issue 154

    1975

  45. [45]

    Journal of Soviet Mathe- matics61(2), 2018–2035 (1992)

    Birman, M.S., Solomyak, M.Z.: Estimates for the difference of fractional powers of selfadjoint operators under unbounded perturbations. Journal of Soviet Mathe- matics61(2), 2018–2035 (1992). Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta imeni V. A. Steklova, vol. 178 (1989), pp. 120–145

    2018

  46. [46]

    In: Sims, R., Ueltschi, D

    Carlen, E.A.: Trace inequalities and quantum entropy: An introductory course. In: Sims, R., Ueltschi, D. (eds.) Entropy and the Quantum. Contemporary Math- ematics, vol. 529, pp. 73–140. American Mathematical Society, Providence, RI (2010)

    2010

  47. [47]

    IEEE Trans

    Yu, L., Tan, V.Y.: R´ enyi resolvability and its applications to the wiretap channel. IEEE Trans. Inf. Theory65(3), 1862–1897 (2018)

    2018

  48. [48]

    IEEE Transactions on Information Theory71(8), 6061–6074 (2025)

    Hayashi, M., Cheng, H.-C., Gao, L.: Resolvability of classical-quantum channels. IEEE Transactions on Information Theory71(8), 6061–6074 (2025)

    2025

  49. [49]

    Grundlehren der Mathematischen Wissenschaften, vol

    Bergh, J., L¨ ofstr¨ om, J.: Interpolation Spaces: An Introduction. Grundlehren der Mathematischen Wissenschaften, vol. 223. Springer, Berlin, Heidelberg (1976)

    1976

  50. [50]

    Journal of Functional Analysis56(1), 29–78 (1984)

    Kosaki, H.: Applications of the complex interpolation method to a von neumann algebra: Non-commutative Lp-spaces. Journal of Functional Analysis56(1), 29–78 (1984)

    1984

  51. [51]

    Pacific Journal of Mathematics202(2), 363–369 (2002) 33

    Hirzallah, O., Kittaneh, F.: Non-commutative clarkson inequalities for unitarily invariant norms. Pacific Journal of Mathematics202(2), 363–369 (2002) 33

    2002

This paper was first reviewed by grok-4.5 on July 30, 2026.