Fetching the paper…
Reading the bibliography…
Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.
P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26
1997
Earlier work this paper cites.
J. Preskill, Reliable quantum computers, Proc. R. Soc. A 454
1998
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, J. Math. Phys. 43
2002
Earlier work this paper cites.
A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Ann. Phys. 303
2003
Earlier work this paper cites.
C. Wang, J. Harrington, and J. Preskill, Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory, Ann. Phys. 303
2003
Earlier work this paper cites.
S. A. Cuccaro, T. G. Draper, S. A. Kutin, and D. P. Moulton, (2004), arXiv:quant-ph/0410184 [quant-ph]
2004
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Phys. Rev. A 71
2005
Earlier work this paper cites.
C. M. Dawson and M. A. Nielsen, The Solovay-Kitaev algorithm (2005), arXiv:quant-ph/0505030 [quant-ph]
2005
Earlier work this paper cites.
P. Aliferis, D. Gottesman, and J. Preskill, Accuracy threshold for postselected quantum computation, Quantum Inf. Comput. 8
2007
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, 2010)
2010
Earlier work this paper cites.
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Phys. Rev. A 86
2012
Earlier work this paper cites.
A. A. Kovalev and L. P. Pryadko, Fault tolerance of quantum low-density parity check codes with sublinear distance scaling, Phys. Rev. A 87
2013
Earlier work this paper cites.
D. Gottesman, Fault-Tolerant Quantum Computation with Constant Overhead, Quantum Inf. Comput. 14
2013
Earlier work this paper cites.
N. Delfosse, Decoding color codes by projection onto surface codes, Phys. Rev. A 89
2014
Earlier work this paper cites.
F. H. E. Watson and S. D. Barrett, Logical error rate scaling of the toric code, New J. Phys. 16
2014
Earlier work this paper cites.
J.-P. Tillich and G. Zémor, Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Trans. Inf. Theory 60
2014
Earlier work this paper cites.
A. G. Fowler, Minimum weight perfect matching of fault-tolerant topological quantum error correction in average O(1) parallel time, Quantum Inf. Comput. 15
2015
Earlier work this paper cites.
A. Kubica, B. Yoshida, and F. Pastawski, Unfolding the color code, New J. Phys. 17
2015
Earlier work this paper cites.
J. E. Moussa, Transversal clifford gates on folded surface codes, Phys. Rev. A 94
2016
Earlier work this paper cites.
G. Torlai and R. G. Melko, Neural decoder for topological codes, Phys. Rev. Lett. 119
2017
Earlier work this paper cites.
R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, A. Paler, A. Fowler, and H. Neven, Encoding electronic spectra in quantum circuits with linear t complexity, Phys. Rev. X 8
2018
Earlier work this paper cites.
P. Panteleev and G. Kalachev, Degenerate Quantum LDPC Codes With Good Finite Length Performance, Quantum 5
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
Y.-H. Liu and D. Poulin, Neural belief-propagation decoders for quantum error-correcting codes, Phys. Rev. Lett. 122
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
Earlier work this paper cites.
J. Roffe, D. R. White, S. Burton, and E. Campbell, Decoding across the quantum low-density parity-check code landscape, Phys. Rev. Res. 2
2020
Earlier work this paper cites.
S. Varsamopoulos, K. Bertels, and C. G. Almudever, Comparing neural network based decoders for the surface code, IEEE Trans. Comput. 69
2020
Earlier work this paper cites.
N. Delfosse and N. H. Nickerson, Almost-linear time decoding algorithm for topological codes, Quantum 5
2021
Cited alongside, same era.
M. E. Beverland, A. Kubica, and K. M. Svore, Cost of Universality: A Comparative Study of the Overhead of State Distillation and Code Switching with Color Codes, PRX Quantum 2
2021
Cited alongside, same era.
C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum 5
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.
Y. Wang, S. Simsek, T. M. Gatterman, J. A. Gerber, K. Gilmore, D. Gresh, N. Hewitt, C. V. Horst, M. Matheny, T. Mengle, B. Neyenhuis, and B. Criger, Fault-tolerant one-bit addition with the smallest interesting color code, Sci. Adv. 10
2024
Later among the works it cites.
M. Cain, C. Zhao, H. Zhou, N. Meister, J. P. B. Ataides, A. Jaffe, D. Bluvstein, and M. D. Lukin, Correlated Decoding of Logical Algorithms with Transversal Gates, Phys. Rev. Lett. 133
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…
D. Bluvstein, H. Levine, G. Semeghini, T. T. Wang, S. Ebadi, M. Kalinowski, A. Keesling, N. Maskara, H. Pichler, M. Greiner, V. Vuletić, and M. D. Lukin, A quantum processor based on coherent transport of entangled atom arrays, Nature 604
2022
Cited alongside, same era.
L. Postler, S. Heußen, I. Pogorelov, M. Rispler, T. Feldker, M. Meth, C. D. Marciniak, R. Stricker, M. Ringbauer, R. Blatt, P. Schindler, M. Müller, and T. Monz, Demonstration of fault-tolerant universal quantum gate operations, Nature 605
2022
Cited alongside, same era.
N. Delfosse, V. Londe, and M. E. Beverland, Toward a Union-Find Decoder for Quantum LDPC Codes, IEEE Trans. Inf. Theory 68
2022
Cited alongside, same era.
K.-Y. Kuo and C.-Y. Lai, Comparison of 2d topological codes and their decoding performances, in 2022 IEEE International Symposium on Information Theory (ISIT) (2022) pp. 186–191
2022
Cited alongside, same era.
Y. Wu, S. Kolkowitz, S. Puri, and J. D. Thompson, Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays, Nat. Comm. 13
2022
Cited alongside, same era.
B. J. Brown, Conservation laws and quantum error correction: Toward a generalized matching decoder, IEEE BITS the Information Theory Magazine 2
2022
Cited alongside, same era.
Y. Wu and L. Zhong, Fusion Blossom: fast MWPM decoders for QEC, in IEEE Int. Conf. Quantum Comput. Eng. (IEEE Computer Society, Los Alamitos, CA, USA, 2023) pp. 928–938
2023
Cited alongside, same era.
Y. Wu, L. Zhong, and S. Puri, Hypergraph Minimum-Weight Parity Factor Decoder for QEC, in Bull. Am. Phys. Soc (American Physical Society, 2024)
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.
J. Bausch, A. W. Senior, F. J. H. Heras, T. Edlich, A. Davies, M. Newman, C. Jones, K. Satzinger, M. Y. Niu, S. Blackwell, G. Holland, D. Kafri, J. Atalaya, C. Gidney, D. Hassabis, S. Boixo, H. Neven, and P. Kohli, Learning high-accuracy error decoding for quantum processors, Nature 635
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, High-threshold and low-overhead fault-tolerant quantum memory, Nature 627
2024
Later among the works it cites.
Q. Xu, J. P. Bonilla Ataides, C. A. Pattison, N. Raveendran, D. Bluvstein, J. Wurtz, B. Vasić, M. D. Lukin, L. Jiang, and H. Zhou, Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays, Nat. Phys. 20
2024
Later among the works it cites.
Google Quantum AI and Collaborators, Quantum error correction below the surface code threshold, Nature 638
2025
Closest in time.
K. Sahay, Y. Lin, S. Huang, K. R. Brown, and S. Puri, Error Correction of Transversal CNOT Gates for Scalable Surface-Code Computation, PRX Quantum 6
2025
Closest in time.
2025
Closest in time.
O. Higgott and C. Gidney, Sparse Blossom: correcting a million errors per core second with minimum-weight matching, Quantum 9
2025
Closest in time.
S.-H. Lee, A. Li, and S. D. Bartlett, Color code decoder with improved scaling for correcting circuit-level noise, Quantum 9
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 International Symposium on Computer Architecture (2025)
2025
Closest in time.
B. Barber, K. M. Barnes, T. Bialas, O. Buğdaycı, E. T. Campbell, N. I. Gillespie, K. Johar, R. Rajan, A. W. Richardson, L. Skoric, C. Topal, M. L. Turner, and A. B. Ziad, A real-time, scalable, fast and resource-efficient decoder for a quantum computer, Nat. Electron. 8
2025
Closest in time.
A. S. Maan and A. Paler, Machine learning message-passing for the scalable decoding of QLDPC codes, npj Quantum Inf. 11
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
S. Gu, A. Retzker, and A. Kubica, Fault-tolerant quantum architectures based on erasure qubits, Phys. Rev. Res. 7
2025
Closest in time.