Polar Codes for Erasure and Unital Classical-Quantum Markovian Channels
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917116933832704 |
|---|---|
| author | Mandalapu, Jaswanthi Siddhu, Vikesh Jagannathan, Krishna |
| author_facet | Mandalapu, Jaswanthi Siddhu, Vikesh Jagannathan, Krishna |
| contents | We consider classical-quantum (cq-)channels with memory, and establish that Arıkan-constructed polar codes achieve the classical capacity for two key noise models, namely for (i) qubit erasures and (ii) unital qubit noise with channel state information at the receiver. The memory in the channel is assumed to be governed by a discrete-time, countable-state, aperiodic, irreducible, and positive recurrent Markov process. We establish this result by leveraging existing classical polar coding guarantees established for finite-state, aperiodic, and irreducible Markov processes [FAIM], alongside the recent finding that no entanglement is required to achieve the capacity of Markovian unital and erasure quantum channels when transmitting classical information. More broadly, our work illustrates that for cq-channels with memory, where an optimal coding strategy is essentially classical, polar codes can be shown to approach the capacity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_14323 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Polar Codes for Erasure and Unital Classical-Quantum Markovian Channels Mandalapu, Jaswanthi Siddhu, Vikesh Jagannathan, Krishna Quantum Physics Information Theory We consider classical-quantum (cq-)channels with memory, and establish that Arıkan-constructed polar codes achieve the classical capacity for two key noise models, namely for (i) qubit erasures and (ii) unital qubit noise with channel state information at the receiver. The memory in the channel is assumed to be governed by a discrete-time, countable-state, aperiodic, irreducible, and positive recurrent Markov process. We establish this result by leveraging existing classical polar coding guarantees established for finite-state, aperiodic, and irreducible Markov processes [FAIM], alongside the recent finding that no entanglement is required to achieve the capacity of Markovian unital and erasure quantum channels when transmitting classical information. More broadly, our work illustrates that for cq-channels with memory, where an optimal coding strategy is essentially classical, polar codes can be shown to approach the capacity. |
| title | Polar Codes for Erasure and Unital Classical-Quantum Markovian Channels |
| topic | Quantum Physics Information Theory |
| url | https://arxiv.org/abs/2507.14323 |