arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.00536quant-ph
收藏

基于高斯玻色采样的图问题量子启发经典算法

Quantum-inspired classical algorithm for graph problems by Gaussian boson sampling

Changhun Oh, Bill Fefferman, Liang Jiang, Nicolás Quesada

AI总结:

本文提出一种量子启发经典算法用于最密k-子图和最大权重团等图问题,数值比较表明高斯玻色采样器相比该经典采样器在一般情况下并无显著优势。

摘要:

我们提出了一种量子启发经典算法,可用于图论问题,例如寻找最密k-子图和寻找最大权重团,这些问题被提出作为高斯玻色采样器的应用。高斯玻色采样器的主要观察是,要编码到高斯玻色采样器中的给定图的邻接矩阵是非负的,这不需要量子干涉。我们首先提供如何将给定的图问题编程到我们的高效经典算法中。然后,我们在寻找最密k-子图和寻找最大权重团的任务中,数值比较了理想高斯玻色采样器、有损高斯玻色采样器、我们的量子启发经典采样器以及均匀采样器的性能,并表明高斯玻色采样器的优势在一般情况下并不显著。最后,我们讨论了高斯玻色采样器相对于所提出的采样器的潜在优势。

英文摘要:

We present a quantum-inspired classical algorithm that can be used for graph-theoretical problems, such as finding the densest $k$-subgraph and finding the maximum weight clique, which are proposed as applications of a Gaussian boson sampler. The main observation from Gaussian boson samplers is that a given graph's adjacency matrix to be encoded in a Gaussian boson sampler is nonnegative, which does not necessitate quantum interference. We first provide how to program a given graph problem into our efficient classical algorithm. We then numerically compare the performance of ideal and lossy Gaussian boson samplers, our quantum-inspired classical sampler, and the uniform sampler for finding the densest $k$-subgraph and finding the maximum weight clique and show that the advantage from Gaussian boson samplers is not significant in general. We finally discuss the potential advantage of a Gaussian boson sampler over the proposed sampler.

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

↑