Fetching the paper…
Reading the bibliography…
A critical milestone on the path to useful quantum computers is quantum supremacy - a demonstration of a quantum computation that is prohibitively hard for classical computers.
Fluctuations of nuclear reaction widths
C. E. Porter and R. G. Thomas · 1956
Earlier work this paper cites.
The complexity of computing the permanent
L.G. Valiant · 1979
Earlier work this paper cites.
Some connections between nonuniform and uniform complexity classes
Richard M. Karp and Richard J. Lipton · 1980
Earlier work this paper cites.
Simulating physics with computers
Richard P Feynman · 1982
Earlier work this paper cites.
BPP and the Polynomial Hierarchy
Clemens Lautemann · 1983
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
L.R. Welch and E.R. Berlekamp · 1986
Earlier work this paper cites.
Does co-NP have short interactive proofs?
R. B. Boppana, J. Hastad, and S. Zachos · 1987
Earlier work this paper cites.
Self-testing/correcting for polynomials and for approximate functions
Peter Gemmell, Richard Lipton, Ronitt Rubinfeld, Madhu Sudan, and Avi Wigderson · 1991
Earlier work this paper cites.
New directions in testing
R J Lipton · 1991
Earlier work this paper cites.
PP is as hard as the polynomial-time hierarchy
Seinosuke Toda · 1991
Earlier work this paper cites.
Quantum complexity theory
Ethan Bernstein and Umesh V. Vazirani · 1993
Earlier work this paper cites.
On the eigenvalues of random matrices
Persi Diaconis and Mehrdad Shahshahani · 1994
Earlier work this paper cites.
On the power of quantum cryptography
Daniel R. Simon · 1994
Earlier work this paper cites.
Universal quantum simulators
Seth Lloyd · 1996
Earlier work this paper cites.
Maximum likelihood decoding of Reed Solomon codes
M. Sudan · 1996
Earlier work this paper cites.
On the hardness of permanent
Jin-Yi Cai, A. 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.
A one-way quantum computer
Robert Raussendorf and Hans J Briegel · 2001
Cited alongside, same era.
Measurement-based quantum computation on cluster states
Robert Raussendorf, Daniel E Browne, and Hans J Briegel · 2003
Cited alongside, same era.
Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
Barbara M Terhal and David P DiVincenzo · 2004
Cited alongside, same era.
Quantum computing, postselection, and probabilistic polynomial-time
Scott Aaronson · 2005
Cited alongside, same era.
Measurement-based quantum computation
Hans J Briegel, David E Browne, W Dür, Robert Raussendorf, and Maarten Van den Nest · 2009
Cited alongside, same era.
Universal blind quantum computation
Anne Broadbent, Joseph Fitzsimons, and Elham Kashefi · 2009
Cited alongside, same era.
Complexity Classification of Two-Qubit Commuting Hamiltonians
Adam Bouland, Laura Mancinska, and Xue Zhang · 2016
Later among the works it cites.
Quantum supremacy through the quantum approximate optimization algorithm
Edward Farhi and Aram W Harrow · 2016
Later among the works it cites.
On the power of quantum Fourier sampling
Bill Fefferman and Christopher Umans · 2016
Later among the works it cites.
Complexity-theoretic foundations of quantum supremacy experiments
Scott Aaronson and Lijie Chen · 2017
Later among the works it cites.
Quantum advantage from conjugated Clifford circuits
Adam Bouland, Joseph Fitzsimons, and Dax E. Koh · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Michael J Bremner, Richard Jozsa, and Dan J Shepherd · 2010
Cited alongside, same era.
Randomized algorithms
Rajeev Motwani and Prabhakar Raghavan · 2010
Cited alongside, same era.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Cited alongside, same era.
Boson sampling on a photonic chip
Justin B Spring, Benjamin J Metcalf, Peter C Humphreys, W Steven Kolthammer, Xian-Min Jin, Marco Barbieri, Animesh Datta, Nicholas Thomas-Peter, Nathan K Langford, Dmytro Kundys, et al · 2012
Cited alongside, same era.
Photonic boson sampling in a tunable circuit
Matthew A Broome, Alessandro Fedrizzi, Saleh Rahimi-Keshari, Justin Dove, Scott Aaronson, Timothy C Ralph, and Andrew G White · 2013
Cited alongside, same era.
Exponential quantum speed-ups are generic
Fernando GSL Brandão and Michal Horodecki · 2013
Cited alongside, same era.
Michael J Bremner, Ashley Montanaro, and Dan J Shepherd · 2017
Later among the works it cites.
Fourier analysis of sampling from noisy chaotic quantum circuits
Sergio Boixo, Vadim N Smelyanskiy, and Hartmut Neven · 2017
Later among the works it cites.
Anti-concentration theorems for schemes showing a quantum computational supremacy
Dominik Hangleiter, Juan Bermejo-Vega, Martin Schwarz, and Jens Eisert · 2017
Later among the works it cites.
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Abhinav Kandala, Antonio Mezzacapo, Kristan Temme, Maika Takita, Markus Brink, Jerry M. Chow, and Jay M. Gambetta · 2017
Later among the works it cites.
On the complexity of random quantum computations and the Jones polynomial
Ryan L. Mann and Michael J. Bremner · 2017
Later among the works it cites.
Hardness of classically sampling one clean qubit model with constant total variation distance error
Tomoyuki Morimae · 2017
Later among the works it cites.
Commercialize quantum technologies in five years
Masoud Mohseni, Peter Read, Hartmut Neven, Sergio Boixo, Vasil Denchev, Ryan Babbush, Austin Fowler, Vadim Smelyanskiy, and John Martinis · 2017
Later among the works it cites.
A blueprint for demonstrating quantum supremacy with superconducting qubits
C. Neill, P. Roushan, K. Kechedzhi, S. Boixo, S. V. Isakov, V. Smelyanskiy, R. Barends, B. Burkett, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, A. Fowler, B. Foxen, R. Graff, E. Jeffrey, J. Kelly, E. Lucero, A. Megrant, J. Mutus, M. Neeley, C. Quintana, D. Sank, A. Vainsencher, J. Wenner, T. C. White, H. Neven, and J. M. Martinis · 2017
Later among the works it cites.
No imminent quantum supremacy by boson sampling
Alex Neville, Chris Sparrow, Raphaël Clifford, Eric Johnston, Patrick M Birchall, Ashley Montanaro, and Anthony Laing · 2017
Later among the works it cites.
Observation of a many-body dynamical phase transition with a 53-qubit quantum simulator
Jiehang Zhang, Guido Pagano, Paul W Hess, Antonis Kyprianidis, Patrick Becker, Harvey Kaplan, Alexey V Gorshkov, Z-X Gong, and Christopher Monroe · 2017
Later among the works it cites.
The classical complexity of boson sampling
Peter Clifford and Raphaël Clifford · 2018
Closest in time.
The quantum space race
John Martinis · 2018
Closest in time.
Quantum computing in the NISQ era and beyond, 2018
John Preskill · 2018
Closest in time.