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

使用量子快速转发和种子集的扩展测试

Expansion Testing using Quantum Fast-Forwarding and Seed Sets

Simon Apers

摘要:

扩展测试的目的是确定一个$n$ -节点图是否至少扩展了$Φ$,或者远离任何这样的图。我们提出了一个具有复杂度$\widetilde{O}(n^{1/3}Φ^{-1})$的量子膨胀测试器。这加速了Goldreich和Ron的$\widetilde{O}(n^{1/2}Φ^{-2})$经典测试器[Monumica '02],并分别结合了Ambainis、Childs和Liu [RANDOM '11]以及Apers和Sarlette [QIC '19]的$\widetilde{O}(n^{1/3}Φ^{-2})$和$\widetilde{O}(n^{1/2}Φ^{-1})$量子加速。后一种方法建立在量子快速转发方案的基础上,我们通过在图中初始生长种子集来改进该方案。为了增长这个种子集,我们使用了一个所谓的进化集的过程,从图聚类文献,它允许增长适当的本地种子集。

英文摘要:

Expansion testing aims to decide whether an $n$-node graph has expansion at least $Φ$, or is far from any such graph. We propose a quantum expansion tester with complexity $\widetilde{O}(n^{1/3}Φ^{-1})$. This accelerates the $\widetilde{O}(n^{1/2}Φ^{-2})$ classical tester by Goldreich and Ron [Algorithmica '02], and combines the $\widetilde{O}(n^{1/3}Φ^{-2})$ and $\widetilde{O}(n^{1/2}Φ^{-1})$ quantum speedups by Ambainis, Childs and Liu [RANDOM '11] and Apers and Sarlette [QIC '19], respectively. The latter approach builds on a quantum fast-forwarding scheme, which we improve upon by initially growing a seed set in the graph. To grow this seed set we use a so-called evolving set process from the graph clustering literature, which allows to grow an appropriately local seed set.

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

↑