arXiv:2610.03674
Efficient capacity-achieving entanglement generation with application to pure-loss Bosonic channels
Avijit Mandal, Christophe Piveteau, Henry D. Pfister, Joseph M. Renes
Abstract
While the ultimate limits on the rate of quantum communication over noisy channels are well-established, very few efficient coding schemes achieving these limits are known. This contrasts sharply with transmitting classical data over classical channels, where polar codes and low-density parity-check codes both efficiently achieve the classical capacity of any noisy channel. In this work we construct an efficient entanglement generation scheme which achieves the coherent information for a broad class of channels. For degradable channels in the class, which includes truncated versions of the pure loss Bosonic channel, the resulting scheme achieves the quantum capacity. The construction makes use of polar codes for two kinds of classical-input, quantum-output (CQ) channels: those with commuting outputs and those whose outputs are heralded mixtures of pure states. The former case is amenable to decoding by classical polar decoding algorithms, the latter by the belief propagation with quantum messages (BPQM) algorithm. To our knowledge, this construction is the first explicit and efficiently decodable protocol that achieves the energy-constrained quantum capacity of the pure-loss Bosonic channel.
AI Summary
The paper addresses efficient decoding for quantum-channel codes achieving coherent information, with an application to the energy-constrained quantum capacity of the pure-loss bosonic channel. It considers entanglement generation for pure discrete phase-covariant (PDPC) channels, a class including higher-dimensional amplitude damping, dephasing, and truncated pure-loss channels. The construction combines entanglement-assisted CSS polar codes with two coherent decoders: classical successive cancellation for amplitude information, whose channel outputs commute, and belief propagation with quantum messages (BPQM) for phase information, whose outputs reduce to heralded mixtures of symmetric pure states. A general decoder theorem gives output fidelity at least $1-(\sqrt{\epsilon_X}+\sqrt{\epsilon_Z})^2$. For prime local dimension $d$, blocklength $m$, and $0<\beta<1/2$, the polar construction yields $\epsilon_Z\leq(d-1)m2^{-m^\beta}$ and $\epsilon_X\leq4(d-1)m2^{-m^\beta}$, with net entanglement rate converging to coherent information. For degradable PDPC channels, optimizing the input gives quantum capacity, and entanglement assistance is stated to be removable. For pure loss, truncating a two-mode squeezed input gives an exponentially vanishing capacity gap in the cutoff $d$. Taking $m\to\infty$ at fixed sufficiently large $d$ achieves any rate below $g(\eta\bar n)-g((1-\eta)\bar n)$ for $\eta>1/2$. The stated decoding cost is $O(d^2m\log m)$ in an exact real-register model. A finite-precision error analysis for the $d$-ary decoder is left to future work. Monte Carlo density evolution supplies practical code-design estimates rather than certified error guarantees.
During the later stages of preparation, the authors used ChatGPT (GPT Sol-6 and earlier versions) and Claude (Opus 5.5) to check and refine the written presentation of the proofs
Central claim may not hold: The claimed efficient decoder is analyzed only with exact, infinite-dimensional real registers and unit-cost real-controlled operations, while the finite-precision d-ary implementation needed to establish efficiency in the standard quantum circuit model is explicitly left to future work.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.