Fetching the paper…
Reading the bibliography…
BosonSampling is a problem where a quantum computer offers a provable speedup over classical computers.
The polynomial-time hierarchy
Larry J Stockmeyer · 1976
Earlier work this paper cites.
The complexity of computing the permanent
Leslie G Valiant · 1979
Earlier work this paper cites.
Measurement of subpicosecond time intervals between two photons by interference
CK Hong, ZY Ou, and Leonard Mandel · 1987
Earlier work this paper cites.
Experimental realization of any discrete unitary operator
Michael Reck, Anton Zeilinger, Herbert J Bernstein, and Philip Bertani · 1994
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W Shor · 1997
Earlier work this paper cites.
Permanents in linear optical networks
Stefan Scheel · 2004
Earlier work this paper cites.
Alex Arkhipov and Greg Kuperberg · 2011
Earlier work this paper cites.
Sharp bounds for harmonic numbers
Bai-Ni Guo and Feng Qi · 2011
Cited alongside, same era.
Quantum computing and the entanglement frontier
John Preskill · 2012
Cited alongside, same era.
Error tolerance of the boson-sampling model for linear optics quantum computing
Peter P Rohde and Timothy C Ralph · 2012
Cited alongside, same era.
Optical quantum computing with photons of arbitrarily low fidelity and purity
Peter P Rohde · 2012
Cited alongside, same era.
Testing permanent oracles–revisited
Sanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran, and Sushant Sachdeva · 2012
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
Joel A Tropp · 2012
Cited alongside, same era.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2013
Closest in time.
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
Closest in time.
Experimental boson sampling
Max Tillmann, Borivoje Dakić, René Heilmann, Stefan Nolte, Alexander Szameit, and Philip Walther · 2013
Closest in time.
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 · 2013
Closest in time.
Experimental boson sampling in arbitrary integrated photonic circuits
Andrea Crespi, Roberto Osellame, Roberta Ramponi, Daniel J Brod, Ernesto F Galvao, Nicolò Spagnolo, Chiara Vitelli, Enrico Maiorino, Paolo Mataloni, and Fabio Sciarrino · 2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Oversimplifying quantum factoring
John A Smolin, Graeme Smith, and Alexander Vargo · 2013
Cited alongside, same era.
C. Gogolin, M. Kliesch, L. Aolita, and J. Eisert · 2013
Closest in time.