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.03674

Efficient capacity-achieving entanglement generation with application to pure-loss Bosonic channels

Avijit Mandal, Christophe Piveteau, Henry D. Pfister, Joseph M. Renes

quant-phcs.ITSubmitted Oct 2, 2026• Announced Oct 5, 2026• 0 citations
arXivHTMLPDF

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.

Little sign of AI-generated textAI use disclosedStrong assumptionsOverclaims
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.

Related papers

Classical and quantum polar coding for Bosonic Gaussian channels.

Felipe Gomes Lacerda, Joseph M. Renes, Volkher B. Scholz

We construct explicit codes for transmitting classical or quantum information over the thermal-noise Bosonic Gaussian channel. For classical information transmission, our codes achieve the classical capacity, recently characterized by Giovannetti et al. [Nature Photonics 8, 796 (2014)], while in the quantum case they transmit at a rate given by the Gaussian coherent information. The construction is based on concatenating polar codes with a suitable discretization of the channel input into a finite constellation of coherent states. The codes have efficient encoders, but the complexity of decoding is unknown. Our results are based on a quantum version of Wu and Verd\'u's technique of determining the achievable rates of finite constellations for the classical Gaussian-noise channel [Allerton 2010, pp. 620].

•Mar 18, 2016•0 citations

Coherent state contellations and polar codes for Bosonic Gaussian channels

Felipe Gomes Lacerda

Optical communication channels are ultimately quantum-mechanical in nature, and we must therefore look beyond classical information theory to determine their communication capacity as well as to find efficient encoding and decoding schemes of the highest rates. Thermal channels, which arise from linear coupling of the field to a thermal environment, are of particular practical relevance; their classical capacity has been recently established, but their quantum capacity remains unknown. While the capacity sets the ultimate limit on reliable communication rates, it does not promise that such rates are achievable by practical means. Here we construct efficiently-encodable codes for thermal channels which achieve the classical capacity and the so-called Gaussian coherent information for transmission of classical and quantum information, respectively. Our codes are based on combining polar codes with a discretization of the channel input into a finite constellation of coherent states. Encoding of classical information can be done using linear optics.

•Mar 18, 2016•0 citations

Polar Codes for CQ Channels: Decoding via Belief-Propagation with Quantum Messages

Avijit Mandal, Sam Brandsen, Henry D. Pfister

This paper considers the design and decoding of polar codes for general classical-quantum (CQ) channels. It focuses on decoding via belief-propagation with quantum messages (BPQM) and, in particular, the idea of paired-measurement BPQM (PM-BPQM) decoding. Since the PM-BPQM decoder admits a classical density evolution (DE) analysis, one can use DE to design a polar code for any CQ channel and then efficiently compute the trade-off between code rate and error probability. We have also implemented and tested a classical simulation of our PM-BPQM decoder for polar codes. While the decoder can be implemented efficiently on a quantum computer, simulating the decoder on a classical computer actually has exponential complexity. Thus, simulation results for the decoder are somewhat limited and are included primarily to validate our theoretical results.

arXiv:2401.07167•Jan 13, 2024•7 citations

Polar Codes for Private and Quantum Communication Over Arbitrary Channels

Joseph M. Renes, Mark M. Wilde

We construct new polar coding schemes for the transmission of quantum or private classical information over arbitrary quantum channels. In the former case, our coding scheme achieves the symmetric coherent information, and in the latter, the symmetric private information. Both schemes are built from a polar coding construction capable of transmitting classical information over a quantum channel. Appropriately merging two such classical-quantum schemes, one for transmitting amplitude information and the other for transmitting phase, leads to the new private and quantum coding schemes, similar to the construction for Pauli and erasure channels of Renes et al. The encoding is entirely similar to the classical case, and thus efficient. The decoding can also be performed by successive cancellation, as in the classical case, but no efficient successive cancellation scheme is yet known for arbitrary quantum channels. An efficient code construction is unfortunately still unknown. Generally, our two coding schemes require entanglement or secret-key assistance, respectively, but we extend two known conditions under which the needed assistance rate vanishes. Finally, although our results are formulated for qubit channels, we show how the scheme can be extended to multiple qubits. This then demonstrates a near-explicit coding method for realizing one of the most striking phenomena in quantum information theory: the superactivation effect, whereby two quantum channels, which individually have zero quantum capacity can have a nonzero quantum capacity when used together.

