Основные понятия
The quantum soft-covering problem aims to find 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 and demonstrate its applications in rate-distortion coding, channel resolvability, and identification capacities of quantum channels.
Аннотация
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.
Статистика
The paper does not contain any explicit numerical data or statistics. It focuses on theoretical results and their applications.
Цитаты
"We propose a quantum soft-covering problem for a given general quantum channel and one of its output states, which consists in finding the minimum rank of an input state needed to approximate the given channel output."
"The power of our quantum covering lemma is demonstrated by two additional applications: first, we formulate a quantum channel resolvability problem, and provide one-shot as well as asymptotic upper and lower bounds. Secondly, we provide new upper bounds on the unrestricted and simultaneous identification capacities of quantum channels, in particular separating for the first time the simultaneous identification capacity from the unrestricted one, proving a long-standing conjecture of the last author."