Metraipolis › archive › dc_fe85c4162e04

Efficient capacity-achieving entanglement generation with application to pure-loss Bosonic channels — arXiv:2610.03674

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.03674
License (as archived)
CC0-1.0
Archived
2026-10-06T08:40:52.793Z
SHA-256 of the archived text
1a6ecb334c00dc2cd5784b344a17e70b3981ee0133f5f7b09398e75eeae66846
Stable URL of this page
https://metraipolis.com/documento/dc_fe85c4162e04

How to cite

Efficient capacity-achieving entanglement generation with application to pure-loss Bosonic channels — arXiv:2610.03674 — arXiv (en), https://arxiv.org/abs/2610.03674 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fe85c4162e04 (Metraipolis archive dc_fe85c4162e04, sha256 1a6ecb334c00dc2cd5784b344a17e70b3981ee0133f5f7b09398e75eeae66846)
BibTeX
@misc{dcfe85c4162e04,
  title = {Efficient capacity-achieving entanglement generation with application to pure-loss Bosonic channels — arXiv:2610.03674},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.03674},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fe85c4162e04; sha256 1a6ecb334c00dc2cd5784b344a17e70b3981ee0133f5f7b09398e75eeae66846},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.03674. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.IT).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.03674 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T08:19:47.078Z dalla pagina https://arxiv.org/catchup/math.IT/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).