The paper proposes a quantum soft-covering problem, which involves finding the minimum rank of an input state needed to approximate a given quantum channel output. The authors prove a one-shot quantum soft-covering lemma using decoupling techniques from quantum Shannon theory.
The one-shot soft-covering result is shown to be equivalent to a coding theorem for rate-distortion under a posterior (reverse) channel distortion criterion. The authors then use the soft-covering lemma to formulate and study the quantum channel resolvability problem, providing one-shot and asymptotic bounds.
Finally, the authors apply the quantum soft-covering lemma to the problem of identification via quantum channels. They provide new upper bounds on the unrestricted and simultaneous identification capacities of quantum channels, separating the two capacities for the first time and resolving a long-standing conjecture.
The paper provides a comprehensive treatment of the quantum soft-covering problem and demonstrates its power through various applications in quantum information theory.
Para outro idioma
do conteúdo fonte
arxiv.org
Principais Insights Extraídos De
by Touheed Anwa... às arxiv.org 04-29-2024
https://arxiv.org/pdf/2306.12416.pdfPerguntas Mais Profundas