Fetching the paper…
Reading the bibliography…
Determining the quantum-classical boundary between quantum circuits which can be efficiently simulated classically and those which cannot remains a fundamental question.
D. M. Ceperley and B. J. Alder, Ground state of the electron gas by a stochastic method, Phys. Rev. Lett. 45
1980
Earlier work this paper cites.
D. Gottesman, The heisenberg representation of quantum computers (1998), arXiv:quant-ph/9807006 [quant-ph]
1998
Earlier work this paper cites.
V. F. Kolchin, Random graphs , 53 (Cambridge University Press, 1999)
1999
Earlier work this paper cites.
G. Nebe, E. M. Rains, and N. J. Sloane, The invariants of the clifford groups, Designs, Codes and Cryptography 24
2001
Earlier work this paper cites.
G. Vidal, Efficient classical simulation of slightly entangled quantum computations, Phys. Rev. Lett. 91
2003
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.
G. Vidal, Efficient simulation of one-dimensional quantum many-body systems, Phys. Rev. Lett. 93
2004
Earlier work this paper cites.
D. Fattal, T. S. Cubitt, Y. Yamamoto, S. Bravyi, and I. L. Chuang, Entanglement in the stabilizer formalism (2004), arXiv:quant-ph/0406168 [quant-ph]
2004
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal clifford gates and noisy ancillas, Physical Review A—Atomic, Molecular, and Optical Physics 71
2005
Earlier work this paper cites.
R. Jozsa and A. Miyake, Matchgates and classical simulation of quantum circuits, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 464
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
E. T. Campbell, H. Anwar, and D. E. Browne, Magic-state distillation in all prime dimensions using quantum reed-muller codes, Physical Review X 2
2012
Earlier work this paper cites.
R. Orús, A practical introduction to tensor networks: Matrix product states and projected entangled pair states, Annals of Physics 349
2014
Earlier work this paper cites.
R. M. Martin, L. Reining, and D. M. Ceperley, Interacting electrons (Cambridge University Press, 2016)
2016
Earlier work this paper cites.
R. P. Feynman, Simulating physics with computers, in Feynman and computation (cRc Press, 2018) pp. 133–153
2018
Cited alongside, same era.
A. Bouland, B. Fefferman, C. Nirkhe, and U. Vazirani, On the complexity and verification of quantum random circuit sampling, Nature Physics 15
2019
Cited alongside, same era.
S. Bravyi, D. Browne, P. Calpin, E. Campbell, D. Gosset, and M. Howard, Simulation of quantum circuits by low-rank stabilizer decompositions, Quantum 3
2019
Cited alongside, same era.
Y. Zhou, E. M. Stoudenmire, and X. Waintal, What limits the simulation of quantum computers?, Phys. Rev. X 10
2020
Cited alongside, same era.
2021
T. Begušić, J. Gray, and G. K.-L. Chan, Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance, Science Advances 10
2024
Closest in time.
J. Tindall, M. Fishman, E. M. Stoudenmire, and D. Sels, Efficient tensor network simulation of ibm’s eagle kicked ising experiment, PRX Quantum 5
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum 5
2021
Cited alongside, same era.
J. C. Napp, R. L. La Placa, A. M. Dalzell, F. G. S. L. Brandão, and A. W. Harrow, Efficient classical simulation of random shallow 2d quantum circuits, Phys. Rev. X 12
2022
Cited alongside, same era.
F. Pan, K. Chen, and P. Zhang, Solving the sampling problem of the sycamore quantum circuits, Phys. Rev. Lett. 129
2022
Cited alongside, same era.
F. Pan and P. Zhang, Simulation of quantum circuits using the big-batch tensor network method, Phys. Rev. Lett. 128
2022
Cited alongside, same era.
A. Kissinger and J. van de Wetering, Simulating quantum circuits with zx-calculus reduced stabiliser decompositions, Quantum Science and Technology 7
2022
Cited alongside, same era.
H. Pashayan, O. Reardon-Smith, K. Korzekwa, and S. D. Bartlett, Fast estimation of outcome probabilities for quantum circuits, PRX Quantum 3
2022
Cited alongside, same era.
D. Hangleiter and J. Eisert, Computational advantage of quantum random sampling, Reviews of Modern Physics 95
2023
Cited alongside, same era.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
M. Bejan, C. McLauchlan, and B. Béri, Dynamical magic transitions in monitored clifford+ t t circuits, PRX Quantum 5
2024
Closest in time.
2024
Closest in time.
G. Lami and M. Collura, Unveiling the stabilizer group of a matrix product state, Phys. Rev. Lett. 133
2024
Closest in time.
A. F. Mello, A. Santini, and M. Collura, Clifford-dressed variational principles for precise loschmidt echoes, Physical Review A 111
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
A. C. Nakhl, B. Harper, M. West, N. Dowling, M. Sevior, T. Quella, and M. Usman, Stabilizer tensor networks with magic state injection, Phys. Rev. Lett. 134
2025
Closest in time.