Fetching the paper…
Reading the bibliography…
Quantum low-density parity-check (LDPC) codes, a class of quantum error correcting codes, are considered a blueprint for scalable quantum circuits.
Low-density parity-check codes
Robert Gallager · 1962
Earlier work this paper cites.
Expander codes
Michael Sipser and Daniel A Spielman · 1996
Earlier work this paper cites.
New sequences of linear time erasure codes approaching the channel capacity
M Amin Shokrollahi · 1999
Earlier work this paper cites.
On expander codes
Gilles Zémor · 2001
Earlier work this paper cites.
LP decoding corrects a constant fraction of errors
Jon Feldman, Tal Malkin, Rocco A Servedio, Cliff Stein, and Martin J Wainwright · 2006
Earlier work this paper cites.
Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength
Jean-Pierre Tillich and Gilles Zémor · 2013
Earlier work this paper cites.
Linear-time decoding of regular expander codes
Michael Viderman · 2013
Earlier work this paper cites.
LP decoding of codes with expansion parameter above 2/3
Michael Viderman · 2013
Earlier work this paper cites.
Quantum expander codes
Anthony Leverrier, Jean-Pierre Tillich, and Gilles Zémor · 2015
Earlier work this paper cites.
Efficient decoding of random errors for quantum expander codes
Omar Fawzi, Antoine Grospellier, and Anthony Leverrier · 2018
Earlier work this paper cites.
Décodage des codes expanseurs quantiques et application au calcul quantique tolérant aux fautes
Antoine Grospellier · 2019
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.
Constant overhead quantum fault tolerance with quantum expander codes
Omar Fawzi, Antoine Grospellier, and Anthony Leverrier · 2020
Cited alongside, same era.
Balanced product quantum codes
Nikolas P Breuckmann and Jens N Eberhardt · 2021
Cited alongside, same era.
Improved decoding of expander codes
Xue Chen, Kuan Cheng, Xin Li, and Minghui Ouyang · 2021
Cited alongside, same era.
Union-find decoders for homological product codes
Good quantum LDPC codes with linear time decoders
Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, and Thomas Vidick · 2022
Later among the works it cites.
Toward a union-find decoder for quantum LDPC codes
Nicolas Delfosse, Vivien Londe, and Michael E Beverland · 2022
Later among the works it cites.
Decodable quantum LDPC codes beyond the n \sqrt{n} distance barrier using high-dimensional expanders
Shai Evra, Tali Kaufman, and Gilles Zémor · 2022
Later among the works it cites.
An efficient decoder for a linear distance quantum LDPC code
Shouzhen Gu, Christopher A Pattison, and Eugene Tang · 2022
Later among the works it cites.
Good quantum LDPC codes with linear time decoder from lossless expanders
Ting-Chun Lin and Min-Hsiu Hsieh · 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Nicolas Delfosse and Matthew B Hastings · 2021
Cited alongside, same era.
Almost-linear time decoding algorithm for topological codes
Nicolas Delfosse and Naomi H Nickerson · 2021
Cited alongside, same era.
Fiber bundle codes: breaking the n 1 / 2 poly log ( n ) n^{1/2}{\rm poly}\log(n) barrier for quantum LDPC codes
Matthew B Hastings, Jeongwan Haah, and Ryan O’Donnell · 2021
Cited alongside, same era.
New cosystolic expanders from tensors imply explicit quantum LDPC codes with ω ( n log k ( n ) ) \omega(\sqrt{n}\log^{k}(n)) distance
Tali Kaufman and Ran J Tessler · 2021
Cited alongside, same era.
Fast erasure decoder for a class of quantum LDPC codes
Nicholas Connolly, Vivien Londe, Anthony Leverrier, and Nicolas Delfosse · 2022
Cited alongside, same era.
Later among the works it cites.
Quantum tanner codes
Anthony Leverrier and Gilles Zémor · 2022
Later among the works it cites.
Asymptotically good quantum and locally testable classical LDPC codes
Pavel Panteleev and Gleb Kalachev · 2022
Later among the works it cites.
Decoding quantum Tanner codes
Anthony Leverrier and Gilles Zémor · 2023
Closest in time.
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
Anthony Leverrier and Gilles Zémor · 2023
Closest in time.