Fetching the paper…
Reading the bibliography…
A device called a 'Gaussian Boson Sampler' has initially been proposed as a near-term demonstration of classically intractable quantum computation.
Leon Isserlis, “On a formula for the product-moment coefficient of any order of a normal frequency distribution in any number of variables,” Biometrika 12
1918
Earlier work this paper cites.
Ole J Heilmann and Elliott H Lieb, “Theory of monomer-dimer systems,” in Statistical Mechanics (Springer, 1972) pp. 45–87
1972
Earlier work this paper cites.
Ivan Gutman, “The acyclic polynomial of a graph,” Publ. Inst. Math.(Beograd)(NS) 22
1977
Earlier work this paper cites.
Leslie G Valiant, “The complexity of computing the permanent,” Theoretical computer science 8
1979
Earlier work this paper cites.
E.J Farrell, “An introduction to matching polynomials,” Journal of Combinatorial Theory, Series B 27
1979
Earlier work this paper cites.
Edward J Farrell, “An introduction to matching polynomials,” Journal of Combinatorial Theory, Series B 27
1979
Earlier work this paper cites.
Brendan D McKay et al. , Practical graph isomorphism (Department of Computer Science, Vanderbilt University Tennessee, USA, 1981)
1981
Earlier work this paper cites.
Chris D. Godsil and Ivan Gutman, “On the theory of the matching polynomial,” Journal of Graph Theory 5
1981
Earlier work this paper cites.
Christopher David Godsil, “Matchings and walks in graphs,” Journal of Graph Theory 5
1981
Earlier work this paper cites.
Dragos M Cvetkovic, Michael Doob, Ivan Gutman, and Aleksandar Torgašev, Recent results in the theory of graph spectra , Vol. 36 (Elsevier, 1988)
1988
Earlier work this paper cites.
Chris Godsil, Algebraic Combinatorics (Chapman Hall Crc Mathematics Series, 1993)
1993
Earlier work this paper cites.
Bernhard Scholkopf and Alexander J Smola, Learning with kernels: support vector machines, regularization, optimization, and beyond (MIT press, 2001)
2001
Earlier work this paper cites.
Thomas Gärtner, Peter Flach, and Stefan Wrobel, “On graph kernels: Hardness results and efficient alternatives,” in Learning theory and kernel machines (Springer, 2003) pp. 129–143
2003
Earlier work this paper cites.
Bodo Lass, “Matching polynomials and duality,” Combinatorica 24
2004
Earlier work this paper cites.
Ilia Averbouch, Benny Godlin, and Johann A. Makowsky, “A most general edge elimination polynomial,” in Graph-Theoretic Concepts in Computer Science , edited by Hajo Broersma, Thomas Erlebach, Tom Friedetzky, and Daniel Paulusma (Springer Berlin Heidelberg, Berlin, Heidelberg, 2008) pp. 31–42
2008
Earlier work this paper cites.
Nino Shervashidze, SVN Vishwanathan, Tobias Petri, Kurt Mehlhorn, and Karsten Borgwardt, “Efficient graphlet kernels for large graph comparison,” in Artificial Intelligence and Statistics (2009) pp. 488–495
2009
Cited alongside, same era.
László Lovász and Michael D Plummer, Matching theory , Vol. 367 (American Mathematical Society, 2009)
2009
Cited alongside, same era.
Scott Aaronson and Alex Arkhipov, “The computational complexity of linear optics,” in Proceedings of the forty-third annual ACM symposium on Theory of computing (ACM, 2011) pp. 333–342
2011
Cited alongside, same era.
Johannes Kobler, Uwe Schöning, and Jacobo Torán, The graph isomorphism problem: its structural complexity (Springer Science & Business Media, 2012)
2012
Cited alongside, same era.
Christian Weedbrook, Stefano Pirandola, Raúl García-Patrón, Nicolas J Cerf, Timothy C Ralph, Jeffrey H Shapiro, and Seth Lloyd, “Gaussian quantum information,” Reviews of Modern Physics 84
Craig S Hamilton, Regina Kruse, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex, “Gaussian boson sampling,” Physical review letters 119
2017
Later among the works it cites.
Swarnendu Ghosh, Nibaran Das, Teresa Gonçalves, Paulo Quaresma, and Mahantapas Kundu, “The journey of graph kernels through two decades,” Computer Science Review 27
2018
Later among the works it cites.
2018
Later among the works it cites.
Kamil Brádler, Pierre-Luc Dallaire-Demers, Patrick Rebentrost, Daiqin Su, and Christian Weedbrook, “Gaussian boson sampling for perfect matchings of arbitrary graphs,” Physical Review A 98
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…
2012
Cited alongside, same era.
2012
Cited alongside, same era.
Max Tillmann, Borivoje Dakić, René Heilmann, Stefan Nolte, Alexander Szameit, and Philip Walther, “Experimental boson sampling,” Nature Photonics 7
2013
Cited alongside, same era.
Matthew A Broome, Alessandro Fedrizzi, Saleh Rahimi-Keshari, Justin Dove, Scott Aaronson, Timothy C Ralph, and Andrew G White, “Photonic boson sampling in a tunable circuit,” Science 339
2013
Cited alongside, same era.
AP Lund, A Laing, S Rahimi-Keshari, T Rudolph, Jeremy L O’Brien, and TC Ralph, “Boson sampling from a gaussian state,” Physical review letters 113
2014
Cited alongside, same era.
Nils Kriege, Marion Neumann, Kristian Kersting, and Petra Mutzel, “Explicit versus implicit graph feature maps: A computational phase transition for walk kernels,” in Data Mining (ICDM), 2014 IEEE International Conference on (IEEE, 2014) pp. 881–886
2014
Cited alongside, same era.
Aditya Grover and Jure Leskovec, “node2vec: Scalable feature learning for networks,” in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining (ACM, 2016) pp. 855–864
2016
Cited alongside, same era.
Alexander Barvinok, “Approximating permanents and hafnians,” arXiv preprint arXiv:1601.07518 (2016)
2016
Cited alongside, same era.
2018
Later among the works it cites.
Daokun Zhang, Jie Yin, Xingquan Zhu, and Chengqi Zhang, “Network representation learning: A survey,” IEEE transactions on Big Data (2018)
2018
Later among the works it cites.
Palash Goyal and Emilio Ferrara, “Graph embedding techniques, applications, and performance: A survey,” Knowledge-Based Systems 151
2018
Later among the works it cites.
To derive Eq. ( 5
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
Maria Schuld and Nathan Killoran, “Quantum machine learning in feature Hilbert spaces,” Physical review letters 122
2019
Closest in time.
Vojtěch Havlíček, Antonio D Córcoles, Kristan Temme, Aram W Harrow, Abhinav Kandala, Jerry M Chow, and Jay M Gambetta, “Supervised learning with quantum-enhanced feature spaces,” Nature 567
2019
Closest in time.
Nicolás Quesada, “Franck-condon factors by counting perfect matchings of graphs with loops,” The Journal of chemical physics 150
2019
Closest in time.
2019
Closest in time.
The Sage Developers, SageMath, the Sage Mathematics Software System (Version 8.8) (2019), https://www.sagemath.org
2019
Closest in time.