[1] F. Arute et al. Quantum supremacy using a programmable superconducting processor. Nature, 574, 505-510(2019).

[2] H.-S. Zhong et al. Quantum computational advantage using photons. Science, 370, 1460-1463(2020).

[3] Y. Wu et al. Strong quantum computational advantage using a superconducting quantum processor. Phys. Rev. Lett., 127, 180501(2021).

[4] H.-S. Zhong et al. Phase-programmable Gaussian boson sampling using stimulated squeezed light. Phys. Rev. Lett., 127, 180502(2021).

[5] L. S. Madsen et al. Quantum computational advantage with a programmable photonic processor. Nature, 606, 75-81(2022).

[6] Y.-H. Deng et al. Gaussian boson sampling with pseudo-photon-number-resolving detectors and quantum computational advantage. Phys. Rev. Lett., 131, 150601(2023).

[7] J. Preskill. Quantum computing in the NISQ era and beyond. Quantum, 2, 79(2018).

[8] S. Aaronson, A. Arkhipov. The computational complexity of linear optics(2011).

[9] D. J. Brod et al. Photonic implementation of boson sampling: a review. Adv. Photonics, 1, 034001(2019).

[10] A. Lund et al. Boson sampling from a Gaussian state. Phys. Rev. Lett., 113, 100502(2014).

[11] C. S. Hamilton et al. Gaussian boson sampling. Phys. Rev. Lett., 119, 170501(2017).

[12] A. Deshpande et al. Quantum computational advantage via high-dimensional Gaussian boson sampling. Sci. Adv., 8, eabi7894(2022).

[13] T. R. Bromley et al. Applications of near-term photonic quantum computers: software and algorithms. Quantum Sci. Technol., 5, 034010(2020).

[14] J. M. Arrazola, T. R. Bromley. Using Gaussian boson sampling to find dense subgraphs. Phys. Rev. Lett., 121, 030503(2018).

[15] M. Schuld et al. Measuring the similarity of graphs with a Gaussian boson sampler. Phys. Rev. A, 101, 032314(2020).

[16] K. Brádler et al. Graph isomorphism and Gaussian boson sampling. Spec. Matrices, 9, 166-196(2021).

[17] J. M. Arrazola et al. Quantum circuits with many photons on a programmable nanophotonic chip. Nature, 591, 54-60(2021).

[18] S. Sempere-Llagostera et al. Experimentally finding dense subgraphs using a time-bin encoded Gaussian boson sampling device. Phys. Rev. X, 12, 031045(2022).

[19] S. Yu et al. A universal programmable Gaussian boson sampler for drug discovery. Nat. Comput. Sci., 3, 839-848(2023).

[20] Y.-H. Deng et al. Solving graph problems using Gaussian boson sampling. Phys. Rev. Lett., 130, 190601(2023).

[21] P. Clifford, R. Clifford. The classical complexity of boson sampling, 146-155(2018).

[22] A. Neville et al. Classical boson sampling algorithms with superior performance to near-term experiments. Nat. Phys., 13, 1153(2017).

[23] N. Quesada, J. M. Arrazola. Exact simulation of Gaussian boson sampling in polynomial space and exponential time. Phys. Rev. Res., 2, 023005(2020).

[24] N. Quesada et al. Quadratic speed-up for simulating Gaussian boson sampling. PRX Quantum, 3, 010306(2022).

[25] C. Oh et al. Classical simulation of boson sampling based on graph structure. Phys. Rev. Lett., 128, 190501(2022).

[26] J. F. F. Bulmer et al. The boundary for quantum advantage in Gaussian boson sampling. Sci. Adv., 8, eabl9236(2022).

[27] P. D. Drummond et al. Simulating complex networks in phase space: Gaussian boson sampling. Phys. Rev. A, 105, 012427(2022).

[28] A. S. Popova, A. N. Rubtsov. Cracking the quantum advantage threshold for Gaussian boson sampling(2021).

[29] D. Cilluffo, N. Lorenzoni, M. B. Plenio. Simulating Gaussian boson sampling with tensor networks in the Heisenberg picture(2023).

[30] C. Oh et al. Classical algorithm for simulating experimental Gaussian boson sampling. Nat. Phys., 20, 1461-1468(2024).

[31] S. Rahimi-Keshari, T. C. Ralph, C. M. Caves. Sufficient conditions for efficient classical simulation of quantum optics. Phys. Rev. X, 6, 021039(2016).

[32] M. Oszmaniec, D. J. Brod. Classical simulation of photonic linear optics with lost particles. New J. Phys., 20, 092002(2018).

[33] R. García-Patrón, J. J. Renema, V. Shchesnovich. Simulating boson sampling in lossy architectures. Quantum, 3, 169(2019).

