Fetching the paper…
Reading the bibliography…
Classical and quantum states can be distinguished by entanglement entropy, which can be viewed as a measure of quantum resources.
1910
Earlier work this paper cites.
S. R. White, Density matrix formulation for quantum renormalization groups, Phys. Rev. Lett. 69
1992
Earlier work this paper cites.
A. Georges, G. Kotliar, W. Krauth, and M. J. Rozenberg, Dynamical mean-field theory of strongly correlated fermion systems and the limit of infinite dimensions, Rev. Mod. Phys. 68
1996
Earlier work this paper cites.
V. Vedral, M. B. Plenio, M. A. Rippin, and P. L. Knight, Quantifying entanglement, Phys. Rev. Lett. 78
1997
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.
W. M. C. Foulkes, L. Mitas, R. J. Needs, and G. Rajagopal, Quantum monte carlo simulations of solids, Rev. Mod. Phys. 73
2001
Earlier work this paper cites.
L. G. Valiant, Quantum circuits that can be simulated classically in polynomial time, SIAM J. Comput. 31
2002
Earlier work this paper cites.
B. M. Terhal and D. P. DiVincenzo, Classical simulation of noninteracting-fermion quantum circuits, Phys. Rev. A 65
2002
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.
A. Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics 303
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.
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.
U. Schollwöck, The density-matrix renormalization group, Rev. Mod. Phys. 77
2005
Earlier work this paper cites.
G. Kotliar, S. Y. Savrasov, K. Haule, V. S. Oudovenko, O. Parcollet, and C. A. Marianetti, Electronic structure calculations with dynamical mean-field theory, Rev. Mod. Phys. 78
2006
Earlier work this paper cites.
S. Anders and H. J. Briegel, Fast simulation of stabilizer circuits using a graph-state representation, Phys. Rev. A 73
2006
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.
D. Gottesman, Identifying stabilizer states (2008), pIRSA:08080052 see, https://pirsa.org
2008
Earlier work this paper cites.
R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, Quantum entanglement, Rev. Mod. Phys. 81
2009
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, 2010)
2010
Earlier work this paper cites.
C.-Y. Huang and F.-L. Lin, Multipartite entanglement measures and quantum criticality from matrix and tensor product states, Phys. Rev. A 81
2010
Earlier work this paper cites.
U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326
2011
Earlier work this paper cites.
A. D. Córcoles, J. M. Gambetta, J. M. Chow, J. A. Smolin, M. Ware, J. Strand, B. L. T. Plourde, and M. Steffen, Process verification of two-qubit quantum gates by randomized benchmarking, Phys. Rev. A 87
2013
Earlier work this paper cites.
V. Veitch, S. A. H. Mousavian, D. Gottesman, and J. Emerson, The resource theory of stabilizer quantum computation, New Journal of Physics 16
2014
Earlier work this paper cites.
M. Howard, J. Wallman, V. Veitch, and J. Emerson, Contextuality supplies the ‘magic’ for quantum computation, Nature 510
2014
Earlier work this paper cites.
R. Koenig and J. A. Smolin, How to efficiently select an arbitrary Clifford group element, Journal of Mathematical Physics 55
2014
Cited alongside, same era.
J. Carlson, S. Gandolfi, F. Pederiva, S. C. Pieper, R. Schiavilla, K. E. Schmidt, and R. B. Wiringa, Quantum monte carlo methods for nuclear physics, Rev. Mod. Phys. 87
2015
Cited alongside, same era.
J. P. F. LeBlanc, A. E. Antipov, F. Becca, I. W. Bulik, G. K.-L. Chan, C.-M. Chung, Y. Deng, M. Ferrero, T. M. Henderson, C. A. Jiménez-Hoyos, E. Kozik, X.-W. Liu, A. J. Millis, N. V. Prokofév, M. Qin, G. E. Scuseria, H. Shi, B. V. Svistunov, L. F. Tocchio, I. S. Tupitsyn, S. R. White, S. Zhang, B.-X. Zheng, Z. Zhu, and E. Gull (Simons Collaboration on the Many-Electron Problem), Solutions of the two-dimensional hubbard model: Benchmarks and results from a wide range of numerical algorithms, Phys. Rev. X 5
2015
Cited alongside, same era.
H. Pashayan, J. J. Wallman, and S. D. Bartlett, Estimating outcome probabilities of quantum circuits using quasiprobabilities, Phys. Rev. Lett. 115
F. Pan, K. Chen, and P. Zhang, Solving the sampling problem of the sycamore quantum circuits, Phys. Rev. Lett. 129
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
C. Oh, Y. Lim, B. Fefferman, and L. Jiang, Classical simulation of boson sampling based on graph structure, Phys. Rev. Lett. 128
2022
Later among the works it cites.
Z.-W. Liu and A. Winter, Many-body quantum magic, PRX Quantum 3
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
S. Bravyi, G. Smith, and J. A. Smolin, Trading classical and quantum computational resources, Phys. Rev. X 6
2016
Cited alongside, same era.
S. Bravyi and D. Gosset, Improved classical simulation of quantum circuits dominated by clifford gates, Phys. Rev. Lett. 116
2016
Cited alongside, same era.
M. Howard and E. Campbell, Application of a resource theory for magic states to fault-tolerant quantum computing, Phys. Rev. Lett. 118
2017
Cited alongside, same era.
A. Nahum, J. Ruhman, S. Vijay, and J. Haah, Quantum entanglement growth under random unitary dynamics, Phys. Rev. X 7
2017
Cited alongside, same era.
M. Hermanns, Entanglement in topological systems (2017), arXiv:1702.01525 [cond-mat.str-el]
2017
Cited alongside, same era.
R. P. Feynman, Simulating physics with computers, in Feynman and computation (cRc Press, 2018) pp. 133–153
2018
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.
M. Heinrich and D. Gross, Robustness of Magic and Symmetries of the Stabiliser Polytope, Quantum 3
2019
Cited alongside, same era.
S. True and A. Hamma, Transitions in Entanglement Complexity in Random Circuits, Quantum 6
2022
Later among the works it cites.
L. Leone, S. F. E. Oliviero, and A. Hamma, Stabilizer rényi entropy, Phys. Rev. Lett. 128
2022
Later among the works it cites.
X. Qian and M. Qin, From tree tensor network to multiscale entanglement renormalization ansatz, Phys. Rev. B 105
2022
Later among the works it cites.
T. Xiang, Density Matrix and Tensor Network Renormalization (Cambridge University Press, 2023)
2023
Later among the works it cites.
T. Ayral, T. Louvet, Y. Zhou, C. Lambert, E. M. Stoudenmire, and X. Waintal, Density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity, PRX Quantum 4
2023
Later among the works it cites.
Y. Kim, A. Eddins, S. Anand, K. X. Wei, E. Van Den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, et al. , Evidence for the utility of quantum computing before fault tolerance, Nature 618
2023
Later among the works it cites.
2023
Later among the works it cites.
G. Lami and M. Collura, Nonstabilizerness via perfect pauli sampling of matrix product states, Phys. Rev. Lett. 131
2023
Later among the works it cites.
S. Piemontese, T. Roscilde, and A. Hamma, Entanglement complexity of the rokhsar-kivelson-sign wavefunctions, Phys. Rev. B 107
2023
Later among the works it cites.
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.
P. S. Tarabunga, E. Tirrito, M. C. Bañuls, and M. Dalmonte, Nonstabilizerness via matrix product states in the pauli basis, Phys. Rev. Lett. 133
2024
Closest in time.
E. Tirrito, P. S. Tarabunga, G. Lami, T. Chanda, L. Leone, S. F. E. Oliviero, M. Dalmonte, M. Collura, and A. Hamma, Quantifying nonstabilizerness through entanglement spectrum flatness, Phys. Rev. A 109
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.