Reliability of quantum communication over erasure channels

Quantum information can be reliably transmitted at rates below the quantum capacity with an error that vanishes as the number of channel uses grows. The reliability function characterizes the optimal exponential decay rate of this error. For quantum erasure channels with a prime input dimension, we determine the reliability function exactly at all positive communication rates below capacity that meet or exceed an explicit critical rate. Notably, stabilizer coding strategies attain this optimal reliability throughout this regime.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24054
Primary Topic
Quantum Information and Cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Reliability of quantum communication over erasure channels

Kun Fang, Hongyu Mao
arXiv (Cornell University)
Quantum Information and Cryptography
preprint

Reliability of quantum communication over erasure channels

Kun Fang, Hongyu Mao
preprint en

Abstract

Quantum information can be reliably transmitted at rates below the quantum capacity with an error that vanishes as the number of channel uses grows. The reliability function characterizes the optimal exponential decay rate of this error. For quantum erasure channels with a prime input dimension, we determine the reliability function exactly at all positive communication rates below capacity that meet or exceed an explicit critical rate. Notably, stabilizer coding strategies attain this optimal reliability throughout this regime.

arXiv (Cornell University)
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon