Fetching the paper…
Reading the bibliography…
We describe a pipeline approach to decoding the surface code using minimum weight perfect matching, including taking into account correlations between detection events.
“Flexible layout of surface code computations using autoccz states” (2019)
Craig Gidney and Austin G. Fowler · 1905
Earlier work this paper cites.
“Paths, trees, and flowers”
Jack Edmonds · 1965
Earlier work this paper cites.
“Maximum matching and a polyhedron with 0,1-vertices”
J. Edmonds · 1965
Earlier work this paper cites.
“Quantum codes on a lattice with boundary” (1998)
S. B. Bravyi and A. Yu. Kitaev · 1998
Earlier work this paper cites.
“Topological quantum memory”
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill · 2002
Earlier work this paper cites.
“Fault-tolerant quantum computation with high threshold in two dimensions”
Robert Raussendorf and Jim Harrington · 2007
Earlier work this paper cites.
“Topological fault-tolerance in cluster state quantum computation”
R. Raussendorf, J. Harrington, and K. Goyal · 2007
Earlier work this paper cites.
“Surface codes: Towards practical large-scale quantum computation”
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland · 2012
Cited alongside, same era.
“Optimal error correction in topological subsystem codes”
Ruben S. Andrist, H. Bombin, Helmut G. Katzgraber, and M. A. Martin-Delgado · 2012
Cited alongside, same era.
“Fault-tolerant renormalization group decoder for abelian topological codes” (2013)
Guillaume Duclos-Cianci and David Poulin · 2013
Cited alongside, same era.
“Optimal complexity correction of correlated errors in the surface code” (2013)
Austin G. Fowler · 2013
Cited alongside, same era.
“Efficient markov chain monte carlo algorithm for the surface code”
Adrian Hutter, James R. Wootton, and Daniel Loss · 2014
Cited alongside, same era.
“A game of surface codes: Large-scale quantum computing with lattice surgery”
D. Litinski · 2019
Later among the works it cites.
“Neural network decoder for topological color codes with circuit level noise”
P. Baireuther, M. D. Caio, B. Criger, C. W. J. Beenakker, and T. E. O’Brien · 2019
Later among the works it cites.
“Improved fault-tolerant quantum simulation of condensed-phase correlated electrons via trotterization”
I. D. Kivlichan, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, Wei Sun, Zhang Jiang, N. Rubin, A. G. Fowler, A. Aspuru-Guzik, H. Neven, and R. Babbush · 2020
Later among the works it cites.
“Almost-linear time decoding algorithm for topological codes”
Nicolas Delfosse and Naomi H. Nickerson · 2021
Later among the works it cites.
“Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching”
Oscar Higgott · 2022
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“A simple decoder for topological codes”
James Wootton · 2015
Cited alongside, same era.
“Low overhead quantum computation using lattice surgery” (2019)
Austin G. Fowler and Craig Gidney · 2019
Cited alongside, same era.
Antonio deMarti iOlius, Patricio Fuentes, Román Orús, Pedro M. Crespo, and Josu Etxezarreta Martinez · 2023
Closest in time.