A missing piece in quantum information theory, with very few exceptions, has been to provide the random coding exponents for quantum information-processing protocols. We remedy the situation by providing these exponents for a variety of protocols including those at the top of the family tree of protocols. Our line of attack is to provide an exponential bound on the decoupling error for a restricted class of completely positive maps where a key term in the exponent is in terms of a Rényi α-information-theoretic quantity for any α$\in$ (1,2]. Among the protocols covered are fully quantum Slepian-Wolf, quantum state merging, quantum state redistribution, quantum/classical communication across channels with side information at the transmitter with or without entanglement assistance, and quantum communication across broadcast channels.
A missing piece in quantum information theory, with very few exceptions, has been to provide the random coding exponents for quantum information-processing protocols. We remedy the situation by providing these exponents for a variety of protocols including those at the top of the family tree of protocols. Our line of attack is to provide an exponential bound on the decoupling error for a restricted class of completely positive maps where a key term in the exponent is in terms of a Rényi α-information-theoretic quantity for any α∈ (1,2]. Among the protocols covered are fully quantum Slepian-Wolf, quantum state merging, quantum state redistribution, quantum/classical communication across channels with side information at the transmitter with or without entanglement assistance, and quantum communication across broadcast channels.
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.
Quantum information decoupling is an important quantum information processing task, which has found broad applications. In this paper, we characterize the performance of catalytic quantum information decoupling regarding the exponential rate under which perfect decoupling is approached, namely, the reliability function. We have obtained the exact formula when the decoupling cost is not larger than a critical value. In the situation of high cost, we provide upper and lower bounds. This result is then applied to quantum state merging and correlation erasure, exploiting their connection to decoupling. As technical tools, we derive the exponents for smoothing the conditional min-entropy and max-information, and we prove a novel bound for the convex-split lemma.
Our results are given in terms of the sandwiched Renyi divergence, providing it with operational meanings in characterizing how fast the performance of quantum information tasks approach the perfect.
Quantum information theory studies the fundamental limits that physical laws impose on information processing tasks such as data compression and data transmission on noisy channels. This thesis presents general techniques that allow one to solve many fundamental problems of quantum information theory in a unified framework. The central theorem of this thesis proves the existence of a protocol that transmits quantum data that is partially known to the receiver through a single use of an arbitrary noisy quantum channel. In addition to the intrinsic interest of this problem, this theorem has as immediate corollaries several central theorems of quantum information theory. The following chapters use this theorem to prove the existence of new protocols for two other types of quantum channels, namely quantum broadcast channels and quantum channels with side information at the transmitter. These protocols also involve sending quantum information partially known by the receiver with a single use of the channel, and have as corollaries entanglement-assisted and unassisted asymptotic coding theorems. The entanglement-assisted asymptotic versions can, in both cases, be considered as quantum versions of the best coding theorems known for the classical versions of these problems. The last chapter deals with a purely quantum phenomenon called locking. We demonstrate that it is possible to encode a classical message into a quantum state such that, by removing a subsystem of logarithmic size with respect to its total size, no measurement can have significant correlations with the message. The message is therefore "locked" by a logarithmic-size key. This thesis presents the first locking protocol for which the success criterion is that the trace distance between the joint distribution of the message and the measurement result and the product of their marginals be sufficiently small.
We present the unification of many previously disparate results in noisy quantum Shannon theory and the unification of all of noiseless quantum Shannon theory. More specifically we deal here with bipartite, unidirectional, and memoryless quantum Shannon theory. We find all the optimal protocols and quantify the relationship between the resources used, both for the one-shot and for the ensemble case, for what is arguably the most fundamental task in quantum information theory: sharing entangled states between a sender and a receiver. We find that all of these protocols are derived from our one-shot superdense coding protocol and relate nicely to each other. We then move on to noisy quantum information theory and give a simple, direct proof of the "mother" protocol, or rather her generalization to the Fully Quantum Slepian-Wolf protocol(FQSW). FQSW simultaneously accomplishes two goals: quantum communication-assisted entanglement distillation, and state transfer from the sender to the receiver. As a result, in addition to her other "children," the mother protocol generates the state merging primitive of Horodecki, Oppenheim, and Winter as well as a new class of distributed compression protocols for correlated quantum sources, which are optimal for sources described by separable density operators. Moreover, the mother protocol described here is easily transformed into the so-called "father" protocol, demonstrating that the division of single-sender/single-receiver protocols into two families was unnecessary: all protocols in the family are children of the mother.
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.