Improved accuracy for decoding surface codes with matching synthesis

L. Manzoni, L. Mariot, and E. Tuba, Balanced crossover operators in genetic algorithms, Swarm and Evolutionary Computation 54

Original

1904

Earlier work this paper cites.

J. Edmonds, Paths, trees, and flowers, Can. J. Math. 17

1965

Earlier work this paper cites.

S. Lin, Computer solutions of the traveling salesman problem, The Bell System Technical Journal 44

1965

Earlier work this paper cites.

S. Lin and B. W. Kernighan, An Effective Heuristic Algorithm for the Traveling-Salesman Problem, Operations Research 21

1973

Earlier work this paper cites.

H. Mühlenbein, M. Gorges-Schleuter, and O. Krämer, Evolution algorithms in combinatorial optimization, Parallel Computing 7

1988

Earlier work this paper cites.

O. Martin, S. W. Otto, and E. W. Felten, Large-step markov chains for the traveling salesman problem, Complex Systems 5

1991

Earlier work this paper cites.

S. W. Mahfoud and D. E. Goldberg, Parallel recombinative simulated annealing: A genetic algorithm, Parallel Computing 21

1995

Earlier work this paper cites.

S. B. Bravyi and A. Y. Kitaev, Quantum codes on a lattice with boundary, (1998), Preprint arXiv:quant-ph/9811052

1998

Earlier work this paper cites.

D. Gottesman, The Heisenberg Representation of Quantum Computers, (1998), Preprint arXiv:quant-ph/9807006

1998

Earlier work this paper cites.

J. Håstad, Clique is hard to approximate within n 1 − ε n^{1-\varepsilon} , Acta Mathematica 182

1999

Earlier work this paper cites.

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

Original

2001

Earlier work this paper cites.

E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, Journal of Mathematical Physics 43

2002

Earlier work this paper cites.

A. M. Steane, Overhead and noise threshold of fault-tolerant quantum error correction, Phys. Rev. A 68

2003

Earlier work this paper cites.

J. Feldman, M. J. Wainwright, and D. R. Karger, Using linear programming to decode binary linear codes, IEEE Transactions on Information Theory 51

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.

H. Bombin and M. A. Martin-Delgado, Statistical mechanical models and topological color codes, Phys. Rev. A 77

2008

Earlier work this paper cites.

G. Duclos-Cianci and D. Poulin, A renormalization group decoding algorithm for topological quantum codes, in 2010 IEEE Information Theory Workshop (2010) pp. 1–5

2010

Earlier work this paper cites.

A. J. Landahl, J. T. Anderson, and P. R. Rice, Fault-tolerant quantum computing with color codes, arXiv preprint arXiv:1108.5738 (2011)

Original

2011

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.

N. C. Jones, R. Van Meter, A. G. Fowler, P. L. McMahon, J. Kim, T. D. Ladd, and Y. Yamamoto, Layered architecture for quantum computing, Phys. Rev. X 2

2012

Earlier work this paper cites.

D. 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.

A. G. Fowler, Optimal complexity correction of correlated errors in the surface code, arXiv:1310.0863 (2013)

Original

2013

Earlier work this paper cites.

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

2013

Cited alongside, same era.

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

Cited alongside, same era.

A. Hutter, J. R. Wootton, and D. Loss, Efficient markov chain monte carlo algorithm for the surface code, Phys. Rev. A 89

Original

2014

Cited alongside, same era.

S. Bravyi, M. Suchara, and A. Vargo, Efficient algorithms for maximum likelihood decoding in the surface code, Physical Review A 90

2014

Cited alongside, same era.

N. Delfosse, Decoding color codes by projection onto surface codes, Phys. Rev. A 89

2014

Cited alongside, same era.

A. Benhemou, K. Sahay, L. Lao, and B. J. Brown, Minimising surface-code failures using a color-code decoder, (2023), Preprint arXiv:2306.16476

Original

2023

Later among the works it cites.

J. Old and M. Rispler, Generalized Belief Propagation Algorithms for Decoding of Surface Codes, Quantum 7

2023

Later among the works it cites.

C. Piveteau, C. T. Chubb, and J. M. Renes, Tensor network decoding beyond 2d, arXiv preprint arXiv:2310.10722 (2023)

Original

2023

Later among the works it cites.

G. Q. AI, Suppressing quantum errors by scaling a surface code logical qubit, Nature 614

2023

Later among the works it cites.

J. Bausch, A. W. Senior, F. J. Heras, T. Edlich, A. Davies, M. Newman, C. Jones, K. Satzinger, M. Y. Niu, S. Blackwell, et al. , Learning to decode the surface code with a recurrent, transformer-based neural network, (2023), Preprint arXiv:2310.05900

Original