Fetching the paper…
Reading the bibliography…
In this work we improve the runtime of recent classical algorithms for strong simulation of quantum circuits composed of Clifford and T gates.
The theory of error correcting codes
Florence Jessie MacWilliams and Neil James Alexander Sloane · 1977
Earlier work this paper cites.
Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
Jeroen Dehaene and Bart De Moor · 2003
Earlier work this paper cites.
Universal quantum computation with ideal clifford gates and noisy ancillas
Sergey Bravyi and Alexei Kitaev · 2005
Earlier work this paper cites.
Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond
Maarten Van den Nest · 2010
Earlier work this paper cites.
Hybrid Techniques for Simulating Quantum Circuits using the Heisenberg Representation
Hector J Garcia-Ramirez · 2014
Earlier work this paper cites.
Trading classical and quantum computational resources
Sergey Bravyi, Graeme Smith, and John A. Smolin · 2016
Earlier work this paper cites.
Improved classical simulation of quantum circuits dominated by clifford gates
Sergey Bravyi and David Gosset · 2016
Cited alongside, same era.
The theory of quantum information
John Watrous · 2018
Cited alongside, same era.
Simulation of quantum circuits by low-rank stabilizer decompositions
Sergey Bravyi, Dan Browne, Padraic Calpin, Earl Campbell, David Gosset, and Mark Howard · 2019
Cited alongside, same era.
Fine-grained quantum computational supremacy
Tomoyuki Morimae and Suguru Tamaki · 2019
Cited alongside, same era.
Explicit lower bounds on strong simulation of quantum circuits in terms of t t -gate count
Cupjin Huang, Michael Newman, and Mario Szegedy · 2019
Cited alongside, same era.
Improved strong simulation of universal quantum circuits
Lucas Kocia · 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.
Lower bounds on the non-clifford resources for quantum computations
Michael Beverland, Earl Campbell, Mark Howard, and Vadym Kliuchnikov · 2020
Later among the works it cites.
Classical simulations of quantum systems using stabilizer decompositions
Hammam Qassim · 2021
Closest in time.
Lower bounds on stabilizer rank
Shir Peleg, Amir Shpilka, and Ben Lee Volk · 2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…