arXiv:1212.2537•IEEE Transactions on Information Theory•Mar 31, 2014•55 citations

Strong converse for the quantum capacity of the pure-loss bosonic channel

Mark M. Wilde

This paper reports the proof of a strong converse for the unconstrained quantum capacity of the pure-loss bosonic channel. At every fixed rate above capacity, the entanglement-generation fidelity of every code is bounded by a constant times the reciprocal of the number of channel uses. The bound holds without an energy constraint and for arbitrary encoded states, including states correlated across all input modes, and arbitrary joint decoders. The proof combines quantum Chebyshev and hockey-stick testing inequalities with a uniform relative-entropy-variance bound for the balanced pure-loss channel, corresponding to transmissivity $η=1/2$. The variance bound follows by expressing the balanced beam splitter in bright and dark modes: the dark modes are exactly in vacuum, and any state orthogonal to that vacuum contains at least one dark photon. For general transmissivity, dilating the degrading attenuator reduces the problem to this balanced-channel setting and bounds the decoder test by precisely the factor that produces the known quantum-capacity threshold. The resulting argument establishes the strong converse at the unconstrained quantum capacity for every pure-loss bosonic channel.

quant-pharXiv:2609.16608•Sep 16, 2026•3 citations

Belief-Propagation with Quantum Messages for Polar Codes on Classical-Quantum Channels

Avijit Mandal, Sam Brandsen, Henry D. Pfister

