Fetching the paper…
Reading the bibliography…
We prove that constant-depth quantum circuits are more powerful than their classical counterparts.
Fast parallel matrix inversion algorithms
Laszlo Csanky · 1976
Earlier work this paper cites.
Fast parallel matrix and gcd computations
Allan Borodin, Joachim Von Zur Gathen, and John Hopcroft · 1982
Earlier work this paper cites.
Extreme quantum entanglement in a superposition of macroscopically distinct states
David Mermin · 1990
Earlier work this paper cites.
Bell’s theorem without inequalities
Daniel M Greenberger, Michael A Horne, Abner Shimony, and Anton Zeilinger · 1990
Earlier work this paper cites.
Rapid solution of problems by quantum computation
David Deutsch and Richard Jozsa · 1992
Earlier work this paper cites.
Quantum complexity theory
Ethan Bernstein and Umesh Vazirani · 1997
Earlier work this paper cites.
Fast parallel circuits for the quantum Fourier transform
Richard Cleve and John Watrous · 2000
Earlier work this paper cites.
A one-way quantum computer
Robert Raussendorf and Hans J Briegel · 2001
Earlier work this paper cites.
Persistent entanglement in arrays of interacting particles
Hans J Briegel and Robert Raussendorf · 2001
Earlier work this paper cites.
Parallel quantum computation and quantum codes
Cristopher Moore and Martin Nilsson · 2001
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.
Improved simulation of stabilizer circuits
Scott Aaronson and Daniel Gottesman · 2004
Earlier work this paper cites.
Quantum fan-out is powerful
Peter Hoyer and Robert Spalek · 2005
Earlier work this paper cites.
Quantum computing, postselection, and probabilistic polynomial-time
Scott Aaronson · 2005
Cited alongside, same era.
Modeling Pauli measurements on graph states with nearest-neighbor classical communication
Jonathan Barrett, Carlton M Caves, Bryan Eastin, Matthew B Elliott, and Stefano Pironio · 2007
Cited alongside, same era.
Quantum algorithms for learning and testing juntas
Alp Atıcı and Rocco A Servedio · 2007
Cited alongside, same era.
Computational complexity: a modern approach
Sanjeev Arora and Boaz Barak · 2009
Cited alongside, same era.
How long can a quantum memory withstand depolarizing noise?
Fernando Pastawski, Alastair Kay, Norbert Schuch, and Ignacio Cirac · 2009
Cited alongside, same era.
Quantum algorithms to solve the hidden shift problem for quadratics and for functions of large gowers norm
Martin Rötteler · 2009
Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
Héctor Bombín · 2015
Later among the works it cites.
Quantum learning robust against noise
Andrew W Cross, Graeme Smith, and John A Smolin · 2015
Later among the works it cites.
Local hamiltonians whose ground states are hard to approximate
Lior Eldar and Aram W Harrow · 2015
Later among the works it cites.
Average-case complexity versus approximate simulation of commuting quantum computations
Michael J Bremner, Ashley Montanaro, and Dan J Shepherd · 2016
Later among the works it cites.
Achieving quantum supremacy with sparse and noisy commuting quantum computations
Michael J Bremner, Ashley Montanaro, and Dan J Shepherd · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
BQP and the polynomial hierarchy
Scott Aaronson · 2010
Cited alongside, same era.
Computational depth complexity of measurement-based quantum computation
Dan Browne, Elham Kashefi, and Simon Perdrix · 2010
Cited alongside, same era.
Quantum algorithm for the boolean hidden shift problem
Dmitry Gavinsky, Martin Roetteler, and Jérémie Roland · 2011
Cited alongside, same era.
What is the overhead required for fault tolerance?
Daniel Gottesman · 2013
Cited alongside, same era.
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
Matthew Amy, Dmitri Maslov, Michele Mosca, and Martin Roetteler · 2013
Cited alongside, same era.
Extractors for circuit sources
Emanuele Viola · 2014
Cited alongside, same era.
Edward Farhi and Aram W Harrow · 2016
Later among the works it cites.
Error mitigation for short depth quantum circuits
Kristan Temme, Sergey Bravyi, and Jay M Gambetta · 2016
Later among the works it cites.
Efficient variational quantum simulator incorporating active error minimisation
Ying Li and Simon C Benjamin · 2016
Later among the works it cites.
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 · 2016
Later among the works it cites.
Complexity-theoretic foundations of quantum supremacy experiments
Scott Aaronson and Lijie Chen · 2016
Later among the works it cites.
Architectures for quantum simulation showing quantum supremacy
Juan Bermejo-Vega, Dominik Hangleiter, Martin Schwarz, Robert Raussendorf, and Jens Eisert · 2017
Closest in time.
Quantum supremacy for simulating a translation-invariant Ising spin model
Xun Gao, Sheng-Tao Wang, and Lu-Ming Duan · 2017
Closest in time.