Fast surgery for quantum LDPC codes

C. A. Weibel, An Introduction to Homological Algebra , Cambridge Studies in Advanced Mathematics (Cambridge University Press, 1994)

1994

Earlier work this paper cites.

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

2002

Earlier work this paper cites.

D. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, New Journal of Physics 14

2012

Earlier work this paper cites.

J.-P. Tillich and G. Zémor, IEEE Transactions on Information Theory 60

2014

Earlier work this paper cites.

S. Evra and T. Kaufman, in Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing , STOC ’16 (Association for Computing Machinery, New York, NY, USA, 2016) p. 36–48

2016

Earlier work this paper cites.

N. P. Breuckmann, C. Vuillot, E. Campbell, A. Krishna, and B. M. Terhal, Quantum Science and Technology 2

2017

Earlier work this paper cites.

D. Litinski, Quantum 3

2019

Earlier work this paper cites.

E. T. Campbell, Quantum Science and Technology 4

2019

Earlier work this paper cites.

W. Zeng and L. P. Pryadko, Phys. Rev. Lett. 122

2019

Earlier work this paper cites.

J. Yoneda, W. Huang, M. Feng, C. H. Yang, K. W. Chan, T. Tanttu, W. Gilbert, R. C. C. Leon, F. E. Hudson, K. M. Itoh, A. Morello, S. D. Bartlett, A. Laucht, A. Saraiva, and A. S. Dzurak, Nature Communications 12

2021

Earlier work this paper cites.

H. Bombin, I. H. Kim, D. Litinski, N. Nickerson, M. Pant, F. Pastawski, S. Roberts, and T. Rudolph, “Interleaving: Modular architectures for fault-tolerant photonic quantum computing,” (2021), arXiv:2103.08612 [quant-ph]

Original

2021

Earlier work this paper cites.

A. Grospellier, L. Grouès, A. Krishna, and A. Leverrier, Quantum 5

2021

Earlier work this paper cites.

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, Nature 604

2022

Earlier work this paper cites.

P. Panteleev and G. Kalachev (Association for Computing Machinery, New York, NY, USA, 2022) p. 375–388

2022

Earlier work this paper cites.

A. Leverrier and G. Zémor, in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (2022) pp. 872–883

2022

Cited alongside, same era.

M. A. Tremblay, N. Delfosse, and M. E. Beverland, Physical Review Letters 129

2022

Cited alongside, same era.

L. Z. Cohen, I. H. Kim, S. D. Bartlett, and B. J. Brown, Science Advances 8

2022

Cited alongside, same era.

J. Roffe, “LDPC: Python tools for low density parity check codes,” (2022)

2022

Cited alongside, same era.

M. Malinowski, D. Allcock, and C. Ballance, PRX Quantum 4

2023

Cited alongside, same era.

A. O. Quintavalle, P. Webster, and M. Vasmer, Quantum 7

2023

Cited alongside, same era.

I. Dinur, T.-C. Lin, and T. Vidick, in 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) (2024) pp. 379–385

2024

Later among the works it cites.

C. Gidney, “How to factor 2048 bit rsa integers with less than a million noisy qubits,” (2025), arXiv:2505.15917 [quant-ph]

Original

2025

Closest in time.

B. Ide, M. G. Gowda, P. J. Nadkarni, and G. Dauphinais, Phys. Rev. X 15

2025

Closest in time.

Q. Xu, H. Zhou, G. Zheng, D. Bluvstein, J. P. B. Ataides, M. D. Lukin, and L. Jiang, Phys. Rev. X 15

2025

Closest in time.

H. Zhou, C. Zhao, M. Cain, D. Bluvstein, N. Maskara, C. Duckering, H.-Y. Hu, S.-T. Wang, A. Kubica, and M. D. Lukin, “Low-overhead transversal fault tolerance for universal quantum computation,” (2025), arXiv:2406.17653 [quant-ph]

Original

2025

Closest in time.