Fetching the paper…
Reading the bibliography…
Classical simulation of quantum computation is necessary for studying the numerical behavior of quantum algorithms, as there does not yet exist a large viable quantum computer on which to perform numerical tests.
States, Effects, and Operations Fundamental Notions of Quantum Theory
Kraus K, Böhm A, Dollard JD, Wootters WH, editors · 1983
Earlier work this paper cites.
Complexity of Finding Embeddings in a K-tree
Arnborg S, Corneil DG, Proskurowski A · 1987
Earlier work this paper cites.
Graph minors. X. Obstructions to tree-decomposition
Robertson N, Seymour PD · 1991
Earlier work this paper cites.
arXiv:quant-ph/9807006
Gottesman D. The Heisenberg Representation of Quantum Computers; 1998 · 1998
Earlier work this paper cites.
Quantum Computers That Can Be Simulated Classically in Polynomial Time
Valiant LG · 2001
Earlier work this paper cites.
Classical simulation of noninteracting-fermion quantum circuits
Terhal BM, DiVincenzo DP · 2002
Earlier work this paper cites.
Improved Simulation of Stabilizer Circuits
Aaronson S, Gottesman D · 2004
Earlier work this paper cites.
A Complete Anytime Algorithm for Treewidth
Gogate V, Dechter R · 2004
Earlier work this paper cites.
Graph-based simulation of quantum computation in the density matrix representation
Viamontes GF, Markov IL, Hayes JP · 2005
Earlier work this paper cites.
Simulating quantum computation by contracting tensor networks
Markov IL, Shi Y · 2005
Earlier work this paper cites.
arXiv:quant-ph/0607151
Rudiak-Gould B. The sum-over-histories formulation of quantum computing; 2006 · 2006
Earlier work this paper cites.
Fault-Tolerant Quantum Computation with Long-Range Correlated Noise
Aharonov D, Kitaev A, Preskill J · 2006
Earlier work this paper cites.
Qcmpi: A Parallel Environment for Quantum Computing
Tabakin F, Julia-Diaz B · 2008
Earlier work this paper cites.
Scalable protocol for identification of correctable codes
Silva M, Magesan E, Kribs DW, Emerson J · 2008
Earlier work this paper cites.
Treewidth computations I. Upper bounds
Bodlaender HL, Koster AMCA · 2009
Earlier work this paper cites.
Models of quantum computation and quantum programming languages
Miszczak JA · 2010
Earlier work this paper cites.
Approximation Algorithms for Treewidth
Amir E · 2010
Earlier work this paper cites.
{QCWAVE} – A Mathematica quantum computer simulation update
Tabakin F, Juliá-Díaz B · 2011
Earlier work this paper cites.
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen MA, Chuang IL · 2011
Earlier work this paper cites.
Treewidth computations II. Lower bounds
Bodlaender HL, Koster AMCA · 2011
Earlier work this paper cites.
Simulation of electronic structure Hamiltonians using quantum computers
Whitfield JD, Biamonte J, Aspuru-Guzik A · 2011
Cited alongside, same era.
Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
Geller MR, Zhou Z · 2013
Cited alongside, same era.
Quipu: High-performance simulation of quantum circuits using stabilizer frames
García HJ, Markov IL · 2013
Cited alongside, same era.
Sufficient Condition on Noise Correlations for Scalable Quantum Computing
Preskill J · 2013
Cited alongside, same era.
Wecker D, Svore KM. LIQUi | > |> : A Software Design Architecture and Domain-Specific Language for Quantum Computing; 2014 · 2014
Cited alongside, same era.
Low-distance surface codes under realistic quantum noise
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates
Bravyi S, Gosset D · 2016
Later among the works it cites.
Available from: http://www.osti.gov/scitech/servlets/purl/1340180
McCaskey AJ. Tensor Network Quantum Virtual Machine (TNQVM); 2016 · 2016
Later among the works it cites.
The theory of variational hybrid quantum-classical algorithms
McClean JR, Romero J, Babbush R, Aspuru-Guzik A · 2016
Later among the works it cites.
Training a quantum optimizer
Wecker D, Hastings MB, Troyer M · 2016
Later among the works it cites.
Yen-Yu Lin C, Zhu Y. Performance of QAOA on Typical Instances of Constraint Satisfaction Problems with Bounded Degree; 2016 · 2016
Later among the works it cites.
Scalable Quantum Simulation of Molecular Energies
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Tomita Y, Svore KM · 2014
Cited alongside, same era.
A practical introduction to tensor networks: Matrix product states and projected entangled pair states
Orús R · 2014
Cited alongside, same era.
Advances on tensor network theory: Symmetries, fermions, entanglement, and holography
Orús R · 2014
Cited alongside, same era.
Faster identification of optimal contraction sequences for tensor networks
Pfeifer RNC, Haegeman J, Verstraete F · 2014
Cited alongside, same era.
A variational eigenvalue solver on a photonic quantum processor
Peruzzo A, McClean J, Shadbolt P, Yung MH, Zhou XQ, Love PJ, et al · 2014
Cited alongside, same era.
From transistor to trapped-ion computers for quantum chemistry
Yung MH, Casanova J, Mezzacapo A, McClean J, Lamata L, Aspuru-Guzik A, et al · 2014
Cited alongside, same era.
Farhi E, Goldstone J, Gutmann S. A Quantum Approximate Optimization Algorithm; 2014 · 2014
Cited alongside, same era.
O’Malley PJJ, Babbush R, Kivlichan ID, Romero J, McClean JR, Barends R, et al · 2016
Later among the works it cites.
Boixo S, Isakov SV, Smelyanskiy VN, Neven H. Simulation of low-depth quantum circuits as complex undirected graphical models; 2017 · 2017
Closest in time.
Childs AM, Maslov D, Nam Y, Ross NJ, Su Y. Toward the first quantum simulation with quantum speedup; 2017 · 2017
Closest in time.
Pednault E, Gunnels JA, Nannicini G, Horesh L, Magerlein T, Solomonik E, et al.. Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits; 2017 · 2017
Closest in time.
Häner T, Steiger DS. 0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit; 2017 · 2017
Closest in time.
Simulation of Quantum Circuits via Stabilizer Frames
García HJ, Markov IL · 2017
Closest in time.
Ran SJ, Tirrito E, Peng C, Chen X, Su G, Lewenstein M. Review of Tensor Network Contraction Approaches; 2017 · 2017
Closest in time.
Giacomo Guerreschi G, Smelyanskiy M. Practical optimization for hybrid quantum-classical algorithms; 2017 · 2017
Closest in time.
Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states
McClean JR, Kimchi-Schwartz ME, Carter J, de Jong WA · 2017
Closest in time.
McClean JR, Kivlichan ID, Sung KJ, Steiger DS, Cao Y, Dai C, et al.. OpenFermion: The Electronic Structure Package for Quantum Computers; 2017 · 2017
Closest in time.
Characterizing quantum supremacy in near-term devices
Boixo S, Isakov SV, Smelyanskiy VN, Babbush R, Ding N, Jiang Z, et al · 2018
Closest in time.
Chen J, Zhang F, Huang C, Newman M, Shi Y. Classical Simulation of Intermediate-Size Quantum Circuits; 2018 · 2018
Closest in time.
Bouland A, Fefferman B, Nirkhe C, Vazirani U. Quantum Supremacy and the Complexity of Random Circuit Sampling; 2018 · 2018
Closest in time.
Chen ZY, Zhou Q, Xue C, Yang X, Guo GC, Guo GP. 64-Qubit Quantum Circuit Simulation; 2018 · 2018
Closest in time.