Simulating Gaussian boson sampling on graphs in polynomial time
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909915609563136 |
|---|---|
| author | Anand, Konrad Chen, Zongchen Cryan, Mary Freifeld, Graham Goldberg, Leslie Ann Guo, Heng Zhang, Xinyuan |
| author_facet | Anand, Konrad Chen, Zongchen Cryan, Mary Freifeld, Graham Goldberg, Leslie Ann Guo, Heng Zhang, Xinyuan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_16558 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Simulating Gaussian boson sampling on graphs in polynomial time Anand, Konrad Chen, Zongchen Cryan, Mary Freifeld, Graham Goldberg, Leslie Ann Guo, Heng Zhang, Xinyuan Quantum Physics Data Structures and Algorithms 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. |
| title | Simulating Gaussian boson sampling on graphs in polynomial time |
| topic | Quantum Physics Data Structures and Algorithms |
| url | https://arxiv.org/abs/2511.16558 |