2006/01/18 by Salah A. Aly, Aly, Salah A., Andreas Klappenecker +3
Computer Science · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.quant-ph/0601117
openalex publication_date 2006/01/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Good quantum codes, such as quantum MDS codes, are typically nondegenerate, meaning that errors of small weight require active error-correction, which is--paradoxically--itself prone to errors. Decoherence free subspaces, on the other hand, do not require active error correction, but perform poorly in terms of minimum distance. In this paper, examples of degenerate quantum codes are constructed that have better minimum distance than decoherence free subspaces and allow some errors of small weight that do not require active error correction. In particular, two new families of [[n,1,>= sqrt(n)]]q degenerate quantum codes are derived from classical duadic codes.