This paper considers the design and decoding of polar codes for general classical-quantum (CQ) channels. It focuses on decoding via belief-propagation with quantum messages (BPQM) and, in particular, the idea of paired-measurement BPQM (PM-BPQM) decoding. Since the PM-BPQM decoder admits a classical density evolution (DE) analysis, one can use DE to design a polar code for any CQ channel and then efficiently compute the trade-off between code rate and error probability. We have also implemented and tested a classical simulation of our PM-BPQM decoder for polar codes. While the decoder can be implemented efficiently on a quantum computer, simulating the decoder on a classical computer actually has exponential complexity. Thus, simulation results for the decoder are somewhat limited and are included primarily to validate our theoretical results.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•4 citations
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.
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−(ϵX+ϵZ)21-(\sqrt{\epsilon_X}+\sqrt{\epsilon_Z})^21−(ϵX​​+ϵZ​​)2. For prime local dimension ddd, blocklength mmm, and 0<β<1/20<\beta<1/20<β<1/2, the polar construction yields ϵZ≤(d−1)m2−mβ\epsilon_Z\leq(d-1)m2^{-m^\beta}ϵZ​≤(d−1)m2−mβ and ϵX≤4(d−1)m2−mβ\epsilon_X\leq4(d-1)m2^{-m^\beta}ϵX​≤4(d−1)m2−mβ, 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 ddd. Taking m→∞m\to\inftym→∞ at fixed sufficiently large ddd achieves any rate below g(ηnˉ)−g((1−η)nˉ)g(\eta\bar n)-g((1-\eta)\bar n)g(ηnˉ)−g((1−η)nˉ) for η>1/2\eta>1/2η>1/2.
The stated decoding cost is O(d2mlog⁡m)O(d^2m\log m)O(d2mlogm) in an exact real-register model. A finite-precision error analysis for the ddd-ary decoder is left to future work. Monte Carlo density evolution supplies practical code-design estimates rather than certified error guarantees.
We construct explicit codes for transmitting classical or quantum information over the thermal-noise Bosonic Gaussian channel. For classical information transmission, our codes achieve the classical capacity, recently characterized by Giovannetti et al. [Nature Photonics 8, 796 (2014)], while in the quantum case they transmit at a rate given by the Gaussian coherent information. The construction is based on concatenating polar codes with a suitable discretization of the channel input into a finite constellation of coherent states. The codes have efficient encoders, but the complexity of decoding is unknown. Our results are based on a quantum version of Wu and Verd\'u's technique of determining the achievable rates of finite constellations for the classical Gaussian-noise channel [Allerton 2010, pp. 620].
Optical communication channels are ultimately quantum-mechanical in nature, and we must therefore look beyond classical information theory to determine their communication capacity as well as to find efficient encoding and decoding schemes of the highest rates. Thermal channels, which arise from linear coupling of the field to a thermal environment, are of particular practical relevance; their classical capacity has been recently established, but their quantum capacity remains unknown. While the capacity sets the ultimate limit on reliable communication rates, it does not promise that such rates are achievable by practical means. Here we construct efficiently-encodable codes for thermal channels which achieve the classical capacity and the so-called Gaussian coherent information for transmission of classical and quantum information, respectively. Our codes are based on combining polar codes with a discretization of the channel input into a finite constellation of coherent states. Encoding of classical information can be done using linear optics.
This paper considers the design and decoding of polar codes for general classical-quantum (CQ) channels. It focuses on decoding via belief-propagation with quantum messages (BPQM) and, in particular, the idea of paired-measurement BPQM (PM-BPQM) decoding. Since the PM-BPQM decoder admits a classical density evolution (DE) analysis, one can use DE to design a polar code for any CQ channel and then efficiently compute the trade-off between code rate and error probability. We have also implemented and tested a classical simulation of our PM-BPQM decoder for polar codes. While the decoder can be implemented efficiently on a quantum computer, simulating the decoder on a classical computer actually has exponential complexity. Thus, simulation results for the decoder are somewhat limited and are included primarily to validate our theoretical results.
We construct new polar coding schemes for the transmission of quantum or private classical information over arbitrary quantum channels. In the former case, our coding scheme achieves the symmetric coherent information, and in the latter, the symmetric private information. Both schemes are built from a polar coding construction capable of transmitting classical information over a quantum channel. Appropriately merging two such classical-quantum schemes, one for transmitting amplitude information and the other for transmitting phase, leads to the new private and quantum coding schemes, similar to the construction for Pauli and erasure channels of Renes et al. The encoding is entirely similar to the classical case, and thus efficient. The decoding can also be performed by successive cancellation, as in the classical case, but no efficient successive cancellation scheme is yet known for arbitrary quantum channels. An efficient code construction is unfortunately still unknown. Generally, our two coding schemes require entanglement or secret-key assistance, respectively, but we extend two known conditions under which the needed assistance rate vanishes. Finally, although our results are formulated for qubit channels, we show how the scheme can be extended to multiple qubits. This then demonstrates a near-explicit coding method for realizing one of the most striking phenomena in quantum information theory: the superactivation effect, whereby two quantum channels, which individually have zero quantum capacity can have a nonzero quantum capacity when used together.
This paper reports the proof of a strong converse for the unconstrained quantum capacity of the pure-loss bosonic channel. At every fixed rate above capacity, the entanglement-generation fidelity of every code is bounded by a constant times the reciprocal of the number of channel uses. The bound holds without an energy constraint and for arbitrary encoded states, including states correlated across all input modes, and arbitrary joint decoders. The proof combines quantum Chebyshev and hockey-stick testing inequalities with a uniform relative-entropy-variance bound for the balanced pure-loss channel, corresponding to transmissivity η=1/2η=1/2η=1/2. The variance bound follows by expressing the balanced beam splitter in bright and dark modes: the dark modes are exactly in vacuum, and any state orthogonal to that vacuum contains at least one dark photon. For general transmissivity, dilating the degrading attenuator reduces the problem to this balanced-channel setting and bounds the decoder test by precisely the factor that produces the known quantum-capacity threshold. The resulting argument establishes the strong converse at the unconstrained quantum capacity for every pure-loss bosonic channel.
This paper considers the design and decoding of polar codes for general classical-quantum (CQ) channels. It focuses on decoding via belief-propagation with quantum messages (BPQM) and, in particular, the idea of paired-measurement BPQM (PM-BPQM) decoding. Since the PM-BPQM decoder admits a classical density evolution (DE) analysis, one can use DE to design a polar code for any CQ channel and then efficiently compute the trade-off between code rate and error probability. We have also implemented and tested a classical simulation of our PM-BPQM decoder for polar codes. While the decoder can be implemented efficiently on a quantum computer, simulating the decoder on a classical computer actually has exponential complexity. Thus, simulation results for the decoder are somewhat limited and are included primarily to validate our theoretical results.