Fetching the paper…
Reading the bibliography…
We describe and analyze algorithms for classically simulating measurement of an $n$-qubit quantum state $\psi$ in the standard basis, that is, sampling a bit string $x$ from the probability distribution $|\langle x|\psi\rangle|^2$.
Crystal statistics. i. a two-dimensional model with an order-disorder transition
Lars Onsager · 1944
Earlier work this paper cites.
The statistics of dimers on a lattice: I. the number of dimer arrangements on a quadratic lattice
Pieter W Kasteleyn · 1961
Earlier work this paper cites.
On the computational complexity of Ising spin glass models
Francisco Barahona · 1982
Earlier work this paper cites.
Geometric bounds for eigenvalues of Markov chains
Persi Diaconis and Daniel Stroock · 1991
Earlier work this paper cites.
Approximating the permanent of graphs with large factors
Paul Dagum and Michael Luby · 1992
Earlier work this paper cites.
Polynomial-time approximation algorithms for the ising model
Mark Jerrum and Alistair Sinclair · 1993
Earlier work this paper cites.
Semiclassical Fourier transform for quantum computation
Robert B Griffiths and Chi-Sheng Niu · 1996
Earlier work this paper cites.
Stabilizer codes and quantum error correction
Daniel Gottesman · 1997
Earlier work this paper cites.
Quantum codes on a lattice with boundary
Sergey B Bravyi and A Yu Kitaev · 1998
Earlier work this paper cites.
Quantum circuits that can be simulated classically in polynomial time
Leslie G. Valiant · 2002
Earlier work this paper cites.
Classical simulation of noninteracting-fermion quantum circuits
Barbara M Terhal and David P DiVincenzo · 2002
Earlier work this paper cites.
Classical and quantum computation
Alexei Yu Kitaev, Alexander Shen, Mikhail N Vyalyi, and Mikhail N Vyalyi · 2002
Earlier work this paper cites.
Measurement-based quantum computation on cluster states
Robert Raussendorf, Daniel E Browne, and Hans J Briegel · 2003
Earlier work this paper cites.
Efficient classical simulation of slightly entangled quantum computations
Guifré Vidal · 2003
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A Yu Kitaev · 2003
Earlier work this paper cites.
Lagrangian representation for fermionic linear optics
Sergey Bravyi · 2005
Earlier work this paper cites.
On the simulation of quantum circuits
Richard Jozsa · 2006
Cited alongside, same era.
Matrix product state representations
David Perez-Garcia, Frank Verstraete, Michael M Wolf, and J Ignacio Cirac · 2006
Cited alongside, same era.
An area law for one dimensional quantum systems
Matthew B. Hastings · 2007
Cited alongside, same era.
Measurement-based quantum computation with the toric code states
Sergey Bravyi and Robert Raussendorf · 2007
Cited alongside, same era.
Simulating quantum computation by contracting tensor networks
Igor L Markov and Yaoyun Shi · 2008
Cited alongside, same era.
The complexity of stoquastic local Hamiltonian problems
Sergey Bravyi, David P Divincenzo, Roberto I Oliveira, and Barbara M Terhal · 2008
Cited alongside, same era.
Quantum ground state isoperimetric inequalities for the energy spectrum of local hamiltonians
Elizabeth Crosson and John Bowen · 2017
Later among the works it cites.
Markov chains and mixing times
David A Levin and Yuval Peres · 2017
Later among the works it cites.
quimb: a python library for quantum information and many-body calculations
Johnnie Gray · 2018
Later among the works it cites.
Correcting coherent errors with surface codes
Sergey Bravyi, Matthias Englbrecht, Robert König, and Nolan Peard · 2018
Later among the works it cites.
Simulation of quantum circuits by low-rank stabilizer decompositions
Sergey Bravyi, Dan Browne, Padraic Calpin, Earl Campbell, David Gosset, and Mark Howard · 2019
Later among the works it cites.
Leveraging secondary storage to simulate deep 54-qubit sycamore circuits
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sergey Bravyi and Barbara Terhal · 2010
Cited alongside, same era.
A practical introduction to tensor networks: Matrix product states and projected entangled pair states
Román Orús · 2014
Cited alongside, same era.
A polynomial time algorithm for the ground state of one-dimensional gapped local hamiltonians
Zeph Landau, Umesh Vazirani, and Thomas Vidick · 2015
Cited alongside, same era.
Monte carlo simulation of stoquastic hamiltonians
S Bravyi · 2015
Cited alongside, same era.
Trading classical and quantum computational resources
Sergey Bravyi, Graeme Smith, and John A Smolin · 2016
Cited alongside, same era.
Improved classical simulation of quantum circuits dominated by Clifford gates
Sergey Bravyi and David Gosset · 2016
Cited alongside, same era.
Edwin Pednault, John A Gunnels, Giacomo Nannicini, Lior Horesh, and Robert Wisnieff · 2019
Later among the works it cites.
Quantum supremacy using a programmable superconducting processor
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, et al · 2019
Later among the works it cites.
Classical simulation of quantum supremacy circuits
Cupjin Huang, Fang Zhang, Michael Newman, Junjie Cai, Xun Gao, Zhengxiong Tian, Junyin Wu, Haihong Xu, Huanjun Yu, Bo Yuan, et al · 2020
Later among the works it cites.
Contracting arbitrary tensor networks: general approximate algorithm and applications in graphical models and quantum circuit simulations
Feng Pan, Pengfei Zhou, Sujie Li, and Pan Zhang · 2020
Later among the works it cites.
Explicit lower bounds on strong quantum simulation
Cupjin Huang, Michael Newman, and Mario Szegedy · 2020
Later among the works it cites.
Hyper-optimized tensor network contraction
Johnnie Gray and Stefanos Kourtis · 2021
Closest in time.
Simulating the sycamore quantum supremacy circuits
Feng Pan and Pan Zhang · 2021
Closest in time.
Solving the sampling problem of the sycamore quantum supremacy circuits
Feng Pan, Keyang Chen, and Pan Zhang · 2021
Closest in time.
Closing the “quantum supremacy” gap
Yong (Alexander) Liu, Xin (Lucy) Liu, Fang (Nancy) Li, Haohuan Fu, Yuling Yang, Jiawei Song, Pengpeng Zhao, Zhen Wang, Dajia Peng, Huarong Chen, and et al · 2021
Closest in time.
Improved upper bounds on the stabilizer rank of magic states
Hammam Qassim, Hakop Pashayan, and David Gosset · 2021
Closest in time.