Fetching the paper…
Reading the bibliography…
High-rate quantum LDPC (qLDPC) codes reduce memory overhead by densely packing many logical qubits into a single block of physical qubits.
R. W. Hamming, Error detecting and error correcting codes, The Bell system technical journal 29
1950
Earlier work this paper cites.
H. F. Trotter, On the product of semi-groups of operators, Proceedings of the American Mathematical Society 10
1959
Earlier work this paper cites.
M. Sipser and D. A. Spielman, Expander codes, IEEE Transactions on Information Theory 42
1996
Earlier work this paper cites.
D. Gottesman, Stabilizer codes and quantum error correction (California Institute of Technology, 1997)
1997
Earlier work this paper cites.
E. Knill, Quantum Computing with Very Noisy Devices, Nature 434
2004
Earlier work this paper cites.
S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Physical Review A—Atomic, Molecular, and Optical Physics 70
2004
Earlier work this paper cites.
R. Raussendorf, Quantum computation via translation-invariant operations on a chain of qubits, Physical Review A - Atomic, Molecular, and Optical Physics 72
2005
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Physical Review A 71
2005
Earlier work this paper cites.
C. M. Dawson and M. A. Nielsen, The solovay-kitaev algorithm, arXiv preprint quant-ph/0505030 (2005)
2005
Earlier work this paper cites.
H. Bombin and M. Martin-Delgado, Exact topological quantum order in d= 3 and beyond: Branyons and brane-net condensates, Physical Review B—Condensed Matter and Materials Physics 75
2007
Earlier work this paper cites.
T. Richardson and R. Urbanke, Modern coding theory (Cambridge University Press, 2008)
2008
Earlier work this paper cites.
D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms (Cambridge University Press, 2009)
2009
Earlier work this paper cites.
C. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, Surface code quantum computing by lattice surgery, New Journal of Physics 14
2012
Earlier work this paper cites.
S. Bravyi and J. Haah, Magic-state distillation with low overhead, Physical Review A - Atomic, Molecular, and Optical Physics 86
2012
Earlier work this paper cites.
2012
Earlier work this paper cites.
D. Gottesman, Fault-Tolerant Quantum Computation with Constant Overhead, Quantum Information and Computation 14
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
J. T. Anderson, G. Duclos-Cianci, and D. Poulin, Fault-tolerant conversion between the steane and reed-muller quantum codes, Physical review letters 113
2014
Earlier work this paper cites.
J. P. Tillich and G. Zemor, Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Transactions on Information Theory 60
2014
Earlier work this paper cites.
H. Bombin, Single-shot fault-tolerant quantum error correction, Physical Review X 5
2015
Earlier work this paper cites.
A. Leverrier, J. P. Tillich, and G. Zemor, Quantum Expander Codes, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2015-Decem
2015
Earlier work this paper cites.
Y. Li, A magic state’s fidelity can be superior to the operations that created it, New Journal of Physics 17
2015
Earlier work this paper cites.
H. Bombín, Dimensional jump in quantum error correction, New Journal of Physics 18
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
O. Fawzi, A. Grospellier, and A. Leverrier, Efficient decoding of random errors for quantum expander codes, Proceedings of the Annual ACM Symposium on Theory of Computing , 878 (2017)
2017
Earlier work this paper cites.
H. Poulsen Nautrup, N. Friis, and H. J. Briegel, Fault-tolerant interface between quantum memories and quantum processors, Nature Communications 2017 8:1 8
2017
Earlier work this paper cites.
2018
Earlier work this paper cites.
E. T. Campbell, A theory of single-shot error correction for adversarial noise, Quantum Science and Technology 4
2019
Earlier work this paper cites.
M. Vasmer and D. E. Browne, Three-dimensional surface codes: Transversal gates and fault-tolerant architectures, Physical Review A 100
2019
Earlier work this paper cites.
G. H. Low and I. L. Chuang, Hamiltonian simulation by qubitization, Quantum 3
2019
Earlier work this paper cites.
C. Gidney and A. G. Fowler, Efficient magic state factories with a catalyzed | C C Z ⟩ |CCZ\rangle to 2 | T ⟩ 2|T\rangle transformation, Quantum 3
2019
Cited alongside, same era.
C. Vuillot, L. Lao, B. Criger, C. Garcia Almudéver, K. Bertels, and B. M. Terhal, Code deformation and lattice surgery are gauge fixing, New Journal of Physics 21
2019
Cited alongside, same era.
N. P. Breuckmann and J. N. Eberhardt, Balanced Product Quantum Codes, IEEE Transactions on Information Theory 67
2020
Cited alongside, same era.
A. O. Quintavalle, M. Vasmer, J. Roffe, and E. T. Campbell, Single-shot error correction of three-dimensional homological product codes, PRX Quantum 2
2020
Cited alongside, same era.
C. Chamberland and K. Noh, Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits, npj Quantum Information 2020 6:1 6
2024
Later among the works it cites.
2024
Later among the works it cites.
H. Yamasaki and M. Koashi, Time-efficient constant-space-overhead fault-tolerant quantum computation, Nature Physics 20
2024
Later among the works it cites.
2024
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2020
Cited alongside, same era.
J. Jiang, X. Sun, S.-H. Teng, B. Wu, K. Wu, and J. Zhang, Optimal space-depth trade-off of cnot circuits in quantum logic synthesis, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM, 2020) pp. 213–229
2020
Cited alongside, same era.
A. Coja-Oghlan, A. A. Ergür, P. Gao, S. Hetterich, and M. Rolvien, The rank of sparse random matrices, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM, 2020) pp. 579–591
2020
Cited alongside, same era.
S. R. Cohen and J. D. Thompson, Quantum computing with circular Rydberg atoms, PRX Quantum 2
2021
Cited alongside, same era.
J. Haah, M. B. Hastings, R. Kothari, and G. H. Low, Quantum algorithm for simulating real time evolution of lattice hamiltonians, SIAM Journal on Computing 52
2021
Cited alongside, same era.
J. M. Pino, J. M. Dreiling, C. Figgatt, J. P. Gaebler, S. A. Moses, M. S. Allman, C. H. Baldwin, M. Foss-Feig, D. Hayes, K. Mayer, C. Ryan-Anderson, and B. Neyenhuis, Demonstration of the trapped-ion quantum CCD computer architecture, Nature 2021 592:7853 592
2021
Cited alongside, same era.
N. P. Breuckmann and J. N. Eberhardt, Quantum Low-Density Parity-Check Codes, PRX Quantum 2
2021
Cited alongside, same era.
2022
Cited alongside, same era.
2024
Later among the works it cites.
2024
Later among the works it cites.
J. Viszlai, S. Lin, J. Liu, N. Nottingham, W. Yang, J. Baker, and F. Chong, Efficient ldpc codes: Simulating generalized bicycle codes for atom arrays, in APS March Meeting Abstracts , Vol. 2024 (2024) pp. N51–003
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
2025
Closest in time.
J. Preskill, Beyond NISQ: The megaquop machine, ACM Transactions on Quantum Computing 6
2025
Closest in time.
2025
Closest in time.
L. Golowich and V. Guruswami, Asymptotically good quantum codes with transversal non-clifford gates, in Proceedings of the 57th Annual ACM Symposium on Theory of Computing (2025) pp. 707–717
2025
Closest in time.
T. Hillmann, L. Berent, A. O. Quintavalle, J. Eisert, R. Wille, and J. Roffe, Localized statistics decoding for quantum low-density parity-check codes, Nature Communications 16
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
H. Zhou, C. Duckering, C. Zhao, D. Bluvstein, M. Cain, A. Kubica, S.-T. Wang, and M. D. Lukin, Resource analysis of low-overhead transversal architectures for reconfigurable atom arrays, in Proceedings of the 52nd Annual International Symposium on Computer Architecture (2025) pp. 1432–1448
2025
Closest in time.
2025
Closest in time.
L. Golowich and T.-C. Lin, Quantum ldpc codes with transversal non-clifford gates via products of algebraic codes, in Proceedings of the 57th Annual ACM Symposium on Theory of Computing (2025) pp. 689–696
2025
Closest in time.
2025
Closest in time.
P. Sales Rodriguez, J. M. Robinson, P. N. Jepsen, Z. He, C. Duckering, C. Zhao, K.-H. Wu, J. Campo, K. Bagnall, M. Kwon, et al. , Experimental demonstration of logical magic state distillation, Nature , 1 (2025)
2025
Closest in time.
P. B. et al. (2025), in preparation
2025
Closest in time.
2025
Closest in time.