相关论文: Strong converse exponents for the feedback-assiste…
A strong converse theorem for the classical capacity of a quantum channel states that the probability of correctly decoding a classical message converges exponentially fast to zero in the limit of many channel uses if the rate of…
We determine the exact strong converse exponent for entanglement-assisted classical communication of a quantum channel. Our main contribution is the derivation of an upper bound for the strong converse exponent which is characterized by the…
We find a strong-converse bound on the private capacity of a quantum channel assisted by unlimited two-way classical communication. The bound is based on the max-relative entropy of entanglement and its proof uses a new inequality for the…
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In…
A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of…
A unified approach to prove the converses for the quantum channel capacity theorems is presented. These converses include the strong converse theorems for classical or quantum information transfer with error exponents and novel explicit…
We consider the transmission of classical information through a degraded broadcast channel, whose outputs are two quantum systems, with the state of one being a degraded version of the other. Yard et al. proved that the capacity region of…
The fully quantum reverse Shannon theorem establishes the optimal rate of noiseless classical communication required for simulating the action of many instances of a noisy quantum channel on an arbitrary input state, while also allowing for…
A strong converse theorem for channel capacity establishes that the error probability in any communication scheme for a given channel necessarily tends to one if the rate of communication exceeds the channel's capacity. Establishing such a…
In their seminal work, Bennett et al. [IEEE Trans. Inf. Theory (2002)] 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…
We establish the classical capacity of optical quantum channels as a sharp transition between two regimes---one which is an error-free regime for communication rates below the capacity, and the other in which the probability of correctly…
The optimal rate of reliable communication over a quantum channel can be enhanced by pre-shared entanglement. Whereas the enhancement may be unbounded in infinite-dimensional settings even when the input power is constrained, a…
We prove that several known upper bounds on the classical capacity of thermal and additive noise bosonic channels are actually strong converse rates. Our results strengthen the interpretation of these upper bounds, in the sense that we now…
We investigate the classical communication over quantum channels when assisted by no-signaling (NS) and positive-partial-transpose-preserving (PPT) codes, for which both the optimal success probability of a given transmission rate and the…
We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical feedback channel is bounded from above by the maximum average output entropy of the quantum channel. As a consequence of this bound, we…
We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical…
The design of error-correcting codes used in modern communications relies on information theory to quantify the capacity of a noisy channel to send information [1]. This capacity can be expressed using the mutual information between input…
We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying…
We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation in worst case input purified distance. The error exponent is expressed as a single-letter formula optimized over…
We establish a strong converse bound for the private classical capacity of anti-degradable quantum channels. Specifically, we prove that this capacity is zero whenever the error $\epsilon > 0$ and privacy parameter $\delta > 0$ satisfy the…