In this paper, we consider the standard quantum information decoupling, in which Alice aims to decouple her system from the environment by discarding some of her systems. To achieve an ε-decoupling with trace distance as the error criterion, we establish a one-shot characterization for the largest size of the remainder system in terms of the conditional (1 − ε)-hypothesis-testing entropy. When the underlying system is independent and identically prepared, our result leads to the matched second-order rate as well as the moderate deviation rate.
In this paper, we consider the standard quantum information decoupling, in which Alice aims to decouple her system from the environment by discarding some of her systems. To achieve an ε-decoupling with trace distance as the error criterion, we establish a one-shot characterization for the largest size of the remainder system in terms of the conditional (1 − ε)-hypothesis-testing entropy. When the underlying system is independent and identically prepared, our result leads to the matched second-order rate as well as the moderate deviation rate.
Quantum information decoupling is a pillar of quantum information theory, underlying quantum communication, error correction, and information recovery. However, its existing formulations rely on random unitary operations tied to finite-dimensional assumptions on quantum systems. Here we establish a decoupling framework for arbitrary separable, possibly infinite-dimensional systems. For finite-dimensional inputs and arbitrary separable reference/output systems, we derive error bounds on one-shot decoupling for completely positive maps in terms of sandwiched Rényi conditional entropies. For partial-trace decoupling with finite-dimensional references, the error exponent is optimal up to the known critical rate. To handle infinite-dimensional inputs, we assume finite entropy of the manipulated system. We construct finite-rank projections on independent and identically distributed (IID) states to restrict randomization to a projected finite-dimensional subspace, while ensuring high success probability by including auxiliary components in the discarded subsystem at asymptotically negligible cost. This leads to an infinite-dimensional IID partial-trace decoupling protocol achieving optimal asymptotic dimension rates. As an application, we construct an infinite-dimensional quantum-state-merging protocol, a mother protocol of quantum information theory. Under finite entropy of Alice's marginal, it achieves the same quantum-communication and total-cost rates as in finite dimensions, governed by mutual information and conditional entropy. These results show that the operational interpretation of entropic quantities through these achievable rates constitutes a universal principle beyond finite dimensions. More broadly, our framework provides foundational tools for exploring quantum information regardless of whether we model the physical world using finite- or infinite-dimensional spaces.
Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy distance, with the decoupling error bounded by two sandwiched Rényi conditional entropies. In the asymptotic i.i.d. setting of standard information decoupling via partial trace, we show that this bound is ensemble-tight in quantum relative entropy distance and thereby yields a characterization of the associated decoupling error exponent in the low-cost-rate regime.
Leveraging this framework, we derive several operational applications formulated in terms of purified distance: (i) single-letter expressions for the exact error exponents of quantum state merging in the low-entanglement-cost and high-entanglement-distillation-rate regimes, in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for achievable error exponents of entanglement distillation and quantum channel coding in terms of Petz-Rényi coherent informations. We further prove that these achievable bounds are tight for maximally correlated states and generalized dephasing channels, respectively, for the high distillation-rate/coding-rate regimes.
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.
Quantum information decoupling is a fundamental tool in quantum information theory with broad applications in quantum physics. In this paper, we establish a one-shot upper bound on the decoupling error under the quantum relative entropy, expressed in terms of the sandwiched Rényi conditional entropy. This bound yields an achievability result for the corresponding error exponent in the i.i.d. setting. We further derive a one-shot lower bound on the decoupling error in terms of an information-spectrum quantity, which leads to a converse bound on the error exponent. We show that this converse matches the achievability bound whenever the decoupling rate lies below a critical threshold. As a consequence, we obtain an exact characterization of the decoupling error exponent in the low-rate regime.
If a quantum system A , which is initially correlated to another system, E , undergoes an evolution separated from E , then the correlation to E generally decreases. Here, we study the conditions under which the correlation disappears (almost) completely, resulting in a decoupling of A from E . We give a criterion for decoupling in terms of two smooth entropies, one quantifying the amount of initial correlation between A and E , and the other characterizing the mapping that describes the evolution of A . The criterion applies to arbitrary such mappings in the general one-shot setting. Furthermore, the criterion is tight for mappings that satisfy certain natural conditions. One-shot decoupling has a number of applications both in physics and information theory, e.g., as a building block for quantum information processing protocols. As an example, we give a one-shot state merging protocol and show that it is essentially optimal in terms of its entanglement consumption/production.
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.