Pipelined correlated minimum weight perfect matching of the surface code
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.
- “Quantum codes on a lattice with boundary” (1998). arXiv:quant-ph/9811052.
- “Topological quantum memory”. J. Math. Phys. 43, 4452–4505 (2002). url: https://doi.org/10.1063/1.1499754.
- “Fault-tolerant quantum computation with high threshold in two dimensions”. Phys. Rev. Lett. 98, 190504 (2007).
- “Topological fault-tolerance in cluster state quantum computation”. New J. Phys. 9, 199 (2007). url: https://doi.org/10.1088/1367-2630/9/6/199.
- “Surface codes: Towards practical large-scale quantum computation”. Phys. Rev. A 86, 032324 (2012). url: https://doi.org/10.1103/PhysRevA.86.032324.
- “Low overhead quantum computation using lattice surgery” (2019). arXiv:1808.06709.
- D. Litinski. “A game of surface codes: Large-scale quantum computing with lattice surgery”. Quantum 3, 128 (2019).
- “Flexible layout of surface code computations using autoccz states” (2019). arXiv:1905.08916.
- “Improved fault-tolerant quantum simulation of condensed-phase correlated electrons via trotterization”. Quantum 4, 296 (2020).
- “Optimal error correction in topological subsystem codes”. Phys. Rev. A 85, 050302 (2012).
- “Fault-tolerant renormalization group decoder for abelian topological codes” (2013). arXiv:1304.6100.
- “Efficient markov chain monte carlo algorithm for the surface code”. Phys. Rev. A 89, 022326 (2014).
- James Wootton. “A simple decoder for topological codes”. Entropy 17, 1946–1957 (2015).
- Austin G. Fowler. “Optimal complexity correction of correlated errors in the surface code” (2013). arXiv:1310.0863.
- “Neural network decoder for topological color codes with circuit level noise”. New J. Phys 21, 013003 (2019). url: 10.1088/1367-2630/aaf29e.
- “Almost-linear time decoding algorithm for topological codes”. Quantum 5, 595 (2021).
- “Decoding algorithms for surface codes” (2023). arXiv:2307.14989.
- Jack Edmonds. “Paths, trees, and flowers”. Canadian Journal of Mathematics 17, 449–467 (1965).
- J. Edmonds. “Maximum matching and a polyhedron with 0,1-vertices”. J. Res. Nat. Bur. Standards 69B, 125–130 (1965).
- Oscar Higgott. “Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching”. ACM Transactions on Quantum Computing3 (2022).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
