Fetching the paper…
Reading the bibliography…
As Moore's law reaches its limits, quantum computers are emerging with the promise of dramatically outperforming classical computers.
Der massbegriff in der theorie der kontinuierlichen gruppen
Alfred Haar · 1933
Earlier work this paper cites.
Polynomial codes over certain finite fields
Irving S Reed and Gustave Solomon · 1960
Earlier work this paper cites.
Symétrie et mathématique moderne
Hermann Weyl · 1964
Earlier work this paper cites.
On approximation algorithms for# p
Larry Stockmeyer · 1985
Earlier work this paper cites.
Error correction for algebraic block codes, December 30 1986
Lloyd R Welch and Elwyn R Berlekamp · 1986
Earlier work this paper cites.
Highly resilient correctors for polynomials
Peter Gemmell and Madhu Sudan · 1992
Earlier work this paper cites.
On the degree of polynomials that approximate symmetric boolean functions (preliminary version)
Ramamohan Paturi · 1992
Earlier work this paper cites.
On the hardness of permanent
Jin-Yi Cai, Aduri Pavan, and D Sivakumar · 1999
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W Shor · 1999
Earlier work this paper cites.
The relative complexity of approximate counting problems
Martin Dyer, Leslie Ann Goldberg, Catherine Greenhill, and Mark Jerrum · 2004
Earlier work this paper cites.
Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games
Barbara M Terhal and David P DiVincenzo · 2004
Earlier work this paper cites.
Black holes as mirrors: quantum information in random subsystems
Patrick Hayden and John Preskill · 2007
Earlier work this paper cites.
Bounds for polynomials with a unit discrete norm
Evguenii A Rakhmanov · 2007
Earlier work this paper cites.
Universal computation by quantum walk
Andrew M Childs · 2009
Cited alongside, same era.
Quantum algorithm for linear systems of equations
Aram W Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Cited alongside, same era.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Cited alongside, same era.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Michael J Bremner, Richard Jozsa, and Dan J Shepherd · 2011
Cited alongside, same era.
The equivalence of sampling and searching
Scott Aaronson · 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.
Aram Harrow and Saeed Mehraban · 2018
Later among the works it cites.
Ramis Movassagh · 2018
Later among the works it cites.
Quantum computing in the nisq era and beyond
John Preskill · 2018
Later among the works it cites.
Holographic spacetimes as quantum circuits of path-integrations
Tadashi Takayanagi · 2018
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
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Michael J Bremner, Ashley Montanaro, and Dan J Shepherd · 2016
Cited alongside, same era.
Quantum computational supremacy
Aram W Harrow and Ashley Montanaro · 2017
Cited alongside, same era.
Quantum sampling problems, bosonsampling and quantum supremacy
AP Lund, Michael J Bremner, and TC Ralph · 2017
Cited alongside, same era.
Classical boson sampling algorithms with superior performance to near-term experiments
Alex Neville, Chris Sparrow, Raphaël Clifford, Eric Johnston, Patrick M Birchall, Ashley Montanaro, and Anthony Laing · 2017
Cited alongside, same era.
Quantum advantage with shallow circuits
Sergey Bravyi, David Gosset, and Robert König · 2018
Cited alongside, same era.
Characterizing quantum supremacy in near-term devices
Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J Bremner, John M Martinis, and Hartmut Neven · 2018
Cited alongside, same era.
Closest in time.
On the complexity and verification of quantum random circuit sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani · 2019
Closest in time.
Classical algorithms for quantum mean values
Sergey Bravyi, David Gosset, and Ramis Movassagh · 2019
Closest in time.
Obstacles to state preparation and variational optimization from symmetry protection
Sergey Bravyi, Alexander Kliesch, Robert Koenig, and Eugene Tang · 2019
Closest in time.
Quantum advantage with noisy shallow circuits
Sergey Bravyi, David Gosset, Robert Koenig, and Marco Tomamichel · 2020
Closest in time.
Hyper-optimized tensor network contraction
Johnnie Gray and Stefanos Kourtis · 2020
Closest in time.
Mermin’s inequalities of multiple qubits with orthogonal measurements on ibm q 53-qubit system
Wei-Jia Huang, Wei-Chen Chien, Chien-Hung Cho, Che-Chun Huang, Tsung-Wei Huang, and Ching-Ray Chang · 2020
Closest in time.
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
Closest in time.
Efficient classical simulation of random shallow 2d quantum circuits
John Napp, Rolando L La Placa, Alexander M Dalzell, Fernando GSL Brandao, and Aram W Harrow · 2020
Closest in time.