works on
algorithmic complexity 1approximation algorithms 1linear time 1product distributions 1total variation distance 1

From the 1 of 6 linked papers with an AI index.

activity
20242026
collaborators
Showing quant-phShow all

1 paper · 1 filter

quant-ph2026

Simulating Gaussian boson sampling on graphs in polynomial time

Konrad Anand, Zongchen Chen, Mary Cryan +4

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 th…