{"title":"The n-shot classical capacity of the quantum erasure channel","authors":"Matteo Rosati","doi":"10.1088/2399-6528/ad6f6b","DOIUrl":null,"url":null,"abstract":"We compute the <italic toggle=\"yes\">n</italic>-shot classical capacity of the quantum erasure channel, providing upper bounds and almost-matching lower bounds for it, the latter achievable via large-minimum-distance classical linear codes for any <italic toggle=\"yes\">n</italic>. The protocols are in full product form, i.e. no entanglement is needed either at the encoder or decoder to attain the capacity, and they explicitly adapt to the transition between different error regimes as the erasure probability increases. Finally, we show that our upper and lower bounds on the capacity are tighter than those obtainable from the general theory of finite-size capacity via generalized divergences.","PeriodicalId":47089,"journal":{"name":"Journal of Physics Communications","volume":"74 39 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Physics Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/2399-6528/ad6f6b","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
We compute the n-shot classical capacity of the quantum erasure channel, providing upper bounds and almost-matching lower bounds for it, the latter achievable via large-minimum-distance classical linear codes for any n. The protocols are in full product form, i.e. no entanglement is needed either at the encoder or decoder to attain the capacity, and they explicitly adapt to the transition between different error regimes as the erasure probability increases. Finally, we show that our upper and lower bounds on the capacity are tighter than those obtainable from the general theory of finite-size capacity via generalized divergences.
我们计算了量子擦除信道的 n 次经典容量,为其提供了上界和几乎匹配的下界,后者可通过任意 n 的大最小距离经典线性编码实现。这些协议是全积形式的,即编码器和解码器都不需要纠缠就能达到容量,而且随着擦除概率的增加,它们能明确地适应不同错误机制之间的转换。最后,我们证明了我们的容量上下限比通过广义发散从有限大小容量的一般理论中获得的容量上下限更严格。