2020
DOI: 10.1103/physreva.102.032411
|View full text |Cite
|
Sign up to set email alerts
|

Determination of the semion code threshold using neural decoders

Abstract: We compute the error threshold for the semion code, the companion of the Kitaev toric code with the same gauge symmetry group Z 2 . The application of statistical mechanical mapping methods is highly discouraged for the semion code, since the code is non-Pauli and non-Calderbank-Shor-Steane (CSS). Thus, we use machine learning methods, taking advantage of the near-optimal performance of some neural network decoders: multilayer perceptrons and convolutional neural networks (CNNs). We find the values p eff = 9.5… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
11
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 15 publications
(11 citation statements)
references
References 49 publications
0
11
0
Order By: Relevance
“…A first step in this direction has been taken in Ref. [32] using a neural network decoder for their semion code. Although they did not find substantial evidence of increased performance compared to the toric code, it is far from clear whether there does not exist a better decoder tailored to the exotic string operators and what can be achieved with Stabilizer codes implementing other topological orders -like the twisted color code introduced in Sec.…”
Section: Discussionmentioning
confidence: 99%
“…A first step in this direction has been taken in Ref. [32] using a neural network decoder for their semion code. Although they did not find substantial evidence of increased performance compared to the toric code, it is far from clear whether there does not exist a better decoder tailored to the exotic string operators and what can be achieved with Stabilizer codes implementing other topological orders -like the twisted color code introduced in Sec.…”
Section: Discussionmentioning
confidence: 99%
“…which can get c(Z P ) [35]. For logical quantum state | G E 〉, suppose G is represented as a logical subspace, g is represented as an eigenvalue, and the eigenvalue is divided into +1 and −1, +1 represents a vertex operator, and −1 represents a plaquette operator, when X b acts on the logical quantum state | G E 〉:…”
Section: Detect and Correct Errorsmentioning
confidence: 99%
“…When the physical error rate of the logical qubit is better than that of the physical qubit, it is called the pseudo-threshold. We encode the physical qubits with different code distances into logical qubits and obtain the decoding threshold by suppressing the logical error rates [6]. We need to infinitely approach the pseudo-threshold to the decoding threshold to achieve the best fault-tolerant effect.…”
Section: Introductionmentioning
confidence: 99%