How well can we approximate a classical-quantum channel output state by using a random codebook with a certain size? In this work, we study the quantum soft covering problem and establish exponential achievability and strong converse bounds on the expected trace distance between the codebook-induced state and the true state. When using independent and identically distributed random codebook or constant composition random codebook with a rate above the quantum mutual information I(X : B)ρ, we prove that the trace distances decay exponentially with error exponents expressed by the sandwiched Rényi and Augustin information. For a rate below I(X : B)ρ, we show that both the trace distances converge to 1 exponentially fast. The full manuscript can be found at [1].
How well can we approximate a classical-quantum channel output state by using a random codebook with a certain size? In this work, we study the quantum soft covering problem and establish exponential achievability and strong converse bounds on the expected trace distance between the codebook-induced state and the true state. When using independent and identically distributed random codebook or constant composition random codebook with a rate above the quantum mutual information I(X : B)ρ, we prove that the trace distances decay exponentially with error exponents expressed by the sandwiched Rényi and Augustin information. For a rate below I(X : B)ρ, we show that both the trace distances converge to 1 exponentially fast. The full manuscript can be found at [1].
We determine the exact strong converse exponent of quantum soft covering under the sandwiched R{é}nyi divergence for all orders α∈[21,∞). For α∈[21,1), the exponent is characterized by the two-parameter club-sandwiched mutual information, whereas for α∈[1,∞), it is characterized by the order-α sandwiched R{é}nyi mutual information. We also determine the exact strong converse exponent of privacy amplification against quantum side information under the sandwiched R{é}nyi divergence for α∈(2,∞), expressed in terms of the corresponding order-α sandwiched R{é}nyi conditional entropy. To the best of our knowledge, these results provide the first exact characterization of the strong converse exponent of quantum soft covering and the first precise operational interpretation of the two-parameter club-sandwiched mutual information in the quantum setting. The key ingredient is that we establish the exponential rate of the K-functional, which is instrumental in deriving the strong converse exponent of quantum soft covering for α∈[21,1).
How well can we approximate a quantum channel output state using a random codebook with a certain size? In this work, we study the quantum soft covering problem, which uses a pairwise-independent random codebook to approximate the target output state of a quantum channel. We establish a one-shot error exponent bound and a one-shot strong converse bound on the approximation error measured in terms of the expected trace distance between the codebook-induced state and the true channel output state. When using independent and identically-distributed random codebook with a rate above the quantum mutual informationI(X : B)ρ, we prove that the error decays exponentially with its error exponent expressed by the sandwiched Rényi information. On the other hand, when the rate of the codebook size is below the quantum mutual information, the error converges to one exponentially fast. Similar results are obtained using a random constant composition codebook, whereas the sandwiched Augustin information gives the error exponent. In addition to the above large deviation analysis, our results also hold in the moderate deviation regime.
We study quantum soft covering and privacy amplification against quantum side information. The former task aims to approximate a quantum state by sampling from a prior distribution and querying a quantum channel. The latter task aims to extract uniform and independent randomness against quantum adversaries. For both tasks, we use trace distance to measure the closeness between the processed state and the ideal target state. We show that the minimal amount of samples for achieving an ε-covering is given by the (1 − ε)-hypothesis testing information (with additional logarithmic additive terms), while the maximal extractable randomness for an ε-secret extractor is characterized by the conditional (1 − ε)-hypothesis testing entropy. When performing independent and identical repetitions of the tasks, our one-shot characterizations lead to tight asymptotic expansions of the above-mentioned operational quantities. We establish their second-order rates given by the quantum mutual information variance and the quantum conditional information variance, respectively. Moreover, our results extend to the moderate deviation regime, which are the optimal asymptotic rates when the trace distances vanish at sub-exponential speed. Our proof technique is direct analysis of trace distance without smoothing.
The Quantum Reverse Shannon Theorem has been a milestone in quantum information theory. It states that asymptotically reliable simulation of a quantum channel, assisted by unlimited shared entanglement, requires a rate of classical communication equal to the channel’s entanglement-assisted classical capacity. In this paper, we study the error exponent of quantum channel simulation, which characterizes the optimal speed of exponential convergence of the performance towards the perfect, as the blocklength increases. Based on channel purified distance, we derive lower and upper bounds for the error exponent. Then we show that the two bounds coincide when the classical communication rate is below a critical value, and hence, we have determined the exact formula of the error exponent in the low-rate case. This enables us to obtain an operational interpretation to the channel’s sandwiched Rényi information of order from 1 to 2, since our formula is expressed as a transform of this quantity. In the derivation, we have also obtained an achievability bound for quantum channel simulation in the finite-blocklength setting, which is of realistic significance.
In this work, we propose a soft covering problem for fully quantum channels using relative entropy as a criterion for operator closeness. We establish covering lemmas by deriving one-shot bounds on the achievable rates in terms of smooth min-entropies. In the asymptotic regime, we show that the infimum of the rate, defined as the logarithm of the minimum rank of the encoded input state, is given by the minimal coherent information between the reference and output systems that yields the target output state. Furthermore, we present a one-shot quantum decoupling theorem that also employs a relative-entropy criterion. Due to the Pinsker inequality, our one-shot results based on the relative-entropy criterion are tighter than the corresponding results based on the trace norm considered in the literature. In addition, we establish achievable error exponents and second-order rates for quantum soft covering under both trace-distance and relative-entropy criteria.
Abstract In their seminal work, Bennett et al. [1] showed that, with sufficient shared randomness, one noisy channel can simulate another at a rate equal to the ratio of their capacities. We establish that when coding above this channel interconversion capacity, the exact strong converse exponent is characterized by a simple optimization involving the difference of the corresponding Rényi channel capacities with Hölder dual parameters. We further extend this result to the entanglement-assisted interconversion of classical–quantum channels, showing that the strong converse exponent is likewise determined by differences of sandwiched Rényi channel capacities. The converse bound is obtained by relaxing to non-signaling assisted codes and applying Hölder duality together with the data processing inequality for Rényi divergences. Achievability is proven by concatenating refined channel coding and simulation protocols that go beyond first-order capacities, attaining an exponentially small conversion error, remaining robust under small variations in the input distribution, and tolerating a sublinear gap between the conversion rates.