English

Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage

Quantum Physics 2023-09-06 v3

Abstract

We report new Gaussian boson sampling experiments with pseudo-photon-number-resolving detection, which register up to 255 photon-click events. We consider partial photon distinguishability and develop a more complete model for the characterization of the noisy Gaussian boson sampling. In the quantum computational advantage regime, we use Bayesian tests and correlation function analysis to validate the samples against all current classical mockups. Estimating with the best classical algorithms to date, generating a single ideal sample from the same distribution on the supercomputer Frontier would take ~ 600 years using exact methods, whereas our quantum computer, Jiuzhang 3.0, takes only 1.27 us to produce a sample. Generating the hardest sample from the experiment using an exact algorithm would take Frontier ~ 3.1*10^10 years.

Keywords

Cite

@article{arxiv.2304.12240,
  title  = {Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage},
  author = {Yu-Hao Deng and Yi-Chao Gu and Hua-Liang Liu and Si-Qiu Gong and Hao Su and Zhi-Jiong Zhang and Hao-Yang Tang and Meng-Hao Jia and Jia-Min Xu and Ming-Cheng Chen and Jian Qin and Li-Chao Peng and Jiarong Yan and Yi Hu and Jia Huang and Hao Li and Yuxuan Li and Yaojian Chen and Xiao Jiang and Lin Gan and Guangwen Yang and Lixing You and Li Li and Han-Sen Zhong and Hui Wang and Nai-Le Liu and Jelmer J. Renema and Chao-Yang Lu and Jian-Wei Pan},
  journal= {arXiv preprint arXiv:2304.12240},
  year   = {2023}
}

Comments

PRL 2023 to appear

R2 v1 2026-06-28T10:16:05.065Z