Lecture notes in computer science

Simulating Sparse and Shallow Gaussian Boson Sampling

Zoltán Kolarovszki, Ágoston Kaposi, Tamás Kozsik, Zoltán Zimborás

Published Jan 1, 2023• 2 citations

Publisher

DOI: 10.1007/978-3-031-36030-5_17

Related papers

Classical simulations of Gaussian boson sampling

Rachel S. Chadwick

Jan 1, 20220 citations

Classical algorithm for simulating experimental Gaussian boson sampling

Changhun Oh, Minzhao Liu, Yuri Alexeev +2 more

arXiv:2306.03709Nature PhysicsJun 25, 202457 citations

Speedup in classical simulation of Gaussian boson sampling

Bujiao Wu, Bin Cheng, Fei Jia +3 more

arXiv:1908.10070中国科学通报：英文版Feb 19, 202012 citations

Simulating Gaussian boson sampling on graphs in polynomial time

Konrad Anand, Zongchen Chen, Mary Cryan +4 more

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.

quant-pharXiv:2511.16558Nov 21, 20250 citations

Efficient sampling from shallow Gaussian quantum-optical circuits with local interactions

Haoyu Qi, Diego Cifuentes, Kamil Brádler +3 more

Gaussian boson sampling is a candidate model for demonstrating quantum computational advantage in photonic systems. Here, the authors narrow down the range of possible architectures for such a demonstration, by introducing a classical algorithm that can simulate optical systems with shallow-depth circuits and local gates in polynomial time.

Physical Review AMay 6, 202212 citations

Gaussian Boson Sampling

Claudio Conti

Quantum science and technologySep 4, 20230 citations