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.
A quantum channel can transmit quantum states, classical messages, or classical messages that remain secret from its environment. We prove exponential strong converses for all three tasks over arbitrary finite-dimensional memoryless quantum channels, at their respective regularized capacities and allowing arbitrary entangled inputs across channel uses and joint decoding. Above quantum or classical capacity, entanglement fidelity or decoding success probability, respectively, decays exponentially with the number of channel uses. Above private capacity, fidelity to an ideal shared secret key decays exponentially; in particular, vanishing secrecy error forces decoding success to vanish. The proofs combine one-shot quantum blowing-up lemmas, which convert codes with low success into reliable codes with a controlled loss in code size, with a low-degree polynomial approximation of the channel's Stinespring image projector. The loss is governed by the projective tensor norm of the approximation across the receiver--environment bipartition. For memoryless channels, the polynomial construction gives exponential accuracy while keeping the rate loss arbitrarily small, turning the corresponding weak converses into strong converses.
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.
How much classical information can a noisy optical channel carry when both signal energy and preshared entanglement are limited? This work gives an exact capacity frontier for this joint resource problem. It allows one to determine the best asymptotic communication rate, price the benefit of additional entanglement, and distinguish the effect of tolerating errors from that of changing how entanglement is supplied. Exact capacity under two resource constraints The setting is any fixed bosonic Gaussian channel
Φ with finitely many input and output modes. Signal energy is measured by a positive quadratic Hamiltonian
HG=21RTGR, with
G>0 and ground energy
E0;
R collects the canonical quadratures. The budgets satisfy
E≥E0 and
P≥0. For an
n-use code, the mean total signal energy is at most
nE, while the same initially shared maximally entangled state has Schmidt rank
Kn satisfying
logKn≤nP. Thus
P is a strictly supplied entanglement rate. Encoders may be arbitrary joint quantum operations, and decoding may be collective. The classical capacity is
C(E,P)=maxU≥Vphysical21Tr(GU)≤E,SG(V)≤P[SG(ΦU)+SG(V)−SG(ΦcV)]. Here
V is a Gaussian seed covariance,
U is the average-input covariance, and
U−V is the displacement-modulation covariance. A covariance is physical when
V+iΩ/2≥0, where
Ω is the canonical commutation matrix and the vacuum covariance is
I/2. The notation
SG denotes Gaussian von Neumann entropy, and
Φc is the full complementary channel, including any environment purification. All logarithms are natural, so rates are in nats per channel use. This formula replaces optimization over arbitrary quantum block codes by a finite-dimensional covariance optimization. It supplies both an achievable rate and a converse against non-Gaussian, correlated encodings. At
P=0, it also determines the unassisted capacity of general fixed finite-mode Gaussian channels, including channels without a passive decomposition into independent modes. The reduction specifies the exact capacity value; it does not require a closed-form optimizer for every device. Energy and strict entanglement supply respond differently to errors For a fixed allowed average error
0≤ε<1, the exact capacity under the mean-energy constraint is
Cε(E,P)=C(E0+1−εE−E0,P). Allowing failure rescales the mean energy above the ground state, but leaves the strict initial entanglement budget unchanged. The proof uses an exponential strong converse for codes whose inputs obey a hard total-energy cutoff. In a different model, where a readable flag permits random entanglement supply constrained only on average, the work establishes an achievable bound and a strict small-supply advantage for thermal attenuation at positive energy and fixed nonzero error. That comparison identifies the operational importance of the supply rule; it is not a complete capacity characterization of the flagged model. The communication value of entanglement For a thermal attenuator, let
0<η<1 be the transmissivity,
b>0 the output mean photon number for vacuum input, and
N the input mean photon number. Write its capacity as
CN(P), and define
g(N)=(N+1)log(N+1)−NlogN. The gain from entanglement obeys the sharp bound
0≤CN(P)−CN(0)≤1+bηP. For every fixed
N>0, the coefficient
η/(1+b) is attained as the initial right derivative at
P=0. In the low-photon limit, the stronger resource law is
CN(P)−CN(0)=1+bηmin{P,g(N)}+O(N),N↓0. The remainder is uniform over
P≥0 at fixed
η and positive
b. Noise therefore determines the conversion efficiency, while
g(N)∼Nlog(1/N) sets the entanglement scale sufficient for saturation. This uniform limit concerns the entanglement budget, not a simultaneous limit of vanishing thermal noise. Multimode resource allocation and scope A coupled two-mode example demonstrates how the frontier can guide resource allocation. A global resource-price certificate proves that a legal covariance pair exceeds the entire common-passive-frame Gaussian profile hull by at least
10−5 nat per two-mode use at specified budgets. The comparison includes all common passive frames, local squeezing and average-resource mixtures. The mechanism is the freedom to choose different mode allocations for the seed and average input; the benchmark is this precisely defined Gaussian class, rather than all unentangled encodings. The universal scope is the stated family of fixed finite-mode Gaussian channels, positive quadratic signal costs and strict initial maximally entangled Schmidt-rank supply, with unrestricted joint encoding and collective decoding. The model has no feedback or credit for returned entanglement. The capacity frontier and its resource consequences provide a common way to assess optical communication designs under these operational constraints.
The understanding of achievable rates for quantum identification is far behind that of quantum transmission, as well as classical identification and transmission. Notably, in the classical case, common randomness shared between Alice and Bob before communication begins can greatly enhance the identification capacity. In the quantum regime, pre-shared entanglement may have an even more profound impact on the quantum identification (ID) capacity. This paper presents a regularized expression for the quantum ID capacity with entanglement assistance and demonstrates how it grows with the entanglement rate. Additionally, we provide deeper insights into the nature of quantum ID capacity. Interestingly, while the classical ID capacity becomes unbounded with unlimited common randomness, we find that the quantum ID capacity remains bounded even with unlimited entanglement assistance. Additionally, we find that entanglement plays the same role as an additional noiseless channel that is amortized, i.e., only used to make the rate positive.
The quantum capacity of a noisy channel quantifies the maximum rate at which quantum information can be transmitted reliably. For general channels, its evaluation requires an optimization over arbitrarily many channel uses. Degradable channels form a central exception: their capacity is given by the single-letter coherent information, while antidegradable channels have zero capacity. Nevertheless, even for these fundamental classes, it has remained open whether communication above capacity becomes possible when a fixed non-maximal error is tolerated. Here we resolve this problem by proving an exponential strong converse for every finite-dimensional degradable and antidegradable channel: at any rate above capacity, the fidelity of every coding scheme decays exponentially with the number of channel uses. As an immediate consequence, we establish the first all-code exponential strong converse for the quantum erasure channel throughout its full parameter range, strengthening previous results that applied only to almost all codes. We also show that exponential strong-converse bounds are preserved under receiver post-processing. This yields efficiently computable semidefinite-programming bounds for arbitrary finite-dimensional channels, improved bounds for Pauli channels, and an exact exponential strong converse for a nondegradable multilevel amplitude-damping family.