Fetching the paper…
Reading the bibliography…
We consider the problem of strong (amplitude-wise) simulation of $n$-qubit quantum circuits, and identify a subclass of simulators we call monotone.
Quantum mechanics and path integrals
Richard P Feynman, Albert R Hibbs, and Daniel F Styer · 1965
Earlier work this paper cites.
Gaussian elimination is not optimal
Volker Strassen · 1969
Earlier work this paper cites.
Some exact complexity results for straight-line computations over semirings
Mark Jerrum and Marc Snir · 1982
Earlier work this paper cites.
Time/space trade-offs for reversible computation
Charles H Bennett · 1989
Earlier work this paper cites.
Combinatorial matrix theory
Richard A Brualdi and Herbert John Ryser · 1991
Earlier work this paper cites.
Satisfiability coding lemma
Ramamohan Paturi, Pavel Pudlák, and Francis Zane · 1997
Earlier work this paper cites.
The Heisenberg representation of quantum computers
Daniel Gottesman · 1998
Earlier work this paper cites.
A probabilistic algorithm for k-SAT and constraint satisfaction problems
T Schoning · 1999
Earlier work this paper cites.
Quantum circuits that can be simulated classically in polynomial time
Leslie G Valiant · 2002
Earlier work this paper cites.
Improved simulation of stabilizer circuits
Scott Aaronson and Daniel Gottesman · 2004
Earlier work this paper cites.
An improved exponential-time algorithm for k-SAT
Ramamohan Paturi, Pavel Pudlák, Michael E Saks, and Francis Zane · 2005
Earlier work this paper cites.
A duality between clause width and clause density for SAT
Chris Calabro, Russell Impagliazzo, and Ramamohan Paturi · 2006
Cited alongside, same era.
Simulating quantum computation by contracting tensor networks
Igor L Markov and Yaoyun Shi · 2008
Cited alongside, same era.
Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond
M Nest · 2008
Cited alongside, same era.
Non-identity check remains QMA-complete for short circuits
Zhengfeng Ji and Xiaodi Wu · 2009
Cited alongside, same era.
Simple encoding of a quantum circuit amplitude as a matrix permanent
Terry Rudolph · 2009
Cited alongside, same era.
The permanent of a square matrix
Complexity-theoretic foundations of quantum supremacy experiments
Scott Aaronson and Lijie Chen · 2017
Later among the works it cites.
Tensor network complexity of multilinear maps
Per Austrin, Petteri Kaski, and Kaie Kubjas · 2017
Later among the works it cites.
Simulation of low-depth quantum circuits as complex undirected graphical models
Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, and Hartmut Neven · 2017
Later among the works it cites.
0.5 petabyte simulation of a 45-qubit quantum circuit
Thomas Häner and Damian S Steiger · 2017
Later among the works it cites.
Quantum circuits and low-degree polynomials over
Ashley Montanaro · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
David G Glynn · 2010
Cited alongside, same era.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Cited alongside, same era.
Quantum computing and the entanglement frontier
John Preskill · 2012
Cited alongside, same era.
3-SAT Faster and Simpler—Unique-SAT Bounds for PPSZ Hold in General
Timon Hertli · 2014
Cited alongside, same era.
Improved classical simulation of quantum circuits dominated by Clifford gates
Sergey Bravyi and David Gosset · 2016
Cited alongside, same era.
Trading classical and quantum computational resources
Sergey Bravyi, Graeme Smith, and John A Smolin · 2016
Cited alongside, same era.
Edwin Pednault, John A Gunnels, Giacomo Nannicini, Lior Horesh, Thomas Magerlein, Edgar Solomonik, and Robert Wisnieff · 2017
Later among the works it cites.
Quantum Supremacy and the Complexity of Random Circuit Sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani · 2018
Closest in time.
Characterizing quantum supremacy in near-term devices
Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, John M Martinis, and Hartmut Neven · 2018
Closest in time.
Classical Simulation of Intermediate-size Quantum Circuits: No Imminent Quantum Supremacy from Random Circuit Sampling
Jianxin Chen, Fang Zhang, Mingcheng Chen, Cupjin Huang, Michael Newman, and Yaoyun Shi · 2018
Closest in time.
64-Qubit Quantum Circuit Simulation
Zhaoyun Chen, Qi Zhou, Cheng Xue, Xia Yang, Guangcan Guo, and Guoping Guo · 2018
Closest in time.
Quantum Computing in the NISQ era and beyond
John Preskill · 2018
Closest in time.