Fetching the paper…
Reading the bibliography…
Matching algorithms can be used for identifying errors in quantum systems, being the most famous the Blossom algorithm.
Decoding surface code with a distributed neural network based decoder
Savvas Varsamopoulos, Koen Bertels, and Carmen G Almudever · 1901
Earlier work this paper cites.
Paths, trees, and flowers
Jack Edmonds · 1965
Earlier work this paper cites.
Stabilizer Codes and Quantum Error Correction
Daniel Gottesman · 1997
Earlier work this paper cites.
Quantum codes on a lattice with boundary
Sergey B Bravyi and A Yu Kitaev · 1998
Earlier work this paper cites.
Projective plane and planar quantum codes
Michael H Freedman and David A Meyer · 2001
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A.Yu. Kitaev · 2003
Earlier work this paper cites.
Optimal resources for topological two-dimensional stabilizer codes: Comparative study
H Bombin and Miguel A Martin-Delgado · 2007
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.
Quantum measurements and gates by code deformation
H Bombin and M A Martin-Delgado · 2009
Earlier work this paper cites.
Blossom V: a new implementation of a minimum cost perfect matching algorithm
Vladimir Kolmogorov · 2009
Earlier work this paper cites.
Fast decoders for topological quantum codes
Guillaume Duclos-Cianci and David Poulin · 2010
Earlier work this paper cites.
Surface code quantum computing with error rates over 1%
David S. Wang, Austin G. Fowler, and Lloyd C. L. Hollenberg · 2011
Cited alongside, same era.
Clifford gates by code deformation
H Bombin · 2011
Cited alongside, same era.
Surface code quantum computing by lattice surgery
Clare Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter · 2012
Cited alongside, same era.
On the hardness of decoding quantum stabilizer codes under the depolarizing channel
Kao-Yueh Kuo and Chung-Chin Lu · 2012
Cited alongside, same era.
Strong resilience of topological codes to depolarization
H. Bombin, Ruben S. Andrist, Masayuki Ohzeki, Helmut G. Katzgraber, and M. A. Martin-Delgado · 2012
Cited alongside, same era.
High threshold error correction for the surface code
James R. Wootton and Daniel Loss · 2012
Cited alongside, same era.
Density-matrix simulation of small surface codes under current and projected experimental noise
T. E. O’Brien, B. Tarasinski, and L. DiCarlo · 2017
Later among the works it cites.
Almost-linear time decoding algorithm for topological codes
Nicolas Delfosse and Naomi H. Nickerson · 2017
Later among the works it cites.
Neural decoder for topological codes
Giacomo Torlai and Roger G. Melko · 2017
Later among the works it cites.
Deep neural network probabilistic decoder for stabilizer codes
Stefan Krastanov and Liang Jiang · 2017
Later among the works it cites.
Scalable quantum circuit and control for a superconducting surface code
R. Versluis, S. Poletto, N. Khammassi, B. Tarasinski, N. Haider, D. J. Michalak, A. Bruno, K. Bertels, and L. DiCarlo · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Optimal complexity correction of correlated errors in the surface code
A. G. Fowler · 2013
Cited alongside, same era.
Quantum Error Correction
Daniel A. Lidar and Todd A. Brun · 2013
Cited alongside, same era.
A.G. Fowler · 2014
Cited alongside, same era.
Efficient algorithms for maximum likelihood decoding in the surface code
Sergey Bravyi, Martin Suchara, and Alexander Vargo · 2014
Cited alongside, same era.
A heterogeneous quantum computer architecture
X Fu, L Riesebos, L Lao, CG Almudever, F Sebastiano, R Versluis, E Charbon, and K Bertels · 2016
Cited alongside, same era.
An experimental microarchitecture for a superconducting quantum processor
X Fu, M. A. Rol, C. C. Bultink, J. van Someren, N. Khammassi, I. Ashraf, R. F. L. Vermeulen, J. C. de Sterke, W. J. Vlothuizen, R. N. Schouten, C. G. Almudever, L. DiCarlo, and K. Bertels · 2017
Cited alongside, same era.
Paul Baireuther, Thomas E. O’Brien, Brian Tarasinski, and Carlo W. J. Beenakker · 2018
Closest in time.
Scalable neural network decoders for higher dimensional quantum codes
Nikolas P. Breuckmann and Xiaotong Ni · 2018
Closest in time.
Neural network decoders for large-distance 2d toric codes
Xiaotong Ni · 2018
Closest in time.
Advantages of versatile neural-network decoding for topological codes
M. Maskara, A. Kubica, and T. Jochym-O’Connor · 2019
Closest in time.
Neural belief-propagation decoders for quantum error-correcting codes
Ye-Hua Liu and David Poulin · 2019
Closest in time.
Decoding small surface codes with feedforward neural networks
Savvas Varsamopoulos, Ben Criger, and Koen Bertels · 2058
Closest in time.
Deep neural decoders for near term fault-tolerant experiments
Christopher Chamberland and Pooya Ronagh · 2058
Closest in time.