Concatenated Quantum Codes Achieving High Rates With Polynomial-Time Error Estimation or Construction
Year: 2006
Type: preprint
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 known bound best on the minimum distance of codes constructible in polynomial time is improved for a wide range.
Source: arXiv (Cornell University)
Author: Mitsuru Hamada
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2567289310