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

IEEE MIT Undergraduate Research Technology Conference (URTC)

Properties and Comparisons of Various Graphs and Their Codes

Andreas Garcia, Layla Jarrahy, Elisaveta Samoylov

Published Oct 11, 2024• 0 citations
Publisher

Abstract

It is established in literature that finding stabilizer quantum error correcting codes (QECCS) is the same as finding self-dual additive codes over the finite field $\mathbb{F}_{4}$ under the Hermitian trace inner product. Additionally, every self-dual additive code can be represented by a graph adjacency matrix. Many selfdual additive codes are constructed from circulant graphs. We introduce new graph code constructions: the Toeplitz Graph, the Multidimensional Toeplitz Graph (MDT), and the Generalized Toeplitz (GT) graph constructions. We consider some of the properties of the Toeplitz and Multidimensional Toeplitz Graphs and compare the Circulant and GT code constructions.

DOI
10.1109/urtc65039.2024.10937552

Related papers

Graph-based classification of self-dual additive codes over finite fields

Lars Eirik Danielsen

Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2. These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operationcorrespond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over F4. In this paper we classify selfdual additive codes over F9, F16, and F25. Assuming that the classical MDSconjecture holds, we are able to classify all self-dual additive MDS codes over F9 by using an extension technique. We prove that the minimum distanceof a self-dual additive code is related to the minimum vertex degree in theassociated graph orbit. Circulant graph codes are introduced, and a computersearch reveals that this set contains many strong codes. We show that some ofthese codes have highly regular graph representations.

arXiv:0801.3773•Advances in Mathematics of Communications•Jan 1, 2009•16 citations

GRAPH-BASED CLASSIFICATION OF SELF-DUAL ADDITIVE CODES OVER FINITE FIELDS

Lars Eirik Danielsen

Abstract. Quantum stabilizer states over Fm can be represented as self-dual additive codes over F m 2. These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over F4. In this paper we classify selfdual additive codes over F9, F16, and F25. Assuming that the classical MDS conjecture holds, we are able to classify all self-dual additive MDS codes over F9 by using an extension technique. We prove that the minimum distance of a self-dual additive code is related to the minimum vertex degree in the associated graph orbit. Circulant graph codes are introduced, and a computer search reveals that this set contains many strong codes. We show that some of these codes have highly regular graph representations. 1.

•Jan 1, 2008•15 citations

Circulant Based Extremal Additive Self-Dual Codes Over>tex<$hboxGF,(4)$>/tex<

Thomas Aaron Gulliver, J.-L. Kim

It is well known that the problem of finding stabilizer quantum-error-correcting codes (QECC) is transformed into the problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product. Our purpose is to classify the extremal additive circulant self-dual codes of lengths up to 15, and construct good codes for lengths 16/spl les/n/spl les/27. We also classify the extremal additive 4-circulant self-dual codes of lengths 4,6,8,12,14, and 16 and most codes of length 10, and construct good codes of even lengths up to 22. Furthermore, we classify the extremal additive bordered 4-circulant self-dual codes of lengths 3,5,7,9,11,13,15, and 17, and construct good codes for lengths 19,21,23, and 25. We give the current status of known extremal (or optimal) additive self-dual codes of lengths 12 to 27.

IEEE Transactions on Information Theory•Feb 1, 2004•27 citations

New quantum codes from metacirculant graphs via self-dual additive $\mathbb{F}_4$-codes

Padmapani Seneviratne, Martianus Frederic Ezerman

We use symplectic self-dual additive codes over $ \mathbb{F}_4 $ obtained from metacirculant graphs to construct, for the first time, $ \left[\kern-0.15em\left[ {\ell, 0, d} \right]\kern-0.15em\right] $ qubit codes with parameters $ (\ell,d) \in \{(78, 20), (90, 21), (91, 22), (93,21),(96,22)\} $. Secondary constructions applied to the qubit codes result in many new qubit codes that perform better than the previous best-known.

Advances in Mathematics of Communications•Jan 12, 2022•1 citation

On the classification of Hermitian self-dual additive codes over GF(9)

Lars Eirik Danielsen

Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. However, these codes have so far received far less interest from coding theorists than self-dual additive codes over GF(4), which correspond to binary quantum codes. Self-dual additive codes over GF(9) have been classified up to length 8, and in this paper we extend the complete classification to codes of length 9 and 10. The classification is obtained by using a new algorithm that combines two graph representations of self-dual additive codes. The search space is first reduced by the fact that every code can be mapped to a weighted graph, and a different graph is then introduced that transforms the problem of code equivalence into a problem of graph isomorphism. By an extension technique, we are able to classify all optimal codes of length 11 and 12. There are 56,005,876 (11,3^11,5) codes and 6493 (12,3^12,6) codes. We also find the smallest codes with trivial automorphism group.

