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

Analytic asymptotic performance of topological codes

Abstract: Topological quantum error correction codes are extremely practical, typically requiring only a 2-D lattice of qubits with tunable nearest neighbor interactions yet tolerating high physical error rates p. It is computationally expensive to simulate the performance of such codes at low p, yet this is a regime we wish to study as low physical error rates lead to low qubit overhead. We present a very general method of analytically estimating the low p performance of the most promising class of topological codes. O… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
24
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
10

Relationship

1
9

Authors

Journals

citations
Cited by 20 publications
(26 citation statements)
references
References 43 publications
(32 reference statements)
2
24
0
Order By: Relevance
“…[64][65][66]. In our case, one can find that this function provides a good fit to our numerical data.…”
Section: Appendix F: the Error Model And Charge Tunnelling Errorssupporting
confidence: 73%
“…[64][65][66]. In our case, one can find that this function provides a good fit to our numerical data.…”
Section: Appendix F: the Error Model And Charge Tunnelling Errorssupporting
confidence: 73%
“…This can be translated to a lower bound on the decay rate α, although the bound is not expected to be tight. A different version of the method, proposed by Fowler [20], enables exact computation of P L in the asymptotic regime of small error rates p. In this regime the dominant contribution to P L comes from minimum-weight uncorrectable errors that span d/2 physical locations [47]. Accordingly, if the limit p → 0 is taken for a fixed code distance d, one can use an asymptotic formula P L = A d p d/2 , where A d is a constant coefficient.…”
Section: Introductionmentioning
confidence: 99%
“…For simplicity, our simulations are run with a periodic north-south boundary condition, which suffices for threshold comparison [41]. However for completeness, we summarize the decoder on lattices with boundary, along with our modifications to account for asymmetric error rates.…”
Section: Asymmetrically-weighted Union-find Decodingmentioning
confidence: 99%