可在多项式时间内构造的级联量子码：高效译码与纠错
量子物理
2016-11-17 v4
摘要
提出了一种级联量子纠错码的方法。该方法适用于一类广泛的被称为 Calderbank-Shor-Steane (CSS) 码的量子纠错码。由此，给出了在香农理论意义上达到高码率且可在多项式时间内译码的码。其码率在已知可由 CSS 码达到的码率中是最高的。此外，对于广泛范围内的可在多项式时间内构造的码，其最大最小距离的最佳已知下界得到了改进。
引用
@article{arxiv.quant-ph/0610195,
title = {Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction},
author = {Mitsuru Hamada},
journal= {arXiv preprint arXiv:quant-ph/0610195},
year = {2016}
}
备注
16 pages, 3 figures. Ver.4: Title changed. Ver.3: Due to a request of the AE of the journal, the present version has become a combination of (thoroughly revised) quant-ph/0610194 and the former quant-ph/0610195. Problem formulations of polynomial complexity are strictly followed. An erroneous instance of a lower bound on minimum distance was removed