arXiv:1106.2428•Jun 13, 2011•0 citations

Improved Quantum Codes from Metacirculant Graphs via Self-Dual Additive $\mathbb{F}_4$-Codes

Padmapani Seneviratne, Martianus Frederic Ezerman

We use symplectic self-dual additive codes over $\mathbb{F}_4$ obtained from metacirculant graphs to construct, for the first time, $[[\ell, 0, d ]]$ qubit codes with parameters $(\ell,d) \in \{(78, 20), (90, 21), (91, 22), (93,21),(96,21)\}$. Secondary constructions applied to the qubit codes result in many qubit codes that perform better than the previous best-known.

arXiv:2105.12685•May 26, 2021•0 citations
It is established in literature that finding stabilizer quantum error correcting codes (QECCS) is the same as finding self-dual additive codes over the finite field F4\mathbb{F}_{4}F4​ under the Hermitian trace inner product. Additionally, every self-dual additive code can be represented by a graph adjacency matrix. Many selfdual additive codes are constructed from circulant graphs. We introduce new graph code constructions: the Toeplitz Graph, the Multidimensional Toeplitz Graph (MDT), and the Generalized Toeplitz (GT) graph constructions. We consider some of the properties of the Toeplitz and Multidimensional Toeplitz Graphs and compare the Circulant and GT code constructions.
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2. These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operationcorrespond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over F4. In this paper we classify selfdual additive codes over F9, F16, and F25. Assuming that the classical MDSconjecture holds, we are able to classify all self-dual additive MDS codes over F9 by using an extension technique. We prove that the minimum distanceof a self-dual additive code is related to the minimum vertex degree in theassociated graph orbit. Circulant graph codes are introduced, and a computersearch reveals that this set contains many strong codes. We show that some ofthese codes have highly regular graph representations.
Abstract. Quantum stabilizer states over Fm can be represented as self-dual additive codes over F m 2. These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over F4. In this paper we classify selfdual additive codes over F9, F16, and F25. Assuming that the classical MDS conjecture holds, we are able to classify all self-dual additive MDS codes over F9 by using an extension technique. We prove that the minimum distance of a self-dual additive code is related to the minimum vertex degree in the associated graph orbit. Circulant graph codes are introduced, and a computer search reveals that this set contains many strong codes. We show that some of these codes have highly regular graph representations. 1.
Circulant Based Extremal Additive Self-Dual Codes Over>tex<hboxGF,(4)hboxGF,(4)hboxGF,(4)>/tex<
It is well known that the problem of finding stabilizer quantum-error-correcting codes (QECC) is transformed into the problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product. Our purpose is to classify the extremal additive circulant self-dual codes of lengths up to 15, and construct good codes for lengths 16/spl les/n/spl les/27. We also classify the extremal additive 4-circulant self-dual codes of lengths 4,6,8,12,14, and 16 and most codes of length 10, and construct good codes of even lengths up to 22. Furthermore, we classify the extremal additive bordered 4-circulant self-dual codes of lengths 3,5,7,9,11,13,15, and 17, and construct good codes for lengths 19,21,23, and 25. We give the current status of known extremal (or optimal) additive self-dual codes of lengths 12 to 27.
New quantum codes from metacirculant graphs via self-dual additive F4\mathbb{F}_4F4​-codes
Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. However, these codes have so far received far less interest from coding theorists than self-dual additive codes over GF(4), which correspond to binary quantum codes. Self-dual additive codes over GF(9) have been classified up to length 8, and in this paper we extend the complete classification to codes of length 9 and 10. The classification is obtained by using a new algorithm that combines two graph representations of self-dual additive codes. The search space is first reduced by the fact that every code can be mapped to a weighted graph, and a different graph is then introduced that transforms the problem of code equivalence into a problem of graph isomorphism. By an extension technique, we are able to classify all optimal codes of length 11 and 12. There are 56,005,876 (11,3^11,5) codes and 6493 (12,3^12,6) codes. We also find the smallest codes with trivial automorphism group.
Improved Quantum Codes from Metacirculant Graphs via Self-Dual Additive F4\mathbb{F}_4F4​-Codes
We use symplectic self-dual additive codes over F4\mathbb{F}_4F4​ obtained from metacirculant graphs to construct, for the first time, [[ℓ,0,d]][[\ell, 0, d ]][[ℓ,0,d]] qubit codes with parameters (ℓ,d)∈{(78,20),(90,21),(91,22),(93,21),(96,21)}(\ell,d) \in \{(78, 20), (90, 21), (91, 22), (93,21),(96,21)\}(ℓ,d)∈{(78,20),(90,21),(91,22),(93,21),(96,21)}. Secondary constructions applied to the qubit codes result in many qubit codes that perform better than the previous best-known.