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:2105.12685

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

Padmapani Seneviratne, Martianus Frederic Ezerman

Published May 26, 2021• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2105.12685

Related papers

Improved Quantum Codes from Metacirculant Graphs via Self-Dual Additive 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.

•May 26, 2021•1 citation

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

New Qutrit Codes from Pure and Bordered Multidimensional Circulant Construction

Padmapani Seneviratne, Hannah Cuff, Alexandra Koletsos +2 more

We use multidimensional circulant approach to construct new qutrit stabilizer $\dsb{\ell, 0, d}$ codes with parameters $(\ell, d) \in \{(51, 16), (52, 16), (54, 17), (55, 17), (57, 17)\}$ through symplectic self-dual additive codes over $\F_9$. In addition to these five new codes, we use bordered construction to derive two more qutrit codes with parameters $(\ell, d) \in \{(53, 16), (56, 17)\}$ that improve upon previously best known parameters.

arXiv:2312.12288•Dec 19, 2023•0 citations

Properties and Comparisons of Various Graphs and Their Codes

Andreas Garcia, Layla Jarrahy, Elisaveta Samoylov

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.

IEEE MIT Undergraduate Research Technology Conference (URTC)•Oct 11, 2024•0 citations

A method for constructing quaternary Hermitian self-dual codes and an application to quantum codes

Masaaki Harada

Abstract We introduce quaternary modified four $$\mu $$ μ -circulant codes as a modification of four circulant codes. We give basic properties of quaternary modified four $$\mu $$ μ -circulant Hermitian self-dual codes. We also construct quaternary modified four $$\mu $$ μ -circulant Hermitian self-dual codes having large minimum weights. Two quaternary Hermitian self-dual [56, 28, 16] codes are constructed for the first time. These codes improve the previously known lower bound on the largest minimum weight among all quaternary (linear) [56, 28] codes. In addition, these codes imply the existence of a quantum [[56, 0, 16]] code.

arXiv:2401.15265•Designs Codes and Cryptography•May 21, 2024•1 citation

Polynomial representation of additive cyclic codes and new quantum codes

Reza Dastbasteh, Khalil Shivji

We give a polynomial representation for additive cyclic codes over $ \mathbb{F}_{p^2} $. This representation will be applied to uniquely present each additive cyclic code by at most two generator polynomials. We determine the generator polynomials of all different additive cyclic codes. A minimum distance lower bound for additive cyclic codes will also be provided using linear cyclic codes over $ \mathbb{F}_p $. We classify all the symplectic self-dual, self-orthogonal, and nearly self-orthogonal additive cyclic codes over $ \mathbb{F}_{p^2} $. Finally, we present ten record-breaking binary quantum codes after applying a quantum construction to self-orthogonal and nearly self-orthogonal additive cyclic codes over $ \mathbb{F}_{4} $.

arXiv:2301.00753•Advances in Mathematics of Communications•Oct 11, 2023•7 citations
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.
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.
New quantum codes from metacirculant graphs via self-dual additive F4\mathbb{F}_4F4​-codes
We use multidimensional circulant approach to construct new qutrit stabilizer $\dsb{\ell, 0, d}$ codes with parameters (ℓ,d)∈{(51,16),(52,16),(54,17),(55,17),(57,17)}(\ell, d) \in \{(51, 16), (52, 16), (54, 17), (55, 17), (57, 17)\}(ℓ,d)∈{(51,16),(52,16),(54,17),(55,17),(57,17)} through symplectic self-dual additive codes over $\F_9$. In addition to these five new codes, we use bordered construction to derive two more qutrit codes with parameters (ℓ,d)∈{(53,16),(56,17)}(\ell, d) \in \{(53, 16), (56, 17)\}(ℓ,d)∈{(53,16),(56,17)} that improve upon previously best known parameters.
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.
Abstract We introduce quaternary modified four μ\mu μ μ -circulant codes as a modification of four circulant codes. We give basic properties of quaternary modified four μ\mu μ μ -circulant Hermitian self-dual codes. We also construct quaternary modified four μ\mu μ μ -circulant Hermitian self-dual codes having large minimum weights. Two quaternary Hermitian self-dual [56, 28, 16] codes are constructed for the first time. These codes improve the previously known lower bound on the largest minimum weight among all quaternary (linear) [56, 28] codes. In addition, these codes imply the existence of a quantum [[56, 0, 16]] code.
We give a polynomial representation for additive cyclic codes over $ \mathbb{F}_{p^2} $. This representation will be applied to uniquely present each additive cyclic code by at most two generator polynomials. We determine the generator polynomials of all different additive cyclic codes. A minimum distance lower bound for additive cyclic codes will also be provided using linear cyclic codes over $ \mathbb{F}_p $. We classify all the symplectic self-dual, self-orthogonal, and nearly self-orthogonal additive cyclic codes over $ \mathbb{F}_{p^2} $. Finally, we present ten record-breaking binary quantum codes after applying a quantum construction to self-orthogonal and nearly self-orthogonal additive cyclic codes over $ \mathbb{F}_{4} $.