在图上以多项式时间模拟高斯玻色采样
Simulating Gaussian boson sampling on graphs in polynomial time
Konrad Anand, Zongchen Chen, Mary Cryan, Graham Freifeld, Leslie Ann Goldberg, Heng Guo, Xinyuan Zhang
AI 速读 基于摘要
作者报告,与图上高斯玻色采样(GBS)相关的一个分布以及另一个与玻色采样相关的分布,都可以在经典计算下以多项式时间采样。
quant-ph · cs.DS
查看原文摘要
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.