Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction

IF 2.2 3区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

IEEE Transactions on Information Theory Pub Date : 2008-11-25 DOI:10.1109/TIT.2008.2006416

Mitsuru Hamada

引用次数: 63

Abstract

A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon-theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.

查看原文本刊更多论文

多项式时间构造的级联量子码：有效的译码和纠错

提出了一种级联量子纠错码的方法。该方法适用于一类广泛的量子纠错码，即Calderbank Shor-Steane（CSS）码。结果，给出了在香农理论意义上实现高速率并且在多项式时间内可解码的代码。该比率是已知CSS代码可以实现的比率中最高的。此外，在多项式时间内可构造的码的最大最小距离的已知下界在很大范围内得到了改进。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Transactions on Information Theory 工程技术-工程：电子与电气

CiteScore

5.70

自引率

20.00%

发文量

514

审稿时长

12 months

期刊介绍： The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.