arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2505.02445quant-phcs.DS
收藏

在无权图上从高斯玻色采样分布进行高效经典采样

Efficient Classical Sampling from Gaussian Boson Sampling Distributions on Unweighted Graphs

Yexin Zhang, Shuo Zhou, Xinzhao Wang, Ziruo Wang, Ziyi Yang, Rui Yang, Yecheng Xue, Tongyang Li

AI总结:

本研究提出基于马尔可夫链蒙特卡罗的双循环Glauber动力学算法,可在多项式时间内从无权图的GBS分布采样,在256顶点图实验中性能较传统算法最高提升10倍,兼具理论保证与实用价值。

摘要:

高斯玻色采样(Gaussian Boson Sampling, GBS)是展示量子计算优势的一种很有前景的候选方案,可应用于求解图相关问题。在本研究中,我们提出了基于马尔可夫链蒙特卡罗的算法,用于从无向无权图上的GBS分布中采样。我们的核心贡献是一种双循环版本的Glauber动力学,其平稳分布与GBS分布完全匹配。我们进一步通过改进的标准路径论证证明,该算法在稠密图上的混合时间为多项式时间。在数值实验方面,我们在含256个顶点的无权图上开展了实验,其规模超过了以往的GBS实验以及经典模拟的规模。具体而言,我们证明单循环和双循环Glauber动力学针对最大Hafnian问题和最密k子图问题,均能将原始随机搜索和模拟退火算法的性能提升最高达10倍。总体而言,我们的方法为无权图上GBS分布的高效经典采样提供了理论保证与实际优势。

英文摘要:

Gaussian Boson Sampling (GBS) is a promising candidate for demonstrating quantum computational advantage and can be applied to solving graph-related problems. In this work, we propose Markov chain Monte Carlo-based algorithms to sample from GBS distributions on undirected, unweighted graphs. Our main contribution is a double-loop variant of Glauber dynamics, whose stationary distribution matches the GBS distribution. We further prove that it mixes in polynomial time for dense graphs using a refined canonical path argument. Numerically, we conduct experiments on unweighted graphs with 256 vertices, larger than the scales in former GBS experiments as well as classical simulations. In particular, we show that both the single-loop and double-loop Glauber dynamics improve the performance of original random search and simulated annealing algorithms for the max-Hafnian and densest $k$-subgraph problems up to 10$\times$. Overall, our approach offers both theoretical guarantees and practical advantages for efficient classical sampling from GBS distributions on unweighted graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