Fetching the paper…
Reading the bibliography…
Gaussian boson sampling (GBS) is a near-term quantum computation framework that is believed to be classically intractable, but yet rich of potential applications.
On quantum field theory I: explicit solution of Dyson’s equation in electrodynamics without use of Feynman graphs
Eduardo R Caianiello · 1953
Earlier work this paper cites.
Monomers and dimers
Ole J Heilmann and Elliott H Lieb · 1970
Earlier work this paper cites.
Topological index. A newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons
Haruo Hosoya · 1971
Earlier work this paper cites.
The acyclic polynomial of a graph
Ivan Gutman · 1977
Earlier work this paper cites.
An introduction to matching polynomials
Edward J Farrell · 1979
Earlier work this paper cites.
Matchings and walks in graphs
Christopher D Godsil · 1981
Earlier work this paper cites.
On the theory of the matching polynomial
Chris D Godsil and Ivan Gutman · 1981
Earlier work this paper cites.
Recent results in the theory of graph spectra
Dragos M Cvetkovic, Michael Doob, Ivan Gutman, and Aleksandar Torgašev · 1988
Earlier work this paper cites.
Approximating the permanent
Mark Jerrum and Alistair Sinclair · 1989
Earlier work this paper cites.
Knapsack problems: algorithms and computer implementations
Silvano Martello · 1990
Earlier work this paper cites.
Algebraic Combinatorics
Chris Godsil · 1993
Earlier work this paper cites.
Matching polynomials and duality
Bodo Lass · 2004
Earlier work this paper cites.
Combinatorics of partial derivatives
Michael Hardy · 2006
Earlier work this paper cites.
C.H.C. Little · 2006
Cited alongside, same era.
A most general edge elimination polynomial
Ilia Averbouch, Benny Godlin, and Johann A. Makowsky · 2008
Cited alongside, same era.
Topics in graph theory: Graphs and their Cartesian product
Wilfried Imrich, Sandi Klavzar, and Douglas F Rall · 2008
Cited alongside, same era.
Matching theory
László Lovász and Michael D Plummer · 2009
Cited alongside, same era.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Cited alongside, same era.
Combinatorics of permutations
Miklós Bóna · 2012
Cited alongside, same era.
Gaussian boson sampling
Craig S. Hamilton, Regina Kruse, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex · 2017
Later among the works it cites.
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
Viresh Patel and Guus Regts · 2017
Later among the works it cites.
Graph isomorphism and Gaussian boson sampling
Kamil Brádler, Shmuel Friedland, Josh Izaac, Nathan Killoran, and Daiqin Su · 2018
Later among the works it cites.
Using Gaussian boson sampling to find dense subgraphs
Juan Miguel Arrazola and Thomas R Bromley · 2018
Later among the works it cites.
Gaussian boson sampling for perfect matchings of arbitrary graphs
Kamil Brádler, Pierre-Luc Dallaire-Demers, Patrick Rebentrost, Daiqin Su, and Christian Weedbrook · 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…
Boson sampling from a Gaussian state
Austin P Lund, Anthony Laing, Saleh Rahimi-Keshari, Terry Rudolph, Jeremy L O’Brien, and Timothy C Ralph · 2014
Cited alongside, same era.
Lower bounds for treewidth of product graphs
Otachi-Y. Kozawa, K. and K. Yamazaki · 2014
Cited alongside, same era.
What can quantum optics say about computational complexity theory?
Saleh Rahimi-Keshari, Austin P Lund, and Timothy C Ralph · 2015
Cited alongside, same era.
Boson sampling for molecular vibronic spectra
Joonsuk Huh, Gian Giacomo Guerreschi, Borja Peropadre, Jarrod R McClean, and Alán Aspuru-Guzik · 2015
Cited alongside, same era.
Graph Polynomials
Yongtang Shi, Matthias Dehmer, Xueliang Li, and Ivan Gutman · 2016
Cited alongside, same era.
An efficient tree decomposition method for permanents and mixed discriminants
Diego Cifuentes and Pablo A Parrilo · 2016
Cited alongside, same era.
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, and Daniel Štefankovič · 2018
Later among the works it cites.
A detailed study of Gaussian Boson Sampling
Regina Kruse, Craig S Hamilton, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex · 2018
Later among the works it cites.
Nonnegativity for hafnians of certain matrices
Kamil Brádler, Shmuel Friedland, and Robert Israel · 2018
Later among the works it cites.
Strongly regular graphs
Ted Spence · 2018
Later among the works it cites.
Molecular Docking with Gaussian Boson Sampling
Leonardo Banchi, Mark Fingerhuth, Tomáš Babej, and Juan Miguel Arrazola · 2019
Closest in time.
A quantum hardware-induced graph kernel based on Gaussian Boson Sampling
Maria Schuld, Kamil Brádler, Robert Israel, Daiqin Su, and Brajesh Gupt · 2019
Closest in time.
SageMath, the Sage Mathematics Software System (Version 8.8)
The Sage Developers · 2019
Closest in time.