References
- Caianiello ER. On quantum field theory I: explicit solution of Dyson's equation in electrodynamics without use of Feynman graphs. Il Nuovo Cimento (1943–1954). 1953;10(12):1634–1652.
- Barvinok A. Combinatorics and complexity of partition functions. Vol. 30. Berlin: Springer; 2017.
- Brádler K, Friedland S, Izaac J, et al. Graph isomorphism and Gaussian boson sampling; 2018. arXiv:1810.10644.
- Schur I. Über endliche gruppen und hermitesche formen. Math Z. 1918;1(2–3):184–207.
- Bapat RB, Sunder VS. An extremal property of the permanent and the determinant. Linear Algebra Appl. 1986;76:153–163.
- Marcus M, Newman M. Inequalities for the permanent function. Ann Math. 1962;75:47–62.
- Aaronson S. A linear-optical proof that the permanent is #P-hard. Proc R Soc A. 2011;467(2136):3393–3405.
- Marcus M, Minc HA survey of matrix theory and matrix inequalities. Vol. 14. Boston: Allyn & Bacon Inc; 1992.
- Hamilton CS, Kruse R, Sansoni L, et al. Gaussian boson sampling. Phys Rev Lett. 2017;119:170501.
- Aaronson S, Arkhipov A. The computational complexity of linear optics. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing. ACM; 2011. p. 333–342.
- Weedbrook C, Pirandola S, García-Patrón R, et al. Gaussian quantum information. Rev Mod Phys. 2012;84(2):621–669.
- Brádler K, Dallaire-Demers PL, Rebentrost P, et al. Gaussian boson sampling for perfect matchings of arbitrary graphs. Phys Rev A. 2018;98(3):032310.