Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Anand et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: