Classically estimating observables of noiseless quantum circuits

A. S. Nemirovskij and D. B. Yudin, Problem complexity and method efficiency in optimization (1983)

1983

Earlier work this paper cites.

M. R. Jerrum, L. G. Valiant, and V. V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoretical computer science 43

1986

Earlier work this paper cites.

D. Gottesman, The heisenberg representation of quantum computers, talk at, in International Conference on Group Theoretic Methods in Physics (Citeseer, 1998)

1998

Earlier work this paper cites.

S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Physical Review A 70

2004

Earlier work this paper cites.

R. D. Somma, Quantum computation, complexity, and many-body physics, arXiv preprint quant-ph/0512209 (2005)

2005

Earlier work this paper cites.

Y.-Y. Shi, L.-M. Duan, and G. Vidal, Classical simulation of quantum many-body systems with a tree tensor network, Phys. Rev. A 74

2006

Earlier work this paper cites.

R. Somma, H. Barnum, G. Ortiz, and E. Knill, Efficient solvability of Hamiltonians and limits on the power of some quantum computational models, Physical Review Letters 97

2006

Earlier work this paper cites.

I. L. Markov and Y. Shi, Simulating quantum computation by contracting tensor networks, SIAM Journal on Computing 38

2008

Earlier work this paper cites.

M. Nest, Classical simulation of quantum computation, the gottesman-knill theorem, and slightly beyond, arXiv preprint arXiv:0811.0898 (2008)

Original

2008

Earlier work this paper cites.

S. Singh, R. N. C. Pfeifer, and G. Vidal, Tensor network decompositions in the presence of a global symmetry, Phys. Rev. A 82

2010

Earlier work this paper cites.

V. Galitski, Quantum-to-classical correspondence and hubbard-stratonovich dynamical systems: A lie-algebraic approach, Phys. Rev. A 84

2011

Earlier work this paper cites.

S. Bravyi and D. Gosset, Improved classical simulation of quantum circuits dominated by clifford gates, Phys. Rev. Lett. 116

2016

Earlier work this paper cites.

J. Biamonte and V. Bergholm, Tensor networks in a nutshell, arXiv preprint arXiv:1708.00006 (2017)

Original

2017

Earlier work this paper cites.

G. Carleo and M. Troyer, Solving the quantum many-body problem with artificial neural networks, Science 355

2017

Earlier work this paper cites.

D. A. Roberts and B. Yoshida, Chaos and complexity by design, Journal of High Energy Physics 2017

2017

Earlier work this paper cites.

J. Hauschild and F. Pollmann, Efficient numerical simulations with tensor networks: Tensor network python (tenpy), SciPost Physics Lecture Notes , 005 (2018)

2018

Earlier work this paper cites.

J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, Barren plateaus in quantum neural network training landscapes, Nature Communications 9

2018

Earlier work this paper cites.

S. Aaronson and S. Gunn, On the classical hardness of spoofing linear cross-entropy benchmarking, arXiv preprint arXiv:1910.12085 https://doi.org/10.48550/arXiv.1910.12085 (2019)

Original

2019

Earlier work this paper cites.

Y. Pang, T. Hao, A. Dugad, Y. Zhou, and E. Solomonik, Efficient 2d tensor network simulation of quantum systems, in SC20: International Conference for High Performance Computing, Networking, Storage and Analysis (IEEE, 2020) pp. 1–14

Original

2020

Earlier work this paper cites.

R. Belyansky, P. Bienias, Y. A. Kharkov, A. V. Gorshkov, and B. Swingle, Minimal model for fast scrambling, Physical Review Letters 125

2020

Earlier work this paper cites.

W.-T. Kuo, A. Akhtar, D. P. Arovas, and Y.-Z. You, Markovian entanglement dynamics under locally scrambled quantum evolution, Physical Review B 101

2020

Cited alongside, same era.

H.-Y. Huang, R. Kueng, and J. Preskill, Predicting many properties of a quantum system from very few measurements, Nature Physics 16

2020

Cited alongside, same era.

M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, and P. J. Coles, Variational quantum algorithms, Nature Reviews Physics 3

2021

Cited alongside, same era.

A. Pesah, M. Cerezo, S. Wang, T. Volkoff, A. T. Sornborger, and P. J. Coles, Absence of barren plateaus in quantum convolutional neural networks, Physical Review X 11

2021

Cited alongside, same era.

K. Bharti, T. Haug, V. Vedral, and L.-C. Kwek, Noisy intermediate-scale quantum algorithm for semidefinite programming, Physical Review A 105

A. Letcher, S. Woerner, and C. Zoufal, Tight and efficient gradient bounds for parameterized quantum circuits, arXiv preprint arXiv:2309.12681 (2023)

Original

2023

Later among the works it cites.

N. A. Nemkov, E. O. Kiktenko, and A. K. Fedorov, Fourier expansion in variational quantum algorithms, Phys. Rev. A 108

2023

Later among the works it cites.

T. Begušić and G. K. Chan, Fast classical simulation of evidence for the utility of quantum computing before fault tolerance, arXiv preprint arXiv:2306.16372 (2023)

Original

2023

Later among the works it cites.

M. Cerezo, M. Larocca, D. García-Martín, N. L. Diaz, P. Braccia, E. Fontana, M. S. Rudolph, P. Bermejo, A. Ijaz, S. Thanasilp, et al. , Does provable absence of barren plateaus imply classical simulability? or, why we need to rethink variational quantum computing, arXiv preprint arXiv:2312.09121 (2023)

Original

2023

Later among the works it cites.