Scalable surface code decoders with parallelization in time

N. Delfosse, Hierarchical decoding to reduce hardware requirements for quantum computing, 2020, arXiv:2001.11427

Original

2001

Earlier work this paper cites.

P. Das, C. A. Pattison, S. Manne, D. M. Carmean, K. M. Svore, M. Qureshi, and N. Delfosse, AFS: Accurate, fast, and scalable error-decoding for fault-tolerant quantum computers, in 2022 IEEE Int. S. High Perf. Comp. (HPCA) (IEEE, 2022) pp. 259–273, arXiv:2001.06598

Original

2001

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.

E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, J. Math. Phys. 43

2002

Earlier work this paper cites.

A. Kitaev, Fault-tolerant quantum computation by anyons, Ann. Phys. 303

2003

Earlier work this paper cites.

J. W. Harrington, Analysis of quantum error-correcting codes: Symplectic lattice codes and toric codes , Ph.D. thesis , California Institute of Technology (2004)

2004

Earlier work this paper cites.

A. Holmes, M. R. Jokar, G. Pasandi, Y. Ding, M. Pedram, and F. T. Chong, NISQ+: Boosting quantum computing power by approximating quantum error correction, in Proc. 47th ACM/IEEE Int. Symp. C. (ISCA) (IEEE Press, 2020) pp. 556–569, arXiv:2004.04794

Original

2004

Earlier work this paper cites.

E. Knill, Quantum computing with realistically noisy devices, Nature 434

2005

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.

P. Aliferis, D. Gottesman, and J. Preskill, Quantum accuracy threshold for concatenated distance-3 codes, Quantum Info. Comput. 6

2006

Earlier work this paper cites.

R. Raussendorf and J. Harrington, Fault-tolerant quantum computation with high threshold in two dimensions, Phys. Rev. Lett. 98

2007

Earlier work this paper cites.

D. Aharonov and M. Ben-Or, Fault-tolerant quantum computation with constant error rate, SIAM J. Comput. 38

2008

Earlier work this paper cites.

A. G. Fowler, A. M. Stephens, and P. Groszkowski, High-threshold universal quantum computation on the surface code, Phys. Rev. A 80

Original

2009

Earlier work this paper cites.

G. Duclos-Cianci and D. Poulin, Fast decoders for topological quantum codes, Phys. Rev. Lett. 104

Original

2010

Cited alongside, same era.

S. Bravyi and J. Haah, Quantum self-correction in the 3D cubic code model, Phys. Rev. Lett. 111

Original

2013

Cited alongside, same era.

D. Gottesman, Fault-tolerant quantum computation with constant overhead, Quantum Info. Comput. 14

Original

2014

Cited alongside, same era.

K. Fujii, M. Negoro, N. Imoto, and M. Kitagawa, Measurement-free topological protection using dissipative feedback, Phys. Rev. X 4

Original

2014

Cited alongside, same era.

Y. Tomita and K. M. Svore, Low-distance surface codes under realistic quantum noise, Phys. Rev. A 90

N. Delfosse and N. H. Nickerson, Almost-linear time decoding algorithm for topological codes, Quantum 5

Original

2021

Later among the works it cites.

Y. Ueno, M. Kondo, M. Tanaka, Y. Suzuki, and Y. Tabuchi, QULATIS: A quantum error correction methodology toward lattice surgery, in 2022 IEEE Int. S. High Perf. Comp. (HPCA) (IEEE, 2022) pp. 274–287

2022

Closest in time.

K. Meinerz, C.-Y. Park, and S. Trebst, Scalable neural decoder for topological surface codes, Phys. Rev. Lett. 128

Original

2022

Closest in time.

C. Chamberland, L. Goncalves, P. Sivarajah, E. Peterson, and S. Grimberg, Techniques for combining fast local decoders with global decoders under circuit-level noise, 2022, arXiv:2208.01178

Original

2022

Closest in time.

S. C. Smith, B. J. Brown, and S. D. Bartlett, A local pre-decoder to reduce the bandwidth and latency of quantum error correction, 2022, arXiv:2208.04660