Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 47 min ago
PreprintCC BY 4.0arXiv

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

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.

Related

  1. On the Evolution of the Capacity-Achieving Input Support for the Amplitude-Constrained AWGN Channel
    Luca Barletta, Alex Dytso
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. An Improved Lower Bound on Support Size of Capacity-Achieving Inputs for the Binomial Channel: Extended version
    Mohammadamin Baniasadi, Antonino Favano, Luca Barletta +1
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  3. Explicit Capacity-Achieving Quantum LDPC Codes List Decodable in Near-linear Time
    William Gay, Fernando Granha Jeronimo, Abhi Shukul
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  4. Bounds and Limitations on Codes Achieving List Recovery Capacity
    Joshua Brakensiek, Yeyuan Chen, Aaron Putterman +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. Capacity Achieving Torn Paper Codes
    Junsheng Liu, Netanel Raviv
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
BibTeX
@misc{mandal2026efficient,
  title = {{Efficient capacity-achieving entanglement generation with application to pure-loss Bosonic channels}},
  author = {Avijit Mandal and Christophe Piveteau and Henry D. Pfister and Joseph M. Renes},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.03674},
  eprint = {2610.03674},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.03674},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Efficient capacity-achieving entanglement generation with application to pure-loss Bosonic channels
AU  - Avijit Mandal
AU  - Christophe Piveteau
AU  - Henry D. Pfister
AU  - Joseph M. Renes
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2610.03674
UR  - https://arxiv.org/abs/2610.03674
AB  - 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.
ER  -