New Quantum Codes Constructed by Quantum Caps in PG(3,9) and PG(4,9)
Husheng Li, Ruihu Li, Qiang Fu
IEEE Access · 2020
doi:10.1109/access.2020.3045990 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this paper, we present a computer-supported method of searching for quantum caps. By means of this method and relevant knowledge of combinatorics, many quantum caps in <inline-formula> <tex-math notation="LaTeX">$PG(3,9)$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$PG(4,9)$ </tex-math></inline-formula> are constructively proven to exist. Then, according to the theorem that each quantum cap corresponds to a quantum error-correcting code with <inline-formula> <tex-math notation="LaTeX">$d=4$ </tex-math></inline-formula>, we obtain 278 quantum error-correcting codes. Most of these results break the GV bound, and a number of them are optimal quantum codes or have improved parameters.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.