2006/08/08 by Hachiro Fujita, Fujita, Hachiro
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0608063
This paper was presented in part at the IEICE Technical Meeting on Information Theory, Nagoya, Japan, March 2006
arxiv created 2006/08/08 · openalex publication_date 2006/08/08 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of Ashikhmin--Litsyn--Tsfasman and Matsumoto. We also give a polynomial-time decoding algorithm for the codes that can decode up to one fourth of the lower bound on the minimum distance of the codes.