2023
DOI: 10.22331/q-2023-07-06-1048
|View full text |Cite
|
Sign up to set email alerts
|

Counting stabiliser codes for arbitrary dimension

Abstract: In this work, we compute the number of [[n,k]]d stabilizer codes made up of d-dimensional qudits, for arbitrary positive integers d. In a seminal work by Gross \cite{Gross2006} the number of [[n,k]]d stabilizer codes was computed for the case when d is a prime (or the power of a prime, i.e., d=pm, but when the qudits are Galois-qudits). The proof in \cite{Gross2006} is inapplicable to the non-prime case. For our proof, we introduce a group structure to [[n,k]]d codes, and use this in conjunction with the Chine… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 52 publications
0
0
0
Order By: Relevance