Symplectic Isometries of Stabilizer Codes

07/24/2018
by   Tefjol Pllaha, et al.
0

In this paper we study the equivalence of quantum stabilizer codes via symplectic isometries of stabilizer codes. We define monomially and symplectically equivalent stabilizer codes and determine how different the two notions can be. Further, we show that to monomial maps correspond local Clifford operators. We relate the latter with the LU-LC Conjecture.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/16/2021

The equivalence of linear codes implies semi-linear equivalence

We prove that if two linear codes are equivalent then they are semi-line...
research
05/15/2021

The equivalence between correctability of deletions and insertions of separable states in quantum codes

In this paper, we prove the equivalence of inserting separable quantum s...
research
04/22/2019

Steane-Enlargement of Quantum Codes from the Hermitian Curve

In this paper, we study the construction of quantum codes by applying St...
research
08/30/2021

On a family of linear MRD codes with parameters [8×8,16,7]_q

In this paper we consider a family ℱ of 16-dimensional 𝔽_q-linear rank m...
research
04/09/2023

A Proof of a Conjecture About a Class of Near Maximum Distance Separable Codes

In this paper, we completely determine the number of solutions to Tr^q^2...
research
07/03/2020

New Classes of Quantum Codes Associated with Surface Maps

If the cyclic sequences of face types at all vertices in a map are the s...
research
05/12/2018

Hindering reaction attacks by using monomial codes in the McEliece cryptosystem

In this paper we study recent reaction attacks against QC-LDPC and QC-MD...

Please sign up or login with your details

Forgot password? Click here to reset