Fetching the paper…
Reading the bibliography…
It is a major challenge to perform addressable and parallel logical operations on constant-rate quantum LDPC (qLDPC) codes.
A constructive proof of Vizing’s theorem
J. Misra and David Gries · 1992
Earlier work this paper cites.
Expander codes
M. Sipser and D.A. Spielman · 1996
Earlier work this paper cites.
Expander graphs and their applications
Shlomo Hoory, Nathan Linial, and Avi Wigderson · 2006
Earlier work this paper cites.
Exact topological quantum order in $D=3$ and beyond: Branyons and brane-net condensates
H. Bombin and M. A. Martin-Delgado · 2007
Earlier work this paper cites.
Topological Computation without Braiding
H. Bombin and M. A. Martin-Delgado · 2007
Earlier work this paper cites.
Magic-state distillation with low overhead
Sergey Bravyi and Jeongwan Haah · 2012
Earlier work this paper cites.
Pseudorandomness
Salil P. Vadhan · 2012
Earlier work this paper cites.
Fault tolerance of quantum low-density parity check codes with sublinear distance scaling
Alexey A. Kovalev and Leonid P. Pryadko · 2013
Earlier work this paper cites.
Homological product codes
Sergey Bravyi and Matthew B. Hastings · 2014
Earlier work this paper cites.
Fault-tolerant quantum computation with constant overhead
Daniel Gottesman · 2014
Earlier work this paper cites.
Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
Jean-Pierre Tillich and Gilles Zemor · 2014
Earlier work this paper cites.
Single-shot fault-tolerant quantum error correction
H. Bombin · 2015
Earlier work this paper cites.
Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
Héctor Bombín · 2015
Earlier work this paper cites.
Unfolding the color code
Aleksander Kubica, Beni Yoshida, and Fernando Pastawski · 2015
Earlier work this paper cites.
Anthony Leverrier, Jean-Pierre Tillich, and Gilles Zémor · 2015
Earlier work this paper cites.
Dimensional Jump in Quantum Error Correction, May 2016
H. Bombin · 2016
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.
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.
Building manifolds from quantum codes
Michael Freedman and Matthew Hastings · 2021
Cited alongside, same era.
Low-overhead fault-tolerant quantum computing using long-range connectivity
Lawrence Z. Cohen, Isaac H. Kim, Stephen D. Bartlett, and Benjamin J. Brown · 2022
Cited alongside, same era.
Explicit Lower Bounds Against Omega(n)-Rounds of Sum-of-Squares
Max Hopkins and Ting-Chun Lin · 2022
Cited alongside, same era.
Good quantum LDPC codes with linear time decoder from lossless expanders
Ting-Chun Lin and Min-Hsiu Hsieh · 2022
Irit Dinur, Ting-Chun Lin, and Thomas Vidick · 2024
Later among the works it cites.
Transversal non-Clifford gates for quantum LDPC codes on sheaves, October 2024
Ting-Chun Lin · 2024
Later among the works it cites.
Personal Communication, 2024
Christopher A. Pattison · 2024
Later among the works it cites.
Low-overhead fault-tolerant quantum computation by gauging logical operators, October 2024
Dominic J. Williamson and Theodore J. Yoder · 2024
Later among the works it cites.
Fast and Parallelizable Logical Computation with Homological Product Codes, July 2024
Qian Xu, Hengyun Zhou, Guo Zheng, Dolev Bluvstein, J. Pablo Bonilla Ataides, Mikhail D. Lukin, and Liang Jiang · 2024
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Quantum Tanner codes
Anthony Leverrier and Gilles Zémor · 2022
Cited alongside, same era.
Asymptotically good Quantum and locally testable classical LDPC codes
Pavel Panteleev and Gleb Kalachev · 2022
Cited alongside, same era.
Good Quantum LDPC Codes with Linear Time Decoders
Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, and Thomas Vidick · 2023
Cited alongside, same era.
On Quantum Weight Reduction, July 2023
M. B. Hastings · 2023
Cited alongside, same era.
Two-sided Robustly Testable Codes, August 2023
Gleb Kalachev and Pavel Panteleev · 2023
Cited alongside, same era.
Hierarchical memories: Simulating quantum LDPC codes with local gates, March 2023
Christopher A. Pattison, Anirudh Krishna, and John Preskill · 2023
Cited alongside, same era.
Later among the works it cites.
On fault tolerant single-shot logical state preparation and robust long-range entanglement
Thiago Bergamaschi and Yunchao Liu · 2025
Closest in time.
Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes
Louis Golowich and Ting-Chun Lin · 2025
Closest in time.
Extractors: QLDPC Architectures for Efficient Pauli-Based Computation, March 2025
Zhiyang He, Alexander Cowtan, Dominic J. Williamson, and Theodore J. Yoder · 2025
Closest in time.
Explicit Lossless Vertex Expanders, April 2025
Jun-Ting Hsieh, Alexander Lubotzky, Sidhanth Mohanty, Assaf Reiner, and Rachel Yun Zhang · 2025
Closest in time.
Composable Quantum Fault-Tolerance, August 2025
Zhiyang He, Quynh T. Nguyen, and Christopher A. Pattison · 2025
Closest in time.
Asymptotically Good Quantum Codes with Addressable and Transversal Non-Clifford Gates, July 2025
Zhiyang He, Vinod Vaikuntanathan, Adam Wills, and Rachel Yun Zhang · 2025
Closest in time.
Quantum Codes with Addressable and Transversal Non-Clifford Gates, February 2025
Zhiyang He, Vinod Vaikuntanathan, Adam Wills, and Rachel Yun Zhang · 2025
Closest in time.
Maximally Extendable Product Codes are Good Coboundary Expanders, January 2025
Gleb Kalachev and Pavel Panteleev · 2025
Closest in time.
Quantum Fault Tolerance with Constant-Space and Logarithmic-Time Overheads
Quynh T. Nguyen and Christopher A. Pattison · 2025
Closest in time.
Universal adapters between quantum LDPC codes, March 2025
Esha Swaroop, Tomas Jochym-O’Connor, and Theodore J. Yoder · 2025
Closest in time.
Single-shot universality in quantum ldpc codes via code switching
Shi Jie Samuel Tan, Yifan Hong, Ting-Chun Lin, Michael J. Gullans, and Min-Hsiu Hsieh · 2025
Closest in time.