Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0912.4461

The Spectrum of Quantum Caps in PG(4,4)

Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco

Published Dec 22, 2009• 0 citations
arXivHTMLPDF

Abstract

We prove the non existence of quantum caps of sizes 37 and 39. This completes the spectrum of quantum caps in PG(4, 4). This also implies the non existence of linear [[37,27,4]] and [[39,29,4]]-codes. The problem of the existence of non linear quantum codes with such parameters remains still open.
DOI
10.48550/arxiv.0912.4461

Related papers

Quantum Codes Constructed by Quantum Caps in PG (4, 5)

Chaofeng Guan, Ruihu Li, Husheng Li +4 more

Abstract In this paper, 57 quantum caps in PG (4,5) are found using a computer-supported search method, and related quantum error-correcting codes are constructed via CSS construction. By comparison, most of these codes have good parameters, and some of them enhance the existing results.

Journal of Physics Conference Series•Jun 1, 2021•0 citations

New Quantum Caps in PG(4, 4)

Daniele Bartoli, Giorgio Faina, Stefano Marcugini +1 more

Abstract Calderbank, Rains, Shor, and Sloane (see [10]) showed that quantum stabilizer codes correspond to additive quaternary codes in binary projective spaces, which are self‐orthogonal with respect to the symplectic form. A geometric description is given in [8, 19]. In [8] the notion of a quantum cap is introduced. Quantum caps are equivalent to quantum stabilizer codes of minimum distance when the code is linear over . In this paper, we determine the valuesksuch that there exists a quantumk‐cap in , corresponding to pure linear quantum codes, proving, by exhaustive search, that no 11, 37, 39‐quantum caps exist. Moreover we give examples of quantum caps in not already known in the literature.

Journal of Combinatorial Designs•Jun 18, 2012•17 citations

New quantum caps in PG(4,4)

Daniele Bartoli, Stefano Marcugini, Fernanda Pambianco

Calderbank, Rains, Shor and Sloane (see \cite{Sloane}) showed that error-correction is possible in the context of quantum computations. Quantum stabilizer codes are a class of additive quaternary codes in binary projective spaces, which are self-orthogonal with respect to the symplectic form. A geometric description is given in \cite{Bierbra}, where also the notion of quantum cap is introduced. Quantum caps correspond to the special case of quantum stabilizer codes of distance $d=4$ when the code is linear over GF(4). In the present paper we review the translation from quantum error-correction to symplectic geometry and study quantum codes in PG(4,4) where we construct complete quantum caps with 20, 29, 30, 32, 33, 34, 36 and 38 points and incomplete quantum caps with 10, 12, 13, 20, 23, 24, 25 and 26 points and we prove the non existence of 11-quantum caps. In particular the quantum caps of sizes 36 and 38 yield positive answers to the existence questions of quantum codes $[[36,26,4]]$ and $[[38,28,4]]$ that remained open in the data base \cite{codetable}.

arXiv:0905.1059•May 7, 2009•2 citations

New Quantum Codes Constructed by Quantum Caps in PG(3,9) and PG(4,9)

Husheng Li, Ruihu Li, Qiang Fu

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$PG(3,9)$and$PG(4,9)$are constructively proven to exist. Then, according to the theorem that each quantum cap corresponds to a quantum error-correcting code with$d=4$, 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.

IEEE Access•Jan 1, 2020•4 citations

Construction of quantum caps in projective space PG(r, 4) and quantum codes of distance 4

Ruihu Li, Qiang Fu, Luobin Guo +1 more

Quantum Information Processing•Dec 11, 2015•9 citations

Construction of quantum caps in projective space PG(r, 4) and quantum codes of distance 4

李瑞虎

•Nov 18, 2016•15 citations
Abstract Calderbank, Rains, Shor, and Sloane (see [10]) showed that quantum stabilizer codes correspond to additive quaternary codes in binary projective spaces, which are self‐orthogonal with respect to the symplectic form. A geometric description is given in [8, 19]. In [8] the notion of a quantum cap is introduced. Quantum caps are equivalent to quantum stabilizer codes of minimum distance when the code is linear over . In this paper, we determine the valuesksuch that there exists a quantumk‐cap in , corresponding to pure linear quantum codes, proving, by exhaustive search, that no 11, 37, 39‐quantum caps exist. Moreover we give examples of quantum caps in not already known in the literature.
Calderbank, Rains, Shor and Sloane (see \cite{Sloane}) showed that error-correction is possible in the context of quantum computations. Quantum stabilizer codes are a class of additive quaternary codes in binary projective spaces, which are self-orthogonal with respect to the symplectic form. A geometric description is given in \cite{Bierbra}, where also the notion of quantum cap is introduced. Quantum caps correspond to the special case of quantum stabilizer codes of distance d=4d=4d=4 when the code is linear over GF(4). In the present paper we review the translation from quantum error-correction to symplectic geometry and study quantum codes in PG(4,4) where we construct complete quantum caps with 20, 29, 30, 32, 33, 34, 36 and 38 points and incomplete quantum caps with 10, 12, 13, 20, 23, 24, 25 and 26 points and we prove the non existence of 11-quantum caps. In particular the quantum caps of sizes 36 and 38 yield positive answers to the existence questions of quantum codes [[36,26,4]][[36,26,4]][[36,26,4]] and [[38,28,4]][[38,28,4]][[38,28,4]] that remained open in the data base \cite{codetable}.
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 inPG(3,9)PG(3,9)PG(3,9)andPG(4,9)PG(4,9)PG(4,9)are constructively proven to exist. Then, according to the theorem that each quantum cap corresponds to a quantum error-correcting code withd=4d=4d=4, 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.