Fetching the paper…
Reading the bibliography…
Unlike the surface code, quantum low-density parity-check (QLDPC) codes can have a finite encoding rate, potentially lowering the error correction overhead.
Good quantum error-correcting codes exist
A Robert Calderbank and Peter W Shor · 1996
Earlier work this paper cites.
Multiple-particle interference and quantum error correction
Andrew Steane · 1996
Earlier work this paper cites.
Quantum computations: algorithms and error correction
A Yu Kitaev · 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.
Z2-systolic freedom and quantum codes
Michael H Freedman, David A Meyer, and Feng Luo · 2002
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
Earlier work this paper cites.
A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
Sergey Bravyi and Barbara Terhal · 2009
Earlier work this paper cites.
Tradeoffs for reliable quantum information storage in 2d systems
Sergey Bravyi, David Poulin, and Barbara Terhal · 2010
Earlier work this paper cites.
Fault-tolerant quantum computing with color codes
Andrew J Landahl, Jonas T Anderson, and Patrick R Rice · 2011
Earlier work this paper cites.
Surface codes: Towards practical large-scale quantum computation
Austin G Fowler, Matteo Mariantoni, John M Martinis, and Andrew N Cleland · 2012
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.
Fault-tolerant quantum computation with constant overhead
Daniel Gottesman · 2013
Earlier work this paper cites.
Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
Larry Guth and Alexander Lubotzky · 2014
Earlier work this paper cites.
Low-distance surface codes under realistic quantum noise
Yu Tomita and Krysta M Svore · 2014
Earlier work this paper cites.
Quantum expander codes
Anthony Leverrier, Jean-Pierre Tillich, and Gilles Zémor · 2015
Cited alongside, same era.
Constructions and noise threshold of hyperbolic surface codes
Nikolas P Breuckmann and Barbara M Terhal · 2016
Cited alongside, same era.
Efficient decoding of random errors for quantum expander codes
Omar Fawzi, Antoine Grospellier, and Anthony Leverrier · 2018
Cited alongside, same era.
Numerical study of hypergraph product codes
Antoine Grospellier and Anirudh Krishna · 2018
Cited alongside, same era.
Golden codes: quantum LDPC codes built from regular tessellations of hyperbolic 4-manifolds
Vivien Londe and Anthony Leverrier · 2019
Cited alongside, same era.
Decoding across the quantum low-density parity-check code landscape
Joschka Roffe, David R White, Simon Burton, and Earl Campbell · 2020
Quantifying nonlocality: how outperforming local quantum codes is expensive
Nouédyn Baspin and Anirudh Krishna · 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.
Anthony Leverrier and Gilles Zémor · 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
Later among the works it cites.
Reshape: A decoder for hypergraph product codes
Armanda O Quintavalle and Earl T Campbell · 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.
Fiber bundle codes: Breaking the n 1 / 2 / polylog ( n ) n^{1/2}/\text{polylog}(n) barrier for quantum LDPC codes
Matthew B Hastings, Jeongwan Haah, and Ryan O’Donnell · 2021
Cited alongside, same era.
Balanced product quantum codes
Nikolas P Breuckmann and Jens N Eberhardt · 2021
Cited alongside, same era.
Combining hard and soft decoders for hypergraph product codes
Antoine Grospellier, Lucien Grouès, Anirudh Krishna, and Anthony Leverrier · 2021
Cited alongside, same era.
Fault-tolerant gates on hypergraph product codes
Anirudh Krishna and David Poulin · 2021
Cited alongside, same era.
Nicolas Delfosse, Michael E Beverland, and Maxime A Tremblay · 2021
Cited alongside, same era.
Cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
Michael E Beverland, Aleksander Kubica, and Krysta M Svore · 2021
Cited alongside, same era.
Lawrence Z Cohen, Isaac H Kim, Stephen D Bartlett, and Benjamin J Brown · 2022
Later among the works it cites.
Constant-overhead quantum error correction with thin planar connectivity
Maxime A Tremblay, Nicolas Delfosse, and Michael E Beverland · 2022
Later among the works it cites.
Improved rate-distance trade-offs for quantum codes with restricted connectivity
Nouédyn Baspin, Venkatesan Guruswami, Anirudh Krishna, and Ray Li · 2023
Closest in time.
Layered decoding of quantum ldpc codes
Julien Du Crest, Francisco Garcia-Herrero, Mehdi Mhalla, Valentin Savin, and Javier Valls · 2023
Closest in time.
Partitioning qubits in hypergraph product codes to implement logical gates
Armanda O Quintavalle, Paul Webster, and Michael Vasmer · 2023
Closest in time.
Quantum low-density parity-check codes for modular architectures
Armands Strikis and Lucas Berent · 2023
Closest in time.
Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays
Qian Xu, J. Pablo Bonilla Ataides, Christopher A. Pattison, Nithin Raveendran, Dolev Bluvstein, Jonathan Wurtz, Bane Vasic, Mikhail D. Lukin, Liang Jiang, and Hengyun Zhou · 2023
Closest in time.
High-threshold and low-overhead fault-tolerant quantum memory
Sergey Bravyi, Andrew W Cross, Jay M Gambetta, Dmitri Maslov, Patrick Rall, and Theodore J Yoder · 2024
Closest in time.