2023
DOI: 10.1016/j.ffa.2022.102138
|View full text |Cite
|
Sign up to set email alerts
|

Stabilizer quantum codes defined by trace-depending polynomials

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 30 publications
0
2
0
Order By: Relevance
“…There is an extensive study of quantum error-correcting codes, see for example the papers [ 3 , 4 , 11 , 12 , 31 , 33 , 52 ] for the binary case and [ 5 , 6 , 9 , 14 , 21 , 24 , 27 , 32 , 35 , 40 , 41 , 47 , 51 ] for the general case. Many of the known quantum error-correcting codes are stabilizer codes.…”
Section: Introductionmentioning
confidence: 99%
“…There is an extensive study of quantum error-correcting codes, see for example the papers [ 3 , 4 , 11 , 12 , 31 , 33 , 52 ] for the binary case and [ 5 , 6 , 9 , 14 , 21 , 24 , 27 , 32 , 35 , 40 , 41 , 47 , 51 ] for the general case. Many of the known quantum error-correcting codes are stabilizer codes.…”
Section: Introductionmentioning
confidence: 99%
“…Many of these codes satisfy K = q k , for some nonnegative integer k, and then their parameters are expressed as [[n, k, d]] q ; abusing the notation we say that k is the dimension of these codes. QECCs were first introduced in the binary case [10,22,9,4,5] and later in the general case [7,3,30,1,32,11,17,18], where we have cited only some references of a vast literature on the subject. QECCs in the nonbinary case are convenient for fault-tolerant quantum computation [43,31,23,36].…”
Section: Introductionmentioning
confidence: 99%