Fetching the paper…
Reading the bibliography…
Quantum computing experiments have made remarkable progress in demonstrating key components of quantum error correction, a prerequisite for scalable quantum computation.
P. Jordan and E. Wigner, Über das paulische Äquivalenzverbot, Zeitschrift für Physik 47
1928
Earlier work this paper cites.
A. Hocquenghem, Codes correcteurs d’erreurs, Chiffres 2
1959
Earlier work this paper cites.
R. C. Bose and D. K. Ray-Chaudhuri, On a class of error correcting binary group codes, Information and Control 3
1960
Earlier work this paper cites.
C. L. Lawson and R. J. Hanson, Solving Least Squares Problems (Prentice-Hall, Englewood Cliffs, NJ, 1974) chapter 23, p. 161
1974
Earlier work this paper cites.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes , North-Holland Mathematical Library, Vol. 16 (North-Holland, Amsterdam, 1977)
1977
Earlier work this paper cites.
P. Shor, Fault-tolerant quantum computation, in Proceedings of 37th Conference on Foundations of Computer Science (1996) pp. 56–65
1996
Earlier work this paper cites.
A. Calderbank, E. Rains, P. Shor, and N. Sloane, Quantum error correction via codes over gf(4), in Proceedings of IEEE International Symposium on Information Theory (1997) pp. 292–
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.
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.
S. B. Bravyi and A. Y. Kitaev, Fermionic quantum computation, Annals of Physics 298
2002
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.
F. Verstraete and J. I. Cirac, Mapping local hamiltonians of fermions to local hamiltonians of spins, Journal of Statistical Mechanics: Theory and Experiment 2005
2005
Earlier work this paper cites.
B. Eastin and E. Knill, Restrictions on transversal encoded quantum gate sets, Phys. Rev. Lett. 102
2009
Earlier work this paper cites.
M. J. Gibbons, C. D. Hamley, C.-Y. Shih, and M. S. Chapman, Nondestructive fluorescent state detection of single neutral atom qubits, Physical Review Letters 106
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.
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. A. Kovalev and L. P. Pryadko, Improved quantum hypergraph-product ldpc codes, in 2012 IEEE International Symposium on Information Theory Proceedings (2012) pp. 348–352
2012
Earlier work this paper cites.
S. Bravyi and R. König, Classification of topologically protected gates for local stabilizer codes, Phys. Rev. Lett. 110
2013
Earlier work this paper cites.
A. A. Kovalev and L. P. Pryadko, Quantum kronecker sum-product low-density parity-check codes with finite rate, Phys. Rev. A 88
2013
Earlier work this paper cites.
A. M. Stephens, Fault-tolerant thresholds for quantum error correction with the surface code, Phys. Rev. A 89
2014
Earlier work this paper cites.
J.-P. Tillich and G. Zemor, Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Transactions on Information Theory 60
2014
Earlier work this paper cites.
A. Bocharov, M. Roetteler, and K. M. Svore, Efficient synthesis of universal repeat-until-success quantum circuits, Phys. Rev. Lett. 114
2015
Earlier work this paper cites.
T. J. Yoder, R. Takagi, and I. L. Chuang, Universal fault-tolerant gates on concatenated stabilizer codes, Phys. Rev. X 6
2016
Earlier work this paper cites.
N. J. Ross and P. Selinger, Optimal ancilla-free clifford+t approximation of z-rotations, Quantum Info. Comput. 16
2016
Earlier work this paper cites.
V. Kliuchnikov, D. Maslov, and M. Mosca, Practical approximation of single-qubit unitaries by single-qubit quantum clifford and t circuits, IEEE Transactions on Computers 65
2016
Earlier work this paper cites.
E. T. Campbell, B. M. Terhal, and C. Vuillot, Roads towards fault-tolerant universal quantum computation, Nature 549
2017
Earlier work this paper cites.
H. Bernien, S. Schwartz, A. Keesling, H. Levine, A. Omran, H. Pichler, S. Choi, A. S. Zibrov, M. Endres, M. Greiner, V. Vuletić, and M. D. Lukin, Probing many-body dynamics on a 51-atom quantum simulator, Nature 551
2017
Earlier work this paper cites.
J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2
2018
Earlier work this paper cites.
I. D. Kivlichan, J. McClean, N. Wiebe, C. Gidney, A. Aspuru-Guzik, G. K.-L. Chan, and R. Babbush, Quantum simulation of electronic structure with linear depth and connectivity, Phys. Rev. Lett. 120
2018
Earlier work this paper cites.
C. Gidney, Halving the cost of quantum addition, Quantum 2
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, Proceedings of the National Academy of Sciences 115
2018
Earlier work this paper cites.
D. Litinski, A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery, Quantum 3
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
E. Campbell, Random compiler for fast hamiltonian simulation, Phys. Rev. Lett. 123
2019
Earlier work this paper cites.
C. Gross, Qubit readout boost, Nature Physics 15
2019
Earlier work this paper cites.
J. Roffe, D. R. White, S. Burton, and E. Campbell, Decoding across the quantum low-density parity-check code landscape, Physical Review Research 2
2020
Cited alongside, same era.
E. T. Campbell, Early fault-tolerant simulations of the hubbard model, Quantum Science and Technology 7
2021
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, PRX Quantum 2
2021
Cited alongside, same era.
S. Ebadi, T. T. Wang, H. Levine, A. Keesling, G. Semeghini, A. Omran, D. Bluvstein, R. Samajdar, H. Pichler, W. W. Ho, S. Choi, S. Sachdev, M. Greiner, V. Vuletić, and M. D. Lukin, Quantum phases of matter on a 256-atom programmable quantum simulator, Nature 595
2021
Cited alongside, same era.
N. P. Breuckmann and J. N. Eberhardt, Quantum low-density parity-check codes, PRX Quantum 2
R. Acharya, A. M. Sundaresan, K. J. Satzinger, L. E. Bohuslav, C. G. Tahan, and et al., Suppressing quantum errors by scaling a surface code logical qubit, Nature 624
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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2021
Cited alongside, same era.
2021
Cited alongside, same era.
C. Derby, J. Klassen, J. Bausch, and T. Cubitt, Compact fermion to qubit mappings, Phys. Rev. B 104
2021
Cited alongside, same era.
2021
Cited alongside, same era.
C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum 5
2021
Cited alongside, same era.
A. J. Daley, I. Bloch, C. Kokail, S. Flannigan, N. Pearson, M. Troyer, and P. Zoller, Practical quantum advantage in quantum simulation, Nature 607
2022
Cited alongside, same era.
L. Lin and Y. Tong, Heisenberg-limited ground-state energy estimation for early fault-tolerant quantum computers, PRX Quantum 3
2022
Cited alongside, same era.
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, A quantum processor based on coherent transport of entangled atom arrays, Nature 604
2022
Cited alongside, same era.
L. Yang, Y. Wu, and L. Zhong, Parallel Minimum-Weight Parity Factor Decoding for Quantum Error Correction , in 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE Computer Society, Los Alamitos, CA, USA, 2024) pp. 581–582
2024
Later among the works it cites.
F. Gyger, M. Ammenwerth, R. Tao, H. Timme, S. Snigirev, I. Bloch, and J. Zeiher, Continuous operation of large-scale atom arrays in optical lattices, Phys. Rev. Res. 6
2024
Later among the works it cites.
P. Sales Rodriguez, J. M. Robinson, P. N. Jepsen, Z. He, C. Duckering, C. Zhao, K.-H. Wu, J. Campo, K. Bagnall, M. Kwon, T. Karolyshyn, P. Weinberg, M. Cain, S. J. Evered, A. A. Geim, M. Kalinowski, S. H. Li, T. Manovitz, J. Amato-Grill, J. I. Basham, L. Bernstein, B. Braverman, A. Bylinskii, A. Choukri, R. J. DeAngelo, F. Fang, C. Fieweger, P. Frederick, D. Haines, M. Hamdan, J. Hammett, N. Hsu, M.-G. Hu, F. Huber, N. Jia, D. Kedar, M. Kornjač, F. Liu, J. Long, J. Lopatin, P. L. S. Lopes, X.-Z. Luo, T. Macrì, O. Marković, L. A. Martínez-Martínez, X. Meng, S. Ostermann, E. Ostroumov, D. Paquette, Z. Qiang, V. Shofman, A. Singh, M. Singh, N. Sinha, H. Thoreen, N. Wan, Y. Wang, D. Waxman-Lenz, T. Wong, J. Wurtz, A. Zhdanov, L. Zheng, M. Greiner, A. Keesling, N. Gemelke, V. Vuletić, T. Kitagawa, S.-T. Wang, D. Bluvstein, M. D. Lukin, A. Lukin, H. Zhou, and S. H. Cantú, Experimental demonstration of logical magic state distillation, Nature 10.1038/s41586-025-09367-3 (2025)
2025
Closest in time.
2025
Closest in time.
J. Preskill, Beyond nisq: The megaquop machine, ACM Transactions on Quantum Computing 10.1145/3723153 (2025)
2025
Closest in time.
R. Weiss, A. Baroni, J. Carlson, and I. Stetcu, Solving reaction dynamics with quantum computing algorithms, Phys. Rev. C 111
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
R. Toshio, Y. Akahoshi, J. Fujisaki, H. Oshima, S. Sato, and K. Fujii, Practical quantum advantage on partially fault-tolerant quantum computer, Phys. Rev. X 15
2025
Closest in time.
Y. Akahoshi, R. Toshio, J. Fujisaki, H. Oshima, S. Sato, and K. Fujii, Compilation of trotter-based time evolution for partially fault-tolerant quantum computing architecture, PRX Quantum 6
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
H. Zhou, C. Duckering, C. Zhao, D. Bluvstein, M. Cain, A. Kubica, S.-T. Wang, and M. D. Lukin, Resource analysis of low-overhead transversal architectures for reconfigurable atom arrays, in Proceedings of the 52nd Annual International Symposium on Computer Architecture , ISCA ’25 (Association for Computing Machinery, New York, NY, USA, 2025) p. 1432–1448
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
S. Yang and R. Calderbank, Spatially-coupled qldpc codes (2025), arXiv:2305.00137 [quant-ph]
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
J. Robledo-Moreno, M. Motta, H. Haas, A. Javadi-Abhari, P. Jurcevic, W. Kirby, S. Martiel, K. Sharma, S. Sharma, T. Shirakawa, I. Sitdikov, R.-Y. Sun, K. J. Sung, M. Takita, M. C. Tran, S. Yunoki, and A. Mezzacapo, Chemistry beyond the scale of exact diagonalization on a quantum-centric supercomputer, Science Advances 11
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
O. Higgott and C. Gidney, Sparse Blossom: correcting a million errors per core second with minimum-weight matching, Quantum 9
2025
Closest in time.
2025
Closest in time.
H. J. Manetsch, G. Nomura, E. Bataille, X. Lv, K. H. Leung, and M. Endres, A tweezer array with 6,100 highly coherent atomic qubits, Nature 647
2025
Closest in time.
Gurobi Optimization, LLC, Gurobi Optimizer Reference Manual (2026)
2026
Closest in time.