2009
DOI: 10.48550/arxiv.0907.1708
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Graphical algorithms and threshold error rates for the 2d colour code

Abstract: Recent work on fault-tolerant quantum computation making use of topological error correction shows great potential, with the 2d surface code possessing a threshold error rate approaching 1% [1,2]. However, the 2d surface code requires the use of a complex state distillation procedure to achieve universal quantum computation. The colour code of [3] is a related scheme partially solving the problem, providing a means to perform all Clifford group gates transversally. We review the colour code and its error corre… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

1
17
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(18 citation statements)
references
References 21 publications
1
17
0
Order By: Relevance
“…Interestingly enough, this type of mapping can be made more general and applied to TCCs yielding the same error threshold [28] while maintaining its enhanced quantum capabilities [29,30]. These results have been confirmed using different types of computation methods [31][32][33][34][35]. It is also possible to carry out certain computations by changing the code geometry over time, something called 'code deformation' [12,36,37] that allows us to perform quantum computation in a different way.…”
Section: Introductionmentioning
confidence: 71%
“…Interestingly enough, this type of mapping can be made more general and applied to TCCs yielding the same error threshold [28] while maintaining its enhanced quantum capabilities [29,30]. These results have been confirmed using different types of computation methods [31][32][33][34][35]. It is also possible to carry out certain computations by changing the code geometry over time, something called 'code deformation' [12,36,37] that allows us to perform quantum computation in a different way.…”
Section: Introductionmentioning
confidence: 71%
“…Decoding algorithms are typically designed to run efficiently on a classical computer, but there is generally no guarantee that the noise and recovery processes should be classically simulable. Because of this, almost all of the sizable research effort on active quantum error correction for topological systems has focused on the case of abelian anyons [2,[10][11][12][13][14][15][16][17][18][19][20][21][22][23][24], which can be efficiently simulated due to the fact that they cannot be used for quantum computation.…”
mentioning
confidence: 99%
“…are possible while preserving a high error threshold [13] (in comparison to the Kitaev model [1]). This result has been obtained numerically after mapping the error correction (q = 0) for TCCs onto a random three-body Ising model on a triangular lattice [13]; later confirmed by other numerical methods [14,15,16]. It is, however, unclear if quantum computations on TCCs can be performed reliably in the presence of faulty measurements (q = 0).…”
Section: Introductionmentioning
confidence: 61%