Fetching the paper…
Reading the bibliography…
Reducing space and time overheads of fault-tolerant quantum computation (FTQC) has been receiving increasing attention as it is crucial for the development of quantum computers and also plays a fundamental role in understanding the feasibility and limitations of realizing quantum advantages.
E. W. Dijkstra, A note on two problems in connexion with graphs., Numerische Mathematik 1
1959
Earlier work this paper cites.
V. Strassen, Gaussian elimination is not optimal, Numerische mathematik 13
1969
Earlier work this paper cites.
L. Csanky, Fast parallel matrix inversion algorithms, SIAM Journal on Computing 5
1976
Earlier work this paper cites.
F. Preparata and D. Sarwate, An improved parallel processor bound in fast matrix inversion, Information Processing Letters 7
1978
Earlier work this paper cites.
S. Micali and V. V. Vazirani, An O ( | V | ⋅ | E | ) {O}\left(\sqrt{|V|\cdot|E|}\right) algoithm for finding maximum matching in general graphs, in 21st Annual Symposium on Foundations of Computer Science (sfcs 1980) (1980) pp. 17–27
1980
Earlier work this paper cites.
S. J. Berkowitz, On computing the determinant in small parallel time using a small number of processors, Information Processing Letters 18
1984
Earlier work this paper cites.
M. Furst, J. B. Saxe, and M. Sipser, Parity, circuits, and the polynomial-time hierarchy, Mathematical systems theory 17
1984
Earlier work this paper cites.
A. C.-C. Yao, Separating the polynomial-time hierarchy by oracles, in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) (1985) pp. 1–10
1985
Earlier work this paper cites.
J. Hastad, Almost optimal lower bounds for small depth circuits, in Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing , STOC ’86 (Association for Computing Machinery, New York, NY, USA, 1986) p. 6–20
1986
Earlier work this paper cites.
K. M. U. Vazirani and V. Vazirani, Matching is as easy as matrix inversion, Combinatorica 7
1987
Earlier work this paper cites.
D. Y. Grigoriev and M. Karpinski, The matching problem for bipartite graphs with polynomially bounded permanents is in nc, in 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) (1987) pp. 166–172
1987
Earlier work this paper cites.
M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM 34
1987
Earlier work this paper cites.
A. A. Razborov, Lower bounds on the size of bounded depth circuits over a complete basis with logical addition, Mat. Zametki 41
1987
Earlier work this paper cites.
R. Smolensky, Algebraic methods in the theory of lower bounds for boolean circuit complexity, in Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing , STOC ’87 (Association for Computing Machinery, New York, NY, USA, 1987) p. 77–82
1987
Earlier work this paper cites.
A. Steane, Multiple-particle interference and quantum error correction, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 452
1996
Earlier work this paper cites.
D. Aharonov and M. Ben-Or, Fault-tolerant quantum computation with constant error, in Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing , STOC ’97 (Association for Computing Machinery, New York, NY, USA, 1997) p. 176–188
1997
Earlier work this paper cites.
M. Mahajan and V. Vinay, Determinant: Combinatorics, Algorithms, and Complexity , Tech. Rep. (1997)
1997
Earlier work this paper cites.
A. A. Razborov and S. Rudich, Natural proofs, Journal of Computer and System Sciences 55
1997
Earlier work this paper cites.
S. B. Bravyi and A. Y. Kitaev, Quantum codes on a lattice with boundary (1998), arXiv:quant-ph/9811052 [quant-ph]
1998
Earlier work this paper cites.
E. Dahlhaus and M. Karpinski, Matching and multidimensional matching in chordal and strongly chordal graphs, Discrete Applied Mathematics 84
1998
Earlier work this paper cites.
M. Matsumoto and T. Nishimura, Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator, ACM Trans. Model. Comput. Simul. 8
1998
Earlier work this paper cites.
D. Gottesman and I. L. Chuang, Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations, Nature 402
1999
Earlier work this paper cites.
X. Zhou, D. W. Leung, and I. L. Chuang, Methodology for quantum logic gate construction, Phys. Rev. A 62
2000
Earlier work this paper cites.
J. G. Siek, L.-Q. Lee, and A. Lumsdaine, The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley. (Pearson Education, 2001)
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. Kitaev, Fault-tolerant quantum computation by anyons, Ann. Phys. 303
2003
Earlier work this paper cites.
V. Bunimov and M. Schimmler, Efficient parallel multiplication algorithm for large integers, in Euro-Par 2003 Parallel Processing , edited by H. Kosch, L. Böszörményi, and H. Hellwagner (Springer Berlin Heidelberg, Berlin, Heidelberg, 2003) pp. 923–928
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.
S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Phys. Rev. A 70
2004
Earlier work this paper cites.
H. Bombin and M. A. Martin-Delgado, Topological quantum distillation, Phys. Rev. Lett. 97
2006
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.
M. Agrawal, T. M. Hoang, and T. Thierauf, The polynomially bounded perfect matching problem is in nc2, in STACS 2007 , edited by W. Thomas and P. Weil (Springer Berlin Heidelberg, Berlin, Heidelberg, 2007) pp. 489–499
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. Hagberg, P. J. Swart, and D. A. Schult, Exploring network structure, dynamics, and function using NetworkX , Tech. Rep. (Los Alamos National Laboratory (LANL), Los Alamos, NM (United States), 2008)
2008
Earlier work this paper cites.
V. Kolmogorov, Blossom v: a new implementation of a minimum cost perfect matching algorithm, Mathematical Programming Computation 1
2009
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, Cambridge, 2010)
2010
Earlier work this paper cites.
D. Gottesman, An introduction to quantum error correction and fault-tolerant quantum computation, in Quantum information science and its contributions to mathematics , Proceedings of Symposia in Applied Mathematics, Vol. 68 (American Mathematical Society, Providence, Rhode Island, 2010) pp. 13–58
2010
Earlier work this paper cites.
D. S. Wang, A. G. Fowler, A. M. Stephens, and L. C. L. Hollenberg, Threshold error rates for the toric and planar codes, Quantum Info. Comput. 10
2010
Earlier work this paper cites.
S. Datta, R. Kulkarni, and S. Roy, Deterministically isolating a perfect matching in bipartite planar graphs, Theory of Computing Systems 47
2010
Cited alongside, same era.
B. Dezső, A. Jüttner, and P. Kovács, Lemon – an open source c++ graph template library, Electronic Notes in Theoretical Computer Science 264
2010
Cited alongside, same era.
G. Duclos-Cianci and D. Poulin, Fast decoders for topological quantum codes, Phys. Rev. Lett. 104
2010
Cited alongside, same era.
A. G. Fowler, D. S. Wang, and L. C. L. Hollenberg, Surface code quantum error correction incorporating accurate error propagation, Quantum Info. Comput. 11
2011
Cited alongside, same era.
D. S. Wang, A. G. Fowler, and L. C. L. Hollenberg, Surface code quantum computing with error rates over 1%, Phys. Rev. A 83
2011
Cited alongside, same era.
J. K. Iverson, Aspects of Fault-Tolerant Quantum Computation , Ph.D. thesis , California Institute of Technology (2020)
2020
Later among the works it cites.
A. O. Quintavalle, M. Vasmer, J. Roffe, and E. T. Campbell, Single-shot error correction of three-dimensional homological product codes, PRX Quantum 2
2021
Later among the works it cites.
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
Later among the works it cites.
M. Vasmer, D. E. Browne, and A. Kubica, Cellular automaton decoders for topological quantum codes with noisy measurements and beyond, Scientific reports 11
2021
Later among the works it cites.
N. Delfosse and N. H. Nickerson, Almost-linear time decoding algorithm for topological codes, Quantum 5
2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
A. G. Fowler, Proof of finite surface code threshold for matching, Phys. Rev. Lett. 109
2012
Cited alongside, same era.
R. Tewari and N. Vinodchandran, Green’s theorem and isolation in planar graphs, Information and Computation 215
2012
Cited alongside, same era.
D. Horsman, A. G. Fowler, S. Devitt, and R. Van Meter, Surface code quantum computing by lattice surgery, New Journal of Physics 14
2012
Cited alongside, same era.
H. Bombín, Topological codes, in Quantum Error Correction , edited by D. A. Lidar and T. A. Brun (Cambridge University Press, 2013) p. 455–481
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.
2013
Cited alongside, same era.
Later among the works it cites.
P. Panteleev and G. Kalachev, Degenerate Quantum LDPC Codes With Good Finite Length Performance, Quantum 5
2021
Later among the works it cites.
C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum 5
2021
Later among the works it cites.
A. Kubica and M. Vasmer, Single-shot quantum error correction with the three-dimensional subsystem toric code, Nature communications 13
2022
Later among the works it cites.
K. Sahay and B. J. Brown, Decoder for the triangular color code by matching on a möbius strip, PRX Quantum 3
2022
Later among the works it cites.
P. Das, A. Locharla, and C. Jones, Lilliput: a lightweight low-latency lookup-table decoder for near-term quantum error correction, in Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems , ASPLOS ’22 (Association for Computing Machinery, New York, NY, USA, 2022) p. 541–553
2022
Later among the works it cites.
P. Panteleev and G. Kalachev, Asymptotically good quantum and locally testable classical ldpc codes, in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , STOC 2022 (Association for Computing Machinery, New York, NY, USA, 2022) p. 375–388
2022
Later among the works it cites.
A. Leverrier and G. Zemor, Quantum tanner codes, in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Los Alamitos, CA, USA, 2022) pp. 872–883
2022
Later among the works it cites.
O. Higgott, Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching, ACM Transactions on Quantum Computing 3
2022
Later among the works it cites.
M. A. Tremblay, N. Delfosse, and M. E. Beverland, Constant-overhead quantum error correction with thin planar connectivity, Phys. Rev. Lett. 129
2022
Later among the works it cites.
Google Quantum AI, Suppressing quantum errors by scaling a surface code logical qubit, Nature 614
2023
Later among the works it cites.
Y. Wu and L. Zhong, Fusion blossom: Fast mwpm decoders for qec (2023), arXiv:2305.08307 [quant-ph]
2023
Later among the works it cites.
A. Kubica and N. Delfosse, Efficient color code decoders in d ≥ 2 d\geq 2 dimensions from toric code decoders, Quantum 7
2023
Later among the works it cites.
L. Skoric, D. E. Browne, K. M. Barnes, N. I. Gillespie, and E. T. Campbell, Parallel window decoding enables scalable fault tolerant quantum computation, Nature Communications 14
2023
Later among the works it cites.
X. Tan, F. Zhang, R. Chao, Y. Shi, and J. Chen, Scalable surface-code decoders with parallelization in time, PRX Quantum 4
2023
Later among the works it cites.
2023
Later among the works it cites.
W. Liao, Y. Suzuki, T. Tanimoto, Y. Ueno, and Y. Tokunaga, Wit-greedy: hardware system design of weighted iterative greedy decoder for surface code, in Proceedings of the 28th Asia and South Pacific Design Automation Conference (2023) pp. 209–215
2023
Later among the works it cites.
F. Battistel, C. Chamberland, K. Johar, R. W. Overwater, F. Sebastiano, L. Skoric, Y. Ueno, and M. Usman, Real-time decoding for fault-tolerant quantum computing: Progress, challenges and outlook, Nano Futures 7
2023
Later among the works it cites.
I. Dinur, M.-H. Hsieh, T.-C. Lin, and T. Vidick, Good quantum ldpc codes with linear time decoders, in Proceedings of the 55th Annual ACM Symposium on Theory of Computing , STOC 2023 (Association for Computing Machinery, New York, NY, USA, 2023) p. 905–918
2023
Later among the works it cites.
R. Duan, J. Mao, X. Shu, and L. Yin, A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs , in 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Los Alamitos, CA, USA, 2023) pp. 484–492
2023
Later among the works it cites.
J. C. Bridgeman, A. Kubica, and M. Vasmer, Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models, PRX Quantum 5
2024
Later among the works it cites.
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, et al. , Logical quantum processor based on reconfigurable atom arrays, Nature 626
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.
2024
Later among the works it cites.
2024
Later among the works it cites.
A. S. Darmawan, Y. Nakata, S. Tamiya, and H. Yamasaki, Low-depth random clifford circuits for quantum coding against pauli noise using a tensor-network decoder, Phys. Rev. Res. 6
2024
Later among the works it cites.
S. Gu, E. Tang, L. Caha, S. H. Choe, Z. He, and A. Kubica, Single-shot decoding of good quantum ldpc codes, Communications in Mathematical Physics 405
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, Nature Physics 20
2024
Later among the works it cites.
2024
Later among the works it cites.
O. Higgott and C. Gidney, Sparse Blossom: correcting a million errors per core second with minimum-weight matching, Quantum 9
2025
Closest in time.
C. A. Pattison and Q. Nguyen, personal communication (2025)
2025
Closest in time.
B. Haeupler, R. Hladik, V. Rozhon, R. E. Tarjan, and J. Tetek, Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps , in 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Los Alamitos, CA, USA, 2024) pp. 2099–2130
2099
Closest in time.