arXiv:2610.05669
Universal Improvement of Channel Fidelity via Entanglement Assistance
Xinan Chen, Eric Chitambar
Abstract
Communication using quantum channels generally requires encoding and decoding on many identical uses of a quantum channel. In practical settings, decoherence may severely limit our ability to do so, potentially rendering each channel use nonidentical. Given $n$ nonidentical channels, we present an entanglement-assisted encoding and decoding strategy that yields a channel with higher worst-case fidelity than all of the $n$ given channels. The strategy is universal, in the sense that the improvement holds regardless of what channels are given, as long as they satisfy mild assumptions on their initial entanglement fidelities. Our protocol is optimal when the given channels are depolarizing channels, and is essentially the unique one that is universal. This idea can also be extended to classical channels, where shared randomness between the sender and the receiver allows universal enhancement of the probability of correct transmission. We then consider general quantum resource theories, providing a necessary condition and a sufficient condition for the possibility of such universal improvement of quantum resources.
AI Summary
The paper asks whether a fixed protocol can combine unknown, nonidentical quantum channels into one whose worst-case fidelity exceeds that of every input channel, without additional communication. It considers probabilistic encoding and decoding with preshared entanglement, assuming independent channel uses represented by a tensor product. For $n\geq2$ channels of dimension $d$, with entanglement fidelities $f_i\in(1/d^2,1)$, the protocol produces a heralded output channel with worst-case fidelity $F_{\mathrm{out}}=\prod_i f_i/P$, where $P=\prod_i f_i+(d^2-1)^{1-n}\prod_i(1-f_i)$ is its input-state-independent success probability. This exceeds every $f_i$, hence every input’s worst-case fidelity. The construction first twirls each channel to a depolarizing channel, then combines teleportation, superdense coding of the teleportation outcome, and error detection accepting only matching decoded outcomes. Two qubit channels with $f_1=0.9$ and $f_2=0.8$ yield fidelity approximately $0.991$ with probability $0.727$. Projective-robustness bounds establish optimal output fidelity for depolarizing inputs even under no-signaling assistance; success-probability optimality and uniqueness up to twirling and rescaling are established for two inputs. A shared-randomness classical analogue replaces $d^2$ by $d$. General resource-theoretic results give sufficient and near-necessary conditions involving free twirling, multiplicativity of projective robustness, and standard versus generalized robustness. The guarantees concern conditional fidelity, not deterministic transmission or communication rate, and consume preshared entanglement. General resource-theory applicability requires checking the stated structural conditions; physical entanglement-assisted implementability is explicitly constructed for communication.
Error found: The introduction's strict-improvement domain includes perfect channels and does not explicitly require at least two channels, although strict improvement is impossible in either boundary case. The stated large-d corrections have the wrong exponent: the displayed protocol formulas give Θ(d^{−2(n−1)}) for fixed nontrivial input fidelities, rather than O(d^{−2n}). The generic-resource sufficient theorem allows mixed targets, but its overlap calculation assumes a pure target, and permitted mixed-target examples invalidate its resource-non-generating conclusion. The generic-resource strict-improvement theorem fails to exclude inputs already equal to a pure target, for which its promised improvement would exceed overlap 1.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- comments welcome