Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.00440

Finite-blocklength classical communication over the quantum erasure channel with and without classical feedback

Mark M. Wilde

quant-phcs.ITSubmitted Sep 30, 2026• Announced Oct 1, 2026• 2 citations
arXivHTMLPDF

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.

Likely largely AI-generatedAI use disclosed
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

Related papers

Strong Converse for the Feedback-Assisted Classical Capacity of Entanglement-Breaking Channels

Dawei Ding, Mark M. Wilde

Quantum entanglement can be used in a communication scheme to establish a correlation between successive channel inputs that is impossible by classical means. It is known that the classical capacity of quantum channels can be enhanced by such entangled encoding schemes, but this is not always the case. In this paper, we prove that a strong converse theorem holds for the classical capacity of an entanglement-breaking channel even when it is assisted by a classical feedback link from the receiver to the transmitter. In doing so, we identify a bound on the strong converse exponent, which determines the exponentially decaying rate at which the success probability tends to zero, for a sequence of codes with communication rate exceeding capacity. Proving a strong converse, along with an achievability theorem, shows that the classical capacity is a sharp boundary between reliable and unreliable communication regimes. One of the main tools in our proof is the sandwiched Rényi relative entropy. The same method of proof is used to derive an exponential bound on the success probability when communicating over an arbitrary quantum channel assisted by classical feedback, provided that the transmitter does not use entangled encoding schemes.

arXiv:1506.02228•Problems of Information Transmission•Jan 1, 2018•19 citations

On Finite Blocklength Converse Bounds for Classical Communication Over Quantum Channels

Xin Wang, Kun Fang, Marco Tomamichel

We explore several new converse bounds for classical communication over quantum channels in the finite blocklength regime. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical communication can be achieved by activated, no-signalling assisted codes, suitably generalizing a result for classical channels. Second, we derive a new meta-converse on the amount of information unassisted codes can transmit over a single use of a quantum channel. We further show that this meta-converse can be evaluated via semidefinite programming. As an application, we provide a second-order analysis of classical communication over quantum erasure channels.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•0 citations

Quantum-State Oblivious Transfer over Quantum Erasure Channels

Remi A. Chou

We study quantum-state oblivious transfer over the quantum erasure channel under information-theoretic security guarantees. Specifically, Alice holds two quantum systems, Bob wishes to recover one of them, and the parties have access to independent channel uses and authenticated public classical communication, with no initial shared entanglement. We consider both honest-but-curious and malicious behavior. We establish finite-blocklength converse and achievability bounds, which match in the honest-but-curious setting. The malicious setting construction combines interactive hashing with tests of whether Bob received selected channel outputs, and distributes each input across several qubits so that erasures conceal an entire input from a dishonest receiver, even when the inputs are entangled with an external reference. We also derive fixed-error asymptotic expansions and show that both malicious and honest-but-curious settings have the same capacity.

quant-pharXiv:2610.04667•Oct 6, 2026•0 citations

Finite Blocklength Converse Bounds for Quantum Channels

William Matthews, Stephanie Wehner

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 framework of quantum hypothesis testing with restricted measurements. Our bounds do not depend on any special property of the channel (such as memorylessness) and generalize both a classical converse of Polyanskiy, Poor, and Verdú as well as a quantum converse of Renner and Wang, and have a number of desirable properties. In particular, our bound on entanglement-assisted codes is a semidefinite program and for memoryless channels, its large blocklength limit is the well-known formula for entanglement-assisted capacity due to Bennett, Shor, Smolin, and Thapliyal.

arXiv:1210.4722•IEEE Transactions on Information Theory•Sep 8, 2014•101 citations

Entanglement-of-formation potentials for feedback-assisted classical communication and randomness distillation

Mark M. Wilde

We develop entanglement-of-formation potentials for feedback-assisted classical communication and one-way randomness distillation. For a finite-dimensional quantum channel without initial shared entanglement, an exact amortization theorem bounds the increase of message information plus entanglement remaining across the communicating laboratories. This proves a classical-feedback capacity bound using a mixed-convex-roof expression previously studied by Winter and Yang in the context of potential capacities. We determine the capacity of flagged mixtures of noiseless and entanglement-breaking channels, improve a published depolarizing-channel converse, and evaluate the new bound exactly for the amplitude damping channel. A state analogue gives a finite-blocklength upper bound on the net shared randomness obtainable with one-way classical communication. Amplitude-damping Choi states provide exact benchmarks, while a full-rank generalized amplitude-damping Choi state demonstrates a useful improvement where we do not evaluate the operational rate exactly. We also distinguish one-way from two-way randomness distillation: a two-round weak-measurement protocol strictly exceeds the exact one-way rate of every nontrivial qubit isotropic state. The protocol preserves quantum side information during its first decoding and extracts additional randomness in the reverse direction. This shows why the one-way state potential is not a general two-way converse. Together, these results establish a common entanglement-based approach to sharper communication and randomness bounds, while revealing how retained quantum correlations enable two-way distillation to surpass one-way limits.

quant-pharXiv:2610.04831•Oct 6, 2026•0 citations

The n-shot classical capacity of the quantum erasure channel

Matteo Rosati

Abstract We compute the n-shot classical capacity of the quantum erasure channel, providing upper bounds and almost-matching lower bounds for it, the latter achievable via large-minimum-distance classical linear codes for any n. The protocols are in full product form, i.e. no entanglement is needed either at the encoder or decoder to attain the capacity, and they explicitly adapt to the transition between different error regimes as the erasure probability increases. Finally, we show that our upper and lower bounds on the capacity are tighter than those obtainable from the general theory of finite-size capacity via generalized divergences.

