2015/08/05 by Tao Zhang, Gennian Ge, Zhang, Tao +1
Computer Science · #Quantum Computing Algorithms and Architecture #Quantum-Dot Cellular Automata #Quantum Information and Cryptography
paper · pdf · doi:10.48550/arxiv.1508.00974
One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical codes, we are able to obtain some new quantum codes. It turns out that some of quantum codes exhibited here have better parameters than the ones available in the literature. Meanwhile, we give a new class of quantum synchronizable codes with highest possible tolerance against misalignment from duadic codes.