Pipelined correlated minimum weight perfect matching of the surface code
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Authors
Date
2023
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
Series
Quantum, Volume 7
Abstract
We describe a pipeline approach to decoding the surface code using minimum weight perfect matching, including taking into account correlations between detection events. An independent no-communication parallelizable processing stage reweights the graph according to likely correlations, followed by another no-communication parallelizable stage for high confidence matching. A later general stage finishes the matching. This is a simplification of previous correlated matching techniques which required a complex interaction between general matching and re-weighting the graph. Despite this simplification, which gives correlated matching a better chance of achieving real-time processing, we find the logical error rate practically unchanged. We validate the new algorithm on the fully fault-tolerant toric, unrotated, and rotated surface codes, all with standard depolarizing noise. We expect these techniques to be applicable to a wide range of other decoders.Description
Funding Information: AP was supported by Google Faculty Research Awards and a Fulbright Senior Researcher Fellowship.
Keywords
Other note
Citation
Paler, A & Fowler, A G 2023, ' Pipelined correlated minimum weight perfect matching of the surface code ', Quantum, vol. 7, 1205 . https://doi.org/10.22331/q-2023-12-12-1205