Journal of Physics Communications•Aug 1, 2024•2 citations
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 ddd, an erasure probability ppp, a blocklength nnn, and MMM equiprobable messages, the optimal success probability is equal to E[min⁡{1,dK/M}]E[\min\{1,d^K/M\}]E[min{1,dK/M}], where KKK is binomial with parameters nnn and 1−p1-p1−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-ddd 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 MMM. 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.
The paper asks how classical feedback affects finite-blocklength classical communication over a ddd-dimensional quantum erasure channel, without initial shared entanglement. For nnn uses, erasure probability ppp, and MMM equiprobable messages, it proves the exact feedback-assisted success probability E[min⁡{1,dK/M}]\mathbb E[\min\{1,d^K/M\}]E[min{1,dK/M}], where K∼Bin(n,1−p)K\sim\mathrm{Bin}(n,1-p)K∼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 MMM. 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<10<p<10<p<1. At p=1/2p=1/2p=1/2, the optimal classical no-feedback success is 51/6451/6451/64, a tetrahedral product-state code achieves (47+26)/64(47+2\sqrt6)/64(47+26​)/64, and the quantum no-feedback optimum is strictly below the feedback value 53/6453/6453/64.
The paper also derives an explicit message-size formula, identical normal approximations with O(1)O(1)O(1) remainders with and without feedback, and a common average-success strong-converse exponent. Below capacity, the feedback error exponent is Dbin(R/log⁡2d∥1−p)D_{\rm bin}(R/\log_2d\|1-p)Dbin​(R/log2​d∥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.
Quantum entanglement can be used in a communication scheme to establish a correlation between successive channel inputs that is impossible by classical means. It is known that the classical capacity of quantum channels can be enhanced by such entangled encoding schemes, but this is not always the case. In this paper, we prove that a strong converse theorem holds for the classical capacity of an entanglement-breaking channel even when it is assisted by a classical feedback link from the receiver to the transmitter. In doing so, we identify a bound on the strong converse exponent, which determines the exponentially decaying rate at which the success probability tends to zero, for a sequence of codes with communication rate exceeding capacity. Proving a strong converse, along with an achievability theorem, shows that the classical capacity is a sharp boundary between reliable and unreliable communication regimes. One of the main tools in our proof is the sandwiched Rényi relative entropy. The same method of proof is used to derive an exponential bound on the success probability when communicating over an arbitrary quantum channel assisted by classical feedback, provided that the transmitter does not use entangled encoding schemes.
We explore several new converse bounds for classical communication over quantum channels in the finite blocklength regime. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical communication can be achieved by activated, no-signalling assisted codes, suitably generalizing a result for classical channels. Second, we derive a new meta-converse on the amount of information unassisted codes can transmit over a single use of a quantum channel. We further show that this meta-converse can be evaluated via semidefinite programming. As an application, we provide a second-order analysis of classical communication over quantum erasure channels.
We study quantum-state oblivious transfer over the quantum erasure channel under information-theoretic security guarantees. Specifically, Alice holds two quantum systems, Bob wishes to recover one of them, and the parties have access to independent channel uses and authenticated public classical communication, with no initial shared entanglement. We consider both honest-but-curious and malicious behavior. We establish finite-blocklength converse and achievability bounds, which match in the honest-but-curious setting. The malicious setting construction combines interactive hashing with tests of whether Bob received selected channel outputs, and distributes each input across several qubits so that erasures conceal an entire input from a dishonest receiver, even when the inputs are entangled with an external reference. We also derive fixed-error asymptotic expansions and show that both malicious and honest-but-curious settings have the same capacity.
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 framework of quantum hypothesis testing with restricted measurements. Our bounds do not depend on any special property of the channel (such as memorylessness) and generalize both a classical converse of Polyanskiy, Poor, and Verdú as well as a quantum converse of Renner and Wang, and have a number of desirable properties. In particular, our bound on entanglement-assisted codes is a semidefinite program and for memoryless channels, its large blocklength limit is the well-known formula for entanglement-assisted capacity due to Bennett, Shor, Smolin, and Thapliyal.
We develop entanglement-of-formation potentials for feedback-assisted classical communication and one-way randomness distillation. For a finite-dimensional quantum channel without initial shared entanglement, an exact amortization theorem bounds the increase of message information plus entanglement remaining across the communicating laboratories. This proves a classical-feedback capacity bound using a mixed-convex-roof expression previously studied by Winter and Yang in the context of potential capacities. We determine the capacity of flagged mixtures of noiseless and entanglement-breaking channels, improve a published depolarizing-channel converse, and evaluate the new bound exactly for the amplitude damping channel. A state analogue gives a finite-blocklength upper bound on the net shared randomness obtainable with one-way classical communication. Amplitude-damping Choi states provide exact benchmarks, while a full-rank generalized amplitude-damping Choi state demonstrates a useful improvement where we do not evaluate the operational rate exactly. We also distinguish one-way from two-way randomness distillation: a two-round weak-measurement protocol strictly exceeds the exact one-way rate of every nontrivial qubit isotropic state. The protocol preserves quantum side information during its first decoding and extracts additional randomness in the reverse direction. This shows why the one-way state potential is not a general two-way converse. Together, these results establish a common entanglement-based approach to sharper communication and randomness bounds, while revealing how retained quantum correlations enable two-way distillation to surpass one-way limits.
Abstract We compute the n-shot classical capacity of the quantum erasure channel, providing upper bounds and almost-matching lower bounds for it, the latter achievable via large-minimum-distance classical linear codes for any n. The protocols are in full product form, i.e. no entanglement is needed either at the encoder or decoder to attain the capacity, and they explicitly adapt to the transition between different error regimes as the erasure probability increases. Finally, we show that our upper and lower bounds on the capacity are tighter than those obtainable from the general theory of finite-size capacity via generalized divergences.