Fetching the paper…
Reading the bibliography…
Quantum error correction is necessary for achieving exponential speedups on important applications.
J. Edmonds, “Maximum matching and a polyhedron with 0,1-vertices,”
1965
Earlier work this paper cites.
P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,”
1999
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,”
2009
Earlier work this paper cites.
2011
Earlier work this paper cites.
D. Horsman, A. G. Fowler, S. Devitt, and R. Van Meter, “Surface code quantum computing by lattice surgery,”
2012
Earlier work this paper cites.
N. Delfosse, “Tradeoffs for reliable quantum information storage in surface codes and color codes,” in
2013
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,”
2013
Earlier work this paper cites.
Y. Tomita and K. M. Svore, “Low-distance surface codes under realistic quantum noise,”
2014
Earlier work this paper cites.
N. P. Breuckmann and B. M. Terhal, “Constructions and noise threshold of hyperbolic surface codes,”
2016
Earlier work this paper cites.
N. P. Breuckmann, C. Vuillot, E. Campbell, A. Krishna, and B. M. Terhal, “Hyperbolic and semi-hyperbolic surface codes for quantum storage,”
2017
Earlier work this paper cites.
M. Reiher, N. Wiebe, K. M. Svore, D. Wecker, and M. Troyer, “Elucidating reaction mechanisms on quantum computers,”
2017
Earlier work this paper cites.
R. Chao and B. W. Reichardt, “Quantum error correction with only two extra qubits,”
2018
Earlier work this paper cites.
A. M. Childs, D. Maslov, Y. Nam, N. J. Ross, and Y. Su, “Toward the first quantum simulation with quantum speedup,”
2018
Earlier work this paper cites.
J. Conrad, C. Chamberland, N. P. Breuckmann, and B. M. Terhal, “The small stellated dodecahedron code and friends,”
2018
Earlier work this paper cites.
P. Baireuther, M. D. Caio, B. Criger, C. W. Beenakker, and T. E. O’Brien, “Neural network decoder for topological color codes with circuit level noise,”
2019
Earlier work this paper cites.
E. Campbell, A. Khurana, and A. Montanaro, “Applying quantum algorithms to constraint satisfaction problems,”
2019
Earlier work this paper cites.
D. Litinski, “A game of surface codes: Large-scale quantum computing with lattice surgery,”
2019
Cited alongside, same era.
C. Chamberland, A. Kubica, T. J. Yoder, and G. Zhu, “Triangular color codes on trivalent graphs with flag qubits,”
2020
Cited alongside, same era.
C. Chamberland, G. Zhu, T. J. Yoder, J. B. Hertzberg, and A. W. Cross, “Topological and subsystem codes on low-degree graphs with flag qubits,”
2020
Cited alongside, same era.
I. D. Kivlichan, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, W. Sun, Z. Jiang, N. Rubin, A. Fowler, A. Aspuru-Guzik, H. Neven, and R. Babbush, “Improved fault-tolerant quantum simulation of condensed-phase correlated electrons via trotterization,”
2020
Cited alongside, same era.
L. Lao and C. G. Almudever, “Fault-tolerant quantum error correction on near-term quantum processors using flag and bridge qubits,”
2020
A. Wu, G. Li, H. Zhang, G. G. Guerreschi, Y. Ding, and Y. Xie, “A synthesis framework for stitching surface code with superconducting quantum devices,” in
2022
Later among the works it cites.
“Suppressing quantum errors by scaling a surface code logical qubit,”
2023
Later among the works it cites.
2023
Later among the works it cites.
C. Gidney and C. Jones, “New circuits and an open source decoder for the color code,”
2023
Later among the works it cites.
C. Gidney, M. Newman, P. Brooks, and C. Jones, “Yoked surface codes,”
2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
P. Murali, D. C. McKay, M. Martonosi, and A. Javadi-Abhari, “Software mitigation of crosstalk on noisy intermediate-scale quantum computers,” in
2020
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,”
2021
Cited alongside, same era.
N. P. Breuckmann and J. N. Eberhardt, “Balanced product quantum codes,”
2021
Cited alongside, same era.
C. Gidney, “Stim: a fast stabilizer circuit simulator,”
2021
Cited alongside, same era.
C. Gidney and M. Ekerå, “How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits,”
2021
Cited alongside, same era.
G. Li, A. Wu, Y. Shi, A. Javadi-Abhari, Y. Ding, and Y. Xie, “On the co-design of quantum software and hardware,” in
2021
Cited alongside, same era.
N. P. Breuckmann and S. Burton, “Fold-transversal clifford gates for quantum codes,”
2022
Cited alongside, same era.
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
A. Kubica and N. Delfosse, “Efficient color code decoders in
2023
Later among the works it cites.
P.-H. Liou and C.-Y. Lai, “Parallel syndrome extraction with shared flag qubits for calderbank-shor-steane codes of distance three,”
2023
Later among the works it cites.
A. G. Manes and J. Claes, “Distance-preserving stabilizer measurements in hypergraph product codes,”
2023
Later among the works it cites.
2023
Later among the works it cites.
2024
Closest in time.
“Gap – groups, algorithms, and programming, version 4.13.1,” The Gap Group, 2024. [Online]. Available:
2024
Closest in time.
G. P. Gehér, O. Crawford, and E. T. Campbell, “Tangling schedules eases hardware connectivity requirements for quantum error correction,”
2024
Closest in time.