Solving Graph Problems Using Gaussian Boson Sampling

• Published in: Physical review letters Vol. 130; no. 19; p. 190601
• Main Authors: Deng, Yu-Hao, Gong, Si-Qiu, Gu, Yi-Chao, Zhang, Zhi-Jiong, Liu, Hua-Liang, Su, Hao, Tang, Hao-Yang, Xu, Jia-Min, Jia, Meng-Hao, Chen, Ming-Cheng, Zhong, Han-Sen, Wang, Hui, Yan, Jiarong, Hu, Yi, Huang, Jia, Zhang, Wei-Jun, Li, Hao, Jiang, Xiao, You, Lixing, Wang, Zhen, Li, Li, Liu, Nai-Le, Lu, Chao-Yang, Pan, Jian-Wei
• Format: Journal Article
• Language: English
• Published: United States 12.05.2023
• ISSN: 1079-7114
• DOI: 10.1103/PhysRevLett.130.190601

Gaussian boson sampling (GBS) is not only a feasible protocol for demonstrating quantum computational advantage, but also mathematically associated with certain graph-related and quantum chemistry problems. In particular, it is proposed that the generated samples from the GBS could be harnessed to enhance the classical stochastic algorithms in searching some graph features. Here, we use Jiǔzhāng, a noisy intermediate-scale quantum computer, to solve graph problems. The samples are generated from a 144-mode fully connected photonic processor, with photon click up to 80 in the quantum computational advantage regime. We investigate the open question of whether the GBS enhancement over the classical stochastic algorithms persists-and how it scales-with an increasing system size on noisy quantum devices in the computationally interesting regime. We experimentally observe the presence of GBS enhancement with a large photon-click number and a robustness of the enhancement under certain noise. Our work is a step toward testing real-world problems using the existing noisy intermediate-scale quantum computers and hopes to stimulate the development of more efficient classical and quantum-inspired algorithms.