arXiv:2610.00440
Finite-blocklength classical communication over the quantum erasure channel with and without classical feedback
Mark M. Wilde
Abstract
We determine the optimal success probability for transmitting a fixed number of classical messages through a finite number of uses of the quantum erasure channel, assisted by noiseless classical feedback and without initial shared entanglement. For an input dimension $d$, an erasure probability $p$, a blocklength $n$, and $M$ equiprobable messages, the optimal success probability is equal to $E[\min\{1,d^K/M\}]$, where $K$ is binomial with parameters $n$ and $1-p$. The converse allows arbitrary adaptive quantum encoders, quantum memories, and receiver instruments. Its main ingredient is an elementary dimension bound for noiseless quantum communication with classical feedback, proved by fixing the classical controls without conditioning the sender's state on the observed transcript. A classical protocol that transmits the base-$d$ digits of an integer representing the message, repeating each digit until the receiver acknowledges its reception or the prescribed blocklength is reached, attains the bound for every integer $M$. We also establish a relative-majorization property of erasure-channel outputs and exactly evaluate a hypothesis-testing converse, recovering the same numerical bound without feedback. That converse need not be achievable without feedback: four uses of the qubit erasure channel and four messages give a strict gap. A product-state code employing tetrahedral qubit states nevertheless outperforms every classical binary erasure code with these parameters. We give an explicit message-size formula and show that the bounded-remainder normal approximation and the average-success strong-converse exponent are unchanged without feedback. We also determine the feedback-assisted error exponent below capacity, prove that it agrees with the no-feedback exponent above a critical rate, and give no-feedback bounds at lower rates.
AI Summary
The paper asks how classical feedback affects finite-blocklength classical communication over a $d$-dimensional quantum erasure channel, without initial shared entanglement. For $n$ uses, erasure probability $p$, and $M$ equiprobable messages, it proves the exact feedback-assisted success probability $\mathbb E[\min\{1,d^K/M\}]$, where $K\sim\mathrm{Bin}(n,1-p)$. The converse permits adaptive quantum encoders, memories, and receiver instruments. It fixes feedback transcripts as encoder controls without postselection, obtains a noiseless dimension bound, and applies it separately to each erasure pattern. A classical repeat-until-received digit protocol attains the bound for every integer $M$. Maximum-error equality uses an initial message-independent feedback seed. Without feedback, a sectorwise relative-majorization construction exactly evaluates a hypothesis-testing converse, recovering an existing numerical bound rather than improving it. This bound is not always attainable: four messages over four qubit transmissions give a strict gap for every $0<p<1$. At $p=1/2$, the optimal classical no-feedback success is $51/64$, a tetrahedral product-state code achieves $(47+2\sqrt6)/64$, and the quantum no-feedback optimum is strictly below the feedback value $53/64$. The paper also derives an explicit message-size formula, identical normal approximations with $O(1)$ remainders with and without feedback, and a common average-success strong-converse exponent. Below capacity, the feedback error exponent is $D_{\rm bin}(R/\log_2d\|1-p)$; no-feedback coding matches it above a critical rate. The optimal four-message quantum no-feedback code and the low-rate no-feedback reliability function remain undetermined; only achievable constructions and bounds are supplied.
ChatGPT (OpenAI) Pro 6 (Astra) was used extensively in developing this manuscript, including for mathematical exploration, formulation and checking of proof arguments, drafting and revision, bibliographic checks, and preparation of LaTeX, TikZ, and numerical-checking code.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 46 pages, 11 figures