Fetching the paper…
Reading the bibliography…
In this work, we introduce a fast implementation of the minimum-weight perfect matching (MWPM) decoder, the most widely used decoder for several important families of quantum error correcting codes, including surface codes.
“The Factorization of Linear Graphs”
W.. Tutte · 1947
Earlier work this paper cites.
“Two theorems in graph theory”
Claude Berge · 1957
Earlier work this paper cites.
“Maximum matching and a polyhedron with 0,1-vertices”
Jack Edmonds · 1965
Earlier work this paper cites.
“Paths, Trees, and Flowers”
Jack Edmonds · 1965
Earlier work this paper cites.
“Matching, Euler tours and the Chinese postman”
Jack Edmonds and Ellis. Johnson · 1973
Earlier work this paper cites.
“On the computational complexity of Ising spin glass models”
F Barahona · 1982
Earlier work this paper cites.
“Efficient algorithms for finding maximal matching in graphs”
Zvi Galil · 1983
Earlier work this paper cites.
“Coincidence of critical points in percolation problems”
Mikhail Menshikov · 1986
Earlier work this paper cites.
“Faster algorithms for the shortest path problem”
Ravindra Ahuja, Kurt Mehlhorn, James Orlin and Robert Tarjan · 1990
Earlier work this paper cites.
“The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout”
Piotr Berman, Andrew. Kahng, Devendra Vidhani and Alexander Zelikovsky · 1999
Earlier work this paper cites.
“Topological quantum memory”
Eric Dennis, Alexei Kitaev, Andrew Landahl and John Preskill · 2002
Earlier work this paper cites.
“Operator quantum error-correcting subsystems for self-correcting quantum memories”
Dave Bacon · 2006
Earlier work this paper cites.
“Topological Quantum Distillation”
H. Bombin and M.. Martin-Delgado · 2006
Earlier work this paper cites.
“Understanding and using linear programming”
Jiri Matoušek and Bernd Gärtner · 2007
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.
“Constructions and noise threshold of topological subsystem codes”
Martin Suchara, Sergey Bravyi and Barbara Terhal · 2011
Earlier work this paper cites.
“Towards Practical Classical Processing for the Surface Code”
Austin. Fowler, Adam. Whiteside and Lloyd.. Hollenberg · 2012
Earlier work this paper cites.
“Towards practical classical processing for the surface code: Timing analysis”
Austin. Fowler, Adam. Whiteside and Lloyd.. Hollenberg · 2012
Earlier work this paper cites.
“Subsystem surface codes with three-qubit check operators”
Sergey Bravyi, Guillaume Duclos-Cianci, David Poulin and Martin Suchara · 2013
Earlier work this paper cites.
“Optimal complexity correction of correlated errors in the surface code”
Austin Fowler · 2013
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.
“Minimum weight perfect matching of fault-tolerant topological quantum error correction in average O(1) parallel time”
Austin. Fowler · 2015
Cited alongside, same era.
“Quantum error correction for quantum memories”
Barbara. Terhal · 2015
Cited alongside, same era.
“Constructions and Noise Threshold of Hyperbolic Surface Codes”
Nikolas. Breuckmann and Barbara. Terhal · 2016
Cited alongside, same era.
“Neural Decoder for Topological Codes”
Giacomo Torlai and Roger. Melko · 2017
“AFS: Accurate, Fast, and Scalable Error-Decoding for Fault-Tolerant Quantum Computers”
Poulami Das, Christopher. Pattison, Srilatha Manne, Douglas. Carmean, Krysta. Svore, Moinuddin Qureshi and Nicolas Delfosse · 2022
Later among the works it cites.
“PyMatching: A Python Package for Decoding Quantum Codes with Minimum-Weight Perfect Matching”
Oscar Higgott · 2022
Later among the works it cites.
“Scalable Neural Decoder for Topological Surface Codes”
Kai Meinerz, Chae-Yeun Park and Simon Trebst · 2022
Later among the works it cites.
“Data for ”Suppressing quantum errors by scaling a surface code logical qubit””
Google Team · 2022
Later among the works it cites.
“An interpretation of Union-Find Decoder on Weighted Graphs”, 2022
Yue Wu, Namitha Liyanage and Lin Zhong · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Combinatorial optimization”
Bernhard Korte and Jens Vygen · 2018
Cited alongside, same era.
“Optimization of the surface code design for Majorana-based qubits”
Rui Chao, Michael. Beverland, Nicolas Delfosse and Jeongwan Haah · 2020
Cited alongside, same era.
“Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel”
Nicolas Delfosse and Gilles Zémor · 2020
Cited alongside, same era.
“Decorrelated Depolarization” Accessed: 2021-10-04, https://algassert.com/post/2001 , 2020
Craig Gidney · 2020
Cited alongside, same era.
“Fault-tolerant weighted union-find decoding on the toric code”
Shilin Huang, Michael Newman and Kenneth. Brown · 2020
Cited alongside, same era.
“Tailoring surface codes: Improvements in quantum error correction with biased noise” (qecsim: https://github.com/qecsim/qecsim ), 2020
David Tuckett · 2020
Cited alongside, same era.
Yue Wu · 2022
Later among the works it cites.
“Suppressing quantum errors by scaling a surface code logical qubit”
Google AI · 2023
Closest in time.
“Conservation Laws and Quantum Error Correction: Toward a Generalized Matching Decoder”
Benjamin. Brown · 2023
Closest in time.
“New circuits and an open source decoder for the color code”, 2023
Craig Gidney and Cody Jones · 2023
Closest in time.
“Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes”
Oscar Higgott, Thomas. Bohdanowicz, Aleksander Kubica, Steven. Flammia and Earl. Campbell · 2023
Closest in time.
“Efficient color code decoders in d ≥ 2 d\geq 2 dimensions from toric code decoders”
Aleksander Kubica and Nicolas Delfosse · 2023
Closest in time.
“Scalable Quantum Error Correction for Surface Codes using FPGA”
Namitha Liyanage, Yue Wu, Alexander Deters and Lin Zhong · 2023
Closest in time.
“Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics”
Matt McEwen, Dave Bacon and Craig Gidney · 2023
Closest in time.
“Parallel window decoding enables scalable fault tolerant quantum computation”
Luka Skoric, Dan. Browne, Kenton. Barnes, Neil. Gillespie and Earl. Campbell · 2023
Closest in time.
“Demonstrating multi-round subsystem quantum error correction using matching and maximum likelihood decoders”
Neereja Sundaresan, Theodore. Yoder, Youngseok Kim, Muyuan Li, Edward. Chen, Grace Harper, Ted Thorbeck, Andrew. Cross, Antonio. Córcoles and Maika Takita · 2023
Closest in time.
“Scalable Surface-Code Decoders with Parallelization in Time”
Xinyu Tan, Fang Zhang, Rui Chao, Yaoyun Shi and Jianxin Chen · 2023
Closest in time.
“Fusion Blossom: Fast MWPM Decoders for QEC”
Yue Wu and Lin Zhong · 2023
Closest in time.
“Designing fault-tolerant circuits using detector error models”, 2024
Peter-Jan.. Derks, Alex Townsend-Teague, Ansgar. Burchards and Jens Eisert · 2024
Closest in time.