Fetching the paper…
Reading the bibliography…
We provide general sufficient conditions for the efficient classical simulation of quantum-optics experiments that involve inputting states to a quantum process and making measurements at the output.
E. Wigner, On the Quantum Correction for Thermodynamic Equilibrium
1932
Earlier work this paper cites.
K. Husimi, Some Formal Properties of the Density Matrix
1940
Earlier work this paper cites.
R. J. Glauber, Photon Correlations
1963
Earlier work this paper cites.
E. C. G. Sudarshan, Equivalence of Semiclassical and Quantum Mechanical Descriptions of Statistical Light Beams
1963
Earlier work this paper cites.
K. E. Cahill and R. J. Glauber, Density Operators and Quasiprobability Distributions
1969
Earlier work this paper cites.
L. Valiant, The Complexity of Computing the Permanent
1979
Earlier work this paper cites.
M. Hillery, R. F. O’Connell, M. O. Scully, and E. P. Wigner, Distribution Functions in Physics: Fundamentals
1984
Earlier work this paper cites.
L. J. Stockmeyer, On Approximation Algorithms for #P
1985
Earlier work this paper cites.
S. Toda, PP Is as Hard as the Polynomial-Time Hierarchy
1991
Earlier work this paper cites.
S. M. Barnett, L. S. Phillips, and D. T. Pegg, Imperfect Photodetection as Projection onto Mixed States
1998
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information
2000
Earlier work this paper cites.
S. D. Bartlett, B. C. Sanders, S. L. Braunstein, and K. Nemoto, Efficient Classical Simulation of Continuous Variable Quantum Information Processes
2002
Earlier work this paper cites.
G. Adesso and F. Illuminati, Entanglement in Continuous-Variable Systems: Recent Advances and Current Perspectives
2007
Earlier work this paper cites.
S. Aaronson, A Linear-Optical Proof That the Permanent Is #P-hard
2011
Cited alongside, same era.
V. Veitch, C. Ferrie, D. Gross, and J. Emerson, Negative Quasi-Probability as a Resource for Quantum Computation
2012
Cited alongside, same era.
A. Mari and J. Eisert, Positive Wigner Functions Render Classical Simulation of Quantum Computation Efficient
2012
Cited alongside, same era.
P. P. Rohde and T. C. Ralph, Error Tolerance of the Boson-Sampling Model for Linear Optics Quantum Computing
2012
Cited alongside, same era.
C. Weedbrook, S. Pirandola, R. Garcia-Patron, N. J. Cerf, T. C. Ralph, J. H. Shapiro, and S. Lloyd, Gaussian Quantum Information
2012
Cited alongside, same era.
A. Crespi, R. Osellame, R. Ramponi, D. J. Brod, E. F. Galvão, N. Spagnolo, C. Vitelli, E. Maiorino, P. Mataloni, and F. Sciarrino, Integrated Multimode Interferometers with Arbitrary Designs for Photonic Boson Sampling
2013
Later among the works it cites.
D. Stahlke, Quantum Interference as a Resource for Quantum Speedup
2014
Later among the works it cites.
A. P. Lund, A. Laing, S. Rahimi-Keshari, T. Rudolph, J. L. O’Brien, and T. C. Ralph, Boson Sampling from a Gaussian State
2014
Later among the works it cites.
V. S. Shchesnovich, Sufficient Condition for the Mode Mismatch of Single Photons for Scalability of the Boson-Sampling Computer
2014
Later among the works it cites.
P. P. Rohde, K. R. Motes, P. A. Knott, J. Fitzsimons, W. J. Munro, and J. P. Dowling, Evidence for the Conjecture That Sampling Generalized Cat States with Linear Optics Is Hard
2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
S. Aaronson and A. Arkhipov, The Computational Complexity of Linear Optics
2013
Cited alongside, same era.
S. Rahimi-Keshari, T. Kiesel, W. Vogel, S. Grandi, A. Zavatta and M. Bellini, Quantum Process Nonclassicality
2013
Cited alongside, same era.
S. Rahimi-Keshari, M. A. Broome, R. Fickler, A. Fedrizzi, T. C. Ralph, and A. G. White, Direct Characterization of Linear-Optical Networks
2013
Cited alongside, same era.
F. Shahandeh and M. R. Bazrafkan, The General Boson Ordering Problem and Its Combinatorial Roots
2013
Cited alongside, same era.
M. A. Broome, A. Fedrizzi, S. Rahimi-Keshari, J. Dove, S. Aaronson, T. C. Ralph, and A. G. White, Photonic Boson Sampling in a Tunable Circuit
2013
Cited alongside, same era.
J. B. Spring, B. J. Metcalf, P. C. Humphreys, W. S. Kolthammer, X. Jin, M. Barbieri, A. Datta, N. Thomas-Peter, N. K. Langford, D. Kundys, J. C. Gates, B. J. Smith, P. G. R. Smith, and I. A. Walmsley, Boson Sampling on a Photonic Chip
2013
Cited alongside, same era.
Closest in time.
K. P. Seshadreesan, J. P. Olson, K. R. Motes, P. P. Rohde, and J. P. Dowling, Boson Sampling with Displaced Single-Photon Fock States Versus Single-Photon-Added Coherent States: The Quantum-Classical Divide and Computational-Complexity Transitions in Linear Optics
2015
Closest in time.
J. P. Olson, K. P. Seshadreesan, K. R. Motes, P. P. Rohde, and J. P. Dowling, Sampling Arbitrary Photon-Added or Photon-Subtracted Squeezed States Is in the Same Complexity Class as Boson Sampling
2015
Closest in time.
A. Leverrier and R. García-Patrón, Analysis of Circuit Imperfections in BosonSampling
2015
Closest in time.
A. Arkhipov, Boson Sampling Is Robust to Small Errors in the Network Matrix
2015
Closest in time.
S. Rahimi-Keshari, A. P. Lund, and T. C. Ralph, What Can Quantum Optics Say about Computational Complexity Theory?
2015
Closest in time.
H. Pashayan, J. J. Wallman, and S. D. Bartlett, Estimating Outcome Probabilities of Quantum Circuits Using Quasiprobabilities
2015
Closest in time.
S. Aaronson and D. J. Brod, BosonSampling with Lost Photons
2016
Closest in time.