B. Terhal and D. DiVincenzo, Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games, Quant. Inf. Comp
2004
Cited alongside, same era.
G. Kalai and O. Zeitouni, unpublished work, 2007
2007
Cited alongside, same era.
C. Garban, G. Pete, and O. Schramm, The Fourier spectrum of critical percolation, it Acta Math. 205 (2010), 19-104
2010
Cited alongside, same era.
G. Kalai, Aaronson and Arkhipov’s result on hierarchy collapse , a post in Combinatorics and More,
2010
Cited alongside, same era.
O. Schramm and J. Steif, Quantitative noise sensitivity and exceptional times for percolation, Annals of Mathematics,
2010
Cited alongside, same era.
M. J. Bremner, R. Jozsa, D. J. Shepherd, Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy, it Proc. Roy. Soc. A, 467(2011) ,459–472, 2011
2011
Cited alongside, same era.
Y. Bilu and N. Linial, Are stable instances easy, Combinatorics, Probability and Computing
2012
Cited alongside, same era.
M. A. Broome, A. Fedrizzi, S. Rahimi-Keshari, J. Dove, S. Aaronson, T. Ralph, A. G. White, Photonic Boson Sampling in a Tunable Circuit, Science
2013
Cited alongside, same era.
A. Crespi, R. Osellame, R. Ramponi, D. J. Brod, E. F. Galvao, N. Spagnolo, C. Vitelli, E. Maiorino, P. Mataloni, F. Sciarrino, Integrated multimode interferometers with arbitrary designs for photonic boson sampling, Nature Photonics
2013
Cited alongside, same era.
S. Flammia and A Harrow, Counterexamples to Kalai’s Conjecture C. Q. Inf. & Comp
Original
2013
Cited alongside, same era.
S. Aaronson, private communication
Cited in the paper.
A. Arkhipov, Boson sampling is robust to small errors in the network matrix, preprint
Cited in the paper.