[34] D. J. Brod, M. Oszmaniec. Classical simulation of linear optics subject to nonuniform losses. Quantum, 4, 267(2020).

[35] H. Qi et al. Regimes of classical simulability for noisy Gaussian boson sampling. Phys. Rev. Lett., 124, 100502(2020).

[36] C. Oh et al. Classical simulation of lossy boson sampling using matrix product operators. Phys. Rev. A, 104, 022407(2021).

[37] M. Liu et al. Simulating lossy Gaussian boson sampling with matrix-product operators. Phys. Rev. A, 108, 052604(2023).

[38] J. J. Renema et al. Efficient classical algorithm for boson sampling with partially distinguishable photons. Phys. Rev. Lett., 120, 220502(2018).

[39] A. E. Moylett et al. Classically simulating near-term partially-distinguishable and lossy boson sampling. Quantum Sci. Technol., 5, 015001(2019).

[40] J. J. Renema. Simulability of partially distinguishable superposition and Gaussian boson sampling. Phys. Rev. A, 101, 063840(2020).

[41] J. Shi, T. Byrnes. Effect of partial distinguishability on quantum supremacy in Gaussian boson sampling. NPJ Quantum Inf., 8, 54(2022).

[42] N. Spagnolo et al. Experimental validation of photonic boson sampling. Nat. Photonics, 8, 615-620(2014).

[43] J. Martínez-Cifuentes, K. M. Fonseca-Romero, N. Quesada. Classical models may be a better explanation of the Jiuzhang 1.0 Gaussian boson sampler than its targeted squeezed light model. Quantum, 7, 1076(2023).

[44] M. Walschaers et al. Statistical benchmark for boson sampling. New J. Phys., 18, 032001(2016).

[45] D. S. Phillips et al. Benchmarking of Gaussian boson sampling using two-point correlators. Phys. Rev. A, 99, 023836(2019).

[46] T. Giordani et al. Experimental statistical signature of many-body quantum interference. Nat. Photonics, 12, 173-178(2018).

[47] G. Bressanini et al. Gaussian boson sampling validation via detector binning(2023).

[48] J. J. Renema. Marginal probabilities in boson samplers with arbitrary input states(2020).

[49] B. Villalonga et al. Efficient approximation of experimental Gaussian boson sampling(2021).

[50] T. Giordani et al. Certification of Gaussian boson sampling via graphs feature vectors and kernels. Quantum Sci. Technol., 8, 015005(2022).

[51] Xanadu Cloud(2023).

[52] Amazon Braket(2020).

[53] A. Z. Goldberg, G. S. Thekkadath, K. Heshami. Measuring the quadrature coherence scale on a cloud quantum computer. Phys. Rev. A, 107, 042610(2023).

[54] E. R. Caianiello. On quantum field theory—I: explicit solution of Dyson’s equation in electrodynamics without use of Feynman graphs. Il Nuovo Cimento (1943–1954), 10, 1634-1652(1953).

[55] K. R. Motes et al. Scalable boson sampling with time-bin encoding using a loop-based architecture. Phys. Rev. Lett., 113, 120501(2014).

[56] Y. He et al. Time-bin-encoded boson sampling with a single-photon device. Phys. Rev. Lett., 118, 190501(2017).

[57] S. Takeda, A. Furusawa. Toward large-scale fault-tolerant universal photonic quantum computing. APL Photonics, 4, 060902(2019).

[58] F. Laudenbach, T. Isacsson. Operating Borealis—advanced.

[59] G. Van Rossum, F. L. Drake. Python 3 Reference Manual(2009).

[60] N. Killoran et al. Strawberry fields: a software platform for photonic quantum computing. Quantum, 3, 129(2019).

[61] B. Gupt, J. Izaac, N. Quesada. The walrus: a library for the calculation of hafnians, hermite polynomials and Gaussian boson sampling. J. Open Source Software, 4, 1705(2019).

[62] S. Jahangiri et al. Point processes with Gaussian boson sampling. Phys. Rev. E, 101, 022134(2020).

[63] S. Rahimi-Keshari, A. P. Lund, T. C. Ralph. What can quantum optics say about computational complexity theory?. Phys. Rev. Lett., 114, 060501(2015).

[64] C. Oh et al. Quantum-inspired classical algorithm for graph problems by Gaussian boson sampling. PRX Quantum, 5, 020341(2024).

[65] N. R. Solomons, O. F. Thomas, D. P. S. McCutcheon. Effect of photonic errors on quantum enhanced dense-subgraph finding. Phys. Rev. Applied, 20, 054043(2023).

[66] R. Mezher, A. F. Carvalho, S. Mansfield. Solving graph problems with single photons and linear optics. Phys. Rev. A, 108, 032405(2023).