Simulating Gaussian boson sampling on graphs in polynomial time
arXiv:2511.16558
Abstract
We show that a distribution related to Gaussian Boson Sampling (GBS) on graphs can be sampled classically in polynomial time. Graphical applications of GBS typically sample from this distribution, and thus quantum algorithms do not provide exponential speedup for these applications. We also show that another distribution related to Boson sampling can be sampled classically in polynomial time.
11 pages, 2 figures