Latest advancements on Boson sampling part4(Quantum Information Science)

<ol> <li>Solving Graph Problems Using Gaussian Boson Sampling(arXiv)</li> </ol> <p>Author :&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Deng%2C+Y" rel="noopener ugc nofollow" target="_blank">Yu-Hao Deng</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Gong%2C+S" rel="noopener ugc nofollow" target="_blank">Si-Qiu Gong</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Gu%2C+Y" rel="noopener ugc nofollow" target="_blank">Yi-Chao Gu</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Zhang%2C+Z" rel="noopener ugc nofollow" target="_blank">Zhi-Jiong Zhang</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Liu%2C+H" rel="noopener ugc nofollow" target="_blank">Hua-Liang Liu</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Su%2C+H" rel="noopener ugc nofollow" target="_blank">Hao Su</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Tang%2C+H" rel="noopener ugc nofollow" target="_blank">Hao-Yang Tang</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Xu%2C+J" rel="noopener ugc nofollow" target="_blank">Jia-Min Xu</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Jia%2C+M" rel="noopener ugc nofollow" target="_blank">Meng-Hao Jia</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Chen%2C+M" rel="noopener ugc nofollow" target="_blank">Ming-Cheng Chen</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Zhong%2C+H" rel="noopener ugc nofollow" target="_blank">Han-Sen Zhong</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Wang%2C+H" rel="noopener ugc nofollow" target="_blank">Hui Wang</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Yan%2C+J" rel="noopener ugc nofollow" target="_blank">Jiarong Yan</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Hu%2C+Y" rel="noopener ugc nofollow" target="_blank">Yi Hu</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Huang%2C+J" rel="noopener ugc nofollow" target="_blank">Jia Huang</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Zhang%2C+W" rel="noopener ugc nofollow" target="_blank">Wei-Jun Zhang</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Li%2C+H" rel="noopener ugc nofollow" target="_blank">Hao Li</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Jiang%2C+X" rel="noopener ugc nofollow" target="_blank">Xiao Jiang</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=You%2C+L" rel="noopener ugc nofollow" target="_blank">Lixing You</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Wang%2C+Z" rel="noopener ugc nofollow" target="_blank">Zhen Wang</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Li%2C+L" rel="noopener ugc nofollow" target="_blank">Li Li</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Liu%2C+N" rel="noopener ugc nofollow" target="_blank">Nai-Le Liu</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Lu%2C+C" rel="noopener ugc nofollow" target="_blank">Chao-Yang Lu</a>,&nbsp;<a href="https://arxiv.org/search/?searchtype=author&amp;query=Pan%2C+J" rel="noopener ugc nofollow" target="_blank">Jian-Wei Pan</a></p> <p>Abstract : 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 Jiuzhang, 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 &mdash; and how it scales &mdash; with an increasing system size on noisy quantum devices in the computationally interesting regime. We experimentally observe the presence of GBS enhancement with 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.</p> <p><a href="https://medium.com/@monocosmo77/latest-advancements-on-boson-sampling-part4-quantum-information-science-4b0b98f0d995"><strong>Website</strong></a></p>