Fetching the paper…
Reading the bibliography…
Giving a convincing experimental evidence of the quantum supremacy over classical simulations is a challenging goal.
L. P. Pitaevskii. Vortex lines in an imperfect Bose gas. \href
1961
Earlier work this paper cites.
E. P. Gross. Structure of a quantized vortex in boson systems. \href
1961
Earlier work this paper cites.
H. Ryser, Combinatorial Mathematics
1963
Earlier work this paper cites.
L. Takács. On the Method of Inclusion and Exclusion. \href
1967
Earlier work this paper cites.
E. R. Caianiello. On quantum field theory — I: explicit solution of Dyson’s equation in electrodynamics without use of Feynman graphs. \href
1973
Earlier work this paper cites.
L. G. Valiant. The complexity of computing the permanent. \href
1979
Earlier work this paper cites.
R. Feynman. Simulating Physics with Computers. \href
1982
Earlier work this paper cites.
N. N. Bogolyubov and N. N. Bogolyubov (Jr.), Introduction to Quantum Statistical Mechanics
1984
Earlier work this paper cites.
C. K. Hong, Z. Y. Ou, and L. Mandel. Measurement of subpicosecond time intervals between two photons by interference. \href
1987
Earlier work this paper cites.
P. W. Shor. Algorithms for quantum computation: discrete logarithms and factoring. \href
1994
Earlier work this paper cites.
M. N. Anderson, J. R. Ensher, M. R. Mathews, C. E. Wieman and E. A. Cornell. Observation of Bose-Einstein Condensation in a Dilute Atomic Vapor. \href
1995
Earlier work this paper cites.
K. B. Davis, M.-O. Mewes, M. R. Andrews, N. J. van Druten, D. S. Durfee, D. M. Kurn, and W. Ketterle. Bose-Einstein Condensation in a Gas of Sodium Atoms. \href
1995
Earlier work this paper cites.
A. I. Barvinok. Two Algorithmic Results for the Traveling Salesman Problem. \href
1996
Earlier work this paper cites.
S. M. Barnett, C. R. Gilson, B. Huttner, and N. Imoto. Field Commutation Relations in Optical Cavities. \href
1996
Earlier work this paper cites.
A. Agresti and B. A. Coull. Approximate is Better than “Exact” for Interval Estimation of Binomial Proportions. \href
1998
Earlier work this paper cites.
A. L. Migdall, D. Branning, and S. Castelletto. Tailoring single-photon and multiphoton probabilities of a single-photon on-demand source. \href
2002
Earlier work this paper cites.
M. Jerrum, A. Sinclair, and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. \href
2004
Earlier work this paper cites.
S. Aaronson. A linear-optical proof that the permanent is # \# P-hard. \href
2011
Earlier work this paper cites.
R. P. Stanley, Enumerative Combinatorics
2011
Earlier work this paper cites.
A. Arkhipov and G. Kuperberg. The bosonic birthday paradox. \href
2012
Earlier work this paper cites.
P. P. Rohde and T. C. Ralph. Error tolerance of the boson-sampling model for linear optics quantum computing. \href
2012
Earlier work this paper cites.
S. Aaronson and A. Arkhipov, The computational complexity of linear optics. \href
2013
Earlier work this paper cites.
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. \href
2013
Earlier work this paper cites.
J. B. Spring, B. J. Metcalf, P. C. Humphreys, W. S. Kolthammer, X.-M. 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. \href
2013
Earlier work this paper cites.
M. Tillmann, B. Dakić, R. Heilmann, S. Nolte, A. Szameit, and P. Walther. Experimental boson sampling. \href
2013
Earlier work this paper cites.
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. \href
2013
Earlier work this paper cites.
V. S. Shchesnovich. Asymptotic evaluation of bosonic probability amplitudes in linear unitary networks in the case of large number of bosons. \href
2013
Cited alongside, same era.
J. Carolan, J. D. A. Meinecke, P. J. Shadbolt, N. J. Russell, N. Ismail, K. Wörhoff, T. Rudolph, M. G. Thompson, J. L. O’Brien, J. C. F. Matthews, and A. Laing. On the experimental verification of quantum complexity in linear optics. \href
2014
Cited alongside, same era.
A. P. Lund, A. Laing, S. Rahimi-Keshari, T. Rudolph, J. L. O’Brien, and T. C. Ralph. Boson Sampling from a Gaussian State. \href
2014
Cited alongside, same era.
K. R. Motes, A. Gilchrist, J. P. Dowling, and P. P. Rohde. Scalable Boson Sampling with Time-Bin Encoding Using a Loop-Based Architecture. \href
2014
Cited alongside, same era.
C. Shen, Z. Zhang, and L.-M. Duan. Scalable Implementation of Boson Sampling with Trapped Ions. \href
Z. Puchala and J. A. Miszczak. Symbolic integration with respect to the Haar measure on the unitary groups. \href
2017
Later among the works it cites.
V. S. Shchesnovich. Asymptotic Gaussian law for noninteracting indistinguishable particles in random networks. \href
2017
Later among the works it cites.
L. Chakhmakhchyan, N. J. Cerf, and R. García-Patrón. Quantum-inspired algorithm for estimating the permanent of positive semidefinite matrices. \href
2017
Later among the works it cites.
J. Preskill. Quantum Computing in the NISQ era and beyond. \href
2018
Later among the works it cites.
J. Bermejo-Vega, D. Hangleiter, M. Schwarz, R. Raussendorf, and J. Eisert. Architectures for Quantum Simulation Showing a Quantum Speedup. \href
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
V. S. Shchesnovich. Sufficient condition for the mode mismatch of single photons for scalability of the boson-sampling computer. \href
2014
Cited alongside, same era.
S. Aaronson and A. Arkhipov. Bosonsampling is far from uniform. \href
2014
Cited alongside, same era.
M. Bentivegna, N. Spagnolo, C. Vitelli, F. Flamini, N. Viggianiello, L. Latmiral, P. Mataloni, D. J. Brod, E. F. Galvão, A. Crespi, R. Ramponi, R. Osellame, and F. Sciarrino. Experimental scattershot boson sampling. \href
2015
Cited alongside, same era.
A. Leverrier and R. García-Patrón. Analysis of circuit imperfections in BosonSampling. \href
2015
Cited alongside, same era.
A. Arkhipov. BosonSampling is robust against small errors in the network matrix. \href
2015
Cited alongside, same era.
V. S. Shchesnovich. Partial indistinguishability theory for multiphoton experiments in multiport devices. \href
2015
Cited alongside, same era.
S. Rahimi-Keshari, A. P. Lund, and T. C. Ralph. What Can Quantum Optics Say about Computational Complexity Theory? \href
2015
Cited alongside, same era.
S. O. Boixo, S. V. Isakov, V. N. Smelyanskiy, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven. Characterizing quantum supremacy in near-term devices. \href
2018
Later among the works it cites.
H. Wang, W. Li, X. Jiang, Y. M. He, Y. H. Li, X. Ding, M. C. Chen, J. Qin, C. Z. Peng, C. Schneider et al
2018
Later among the works it cites.
H.-S. Zhong, Y. Li, W. Li, L.-C. Peng, Z.-E. Su, Y. Hu, Y.-M. He, X. Ding, W. Zhang, H. Li et al
2018
Later among the works it cites.
A. Deshpande, B. Fefferman, M. C. Tran, M. Foss-Feig and A. V. Gorshkov. Dynamical Phase Transitions in Sampling Complexity. \href
2018
Later among the works it cites.
B. Peropadre, J. Huk and C. Sabín. Dynamical Casimir Effect for Gaussian Boson Sampling. \href
2018
Later among the works it cites.
P. Clifford, and R. Clifford. The Classical Complexity of Boson Sampling. \href
2018
Later among the works it cites.
J. J. Renema, A. Menssen, W. R. Clements, G. Triginer, W. S. Kolthammer, and I. A. Walmsley. Efficient Classical Algorithm for Boson Sampling with Partially Distinguishable Photons. \href
2018
Later among the works it cites.
M. Oszmaniec and D. J. Brod. Classical simulation of photonic linear optics with lost particles. \href
2018
Later among the works it cites.
T. Giordani, F. Flamini, M. Pompili, N. Viggianiello, N. Spagnolo, A. Crespi, R. Osellame, N. Wiebe, M. Walschaers, A. Buchleitner, and F. Sciarrino. Experimental statistical signature of many-body quantum interference. \href
2018
Later among the works it cites.
V. S. Shchesnovich and M. E. O. Bezerra. Collective phases of identical particles interfering on linear multiports. \href
2018
Later among the works it cites.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. S. L. Brandao, D. A. Buell, et al
2019
Closest in time.
H.-S. Zhong, L.-C. Peng, Y. Li, Y. Hu, W. Li, J. Qin, D. Wu, W. Zhang, H. Li, L. Zhang, Z. Wang et al
2019
Closest in time.
H. Wang, J. Qin, X. Ding, M.-C. Chen, S. Chen, X. You, Y.-M. He, X. Jiang, L. You, Z. Wang, C. Schneider, J. J. Renema, S. Höfling, C.-Y. Lu, and J.-W. Pan. Boson Sampling with 20 Input Photons and a 60-Mode Interferometer in a 10 14 10^{14} -Dimensional Hilbert Space. \href
2019
Closest in time.
R. García-Patrón, J. J. Renema, and V. S. Shchesnovich. Simulating boson sampling in lossy architectures. \href
2019
Closest in time.
V. S. Shchesnovich. Noise in boson sampling and the threshold of efficient classical simulatability. \href
2019
Closest in time.
I. Agresti, N. Viggianiello, F. Flamini, N. Spagnolo, A. Crespi, R. Osellame, N. Wiebe, and F. Sciarrino. Pattern Recognition Techniques for Boson Sampling Validation. \href
2019
Closest in time.
D. J. Brod and M. Oszmaniec. Classical simulation of linear optics subject to nonuniform losses. \href
2020
Closest in time.
V. S. Shchesnovich. On the classical complexity of sampling from quantum interference of indistinguishable bosons. \href
2020
Closest in time.
A. E. Moylett, R. García-Patrón, J. J. Renema, and P. S. Turner. Classically simulating near-term partially-distinguishable and lossy boson sampling. \href
2020
Closest in time.
V. S. Shchesnovich and M. E. O. Bezerra. Distinguishability theory for time-resolved photodetection and boson sampling. \href
2020
Closest in time.