REVIEW 4 cited by
Sharp estimates of quantum covering problems via a novel trace inequality
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Sharp estimates of quantum covering problems via a novel trace inequality
read the original abstract
In this paper, we prove a novel trace inequality involving two operators. As applications, we sharpen the one-shot achievability bound on the relative entropy error in a wealth of quantum covering-type problems, such as soft covering, privacy amplification, convex splitting, quantum information decoupling, and quantum channel simulation by removing some dimension-dependent factors. Moreover, the established one-shot bounds extend to infinite-dimensional separable Hilbert spaces as well. The proof techniques are based on the recently developed operator layer cake theorem and an operator change-of-variable argument, which are of independent interest.
Forward citations
Cited by 4 Pith papers
-
Optimal Trace Inequalities for Single-Shot Quantum Information
Optimal trace inequalities are derived for single-shot quantum information, replacing prior constants with a smaller Lambert-W prefactor for logarithmic traces and providing optimal two-sided collision-divergence bounds.
-
Quantum Noncommutativity Uniquely Determines Relative Entropy
Quantum noncommutativity uniquely selects the Umegaki relative entropy as the only additive measure compatible with single-shot optimal discrimination in binary guessing games.
-
Optimal Trace Inequalities for Single-Shot Quantum Information
The paper proves an optimal logarithmic trace inequality for positive operators using constant G_s from the scalar bound log(1+r) ≤ G_s r^s, lifted via iterative integration-by-parts, with optimality established for t...
-
Smoothing Exponents and Decoupling in Semifinite von Neumann Algebras
Smoothing exponents of max-relative entropy and catalytic decoupling reliability exponents retain their finite-dimensional sandwiched-Rényi formulae on semifinite von Neumann algebras.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.