Show Paper arXiv Publisher

Quick Navigation

Overview Topics Abstract Paper Tools References Reactions Discussion Publication Related

Topics

Quantum Error Correction Fault Tolerance Quantum Machine Learning

New self-dual additive $\mathbb{F}_4$-codes constructed from circulant graphs

arXiv
Authors: Markus Grassl, Masaaki Harada

Year

2015

Paper ID

27212

Status

Preprint

Abstract Read

~2 min

Abstract Words

40

Citations

N/A

Abstract

In order to construct quantum $[[n,0,d]]$ codes for $(n,d)=(56,15)$, $(57,15)$, $(58,16)$, $(63,16)$, $(67,17)$, $(70,18)$, $(71,18)$, $(79,19)$, $(83,20)$, $(87,20)$, $(89,21)$, $(95,20)$, we construct self-dual additive $\mathbb{F}_4$-codes of length $n$ and minimum weight $d$ from circulant graphs. The quantum codes with these parameters are constructed for the first time.

Paper Tools

Show Paper arXiv Publisher Compare Add to Reading List

References & Citation Signals

[1] DOI https://doi.org/arXiv:1509.04846 [2] arXiv https://arxiv.org/abs/1509.04846 [3] Publisher https://arxiv.org/abs/1509.04846

Local Citation Graph (Related-Paper Links)

Current Paper #27212 #35390 Clustered error correction of c... #35351 On classical and quantum error-... #35400 Building a spin quantum bit reg... #35396 Fault tolerance with noisy and ...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.