跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.17845 · v1

Tight Quantum Query Bounds for Minimum Cut and Multicut on Dense Graphs

首次提交 2026-11-13 15:28
版本更新 2026-11-13 15:28
雷达观测 2026-11-16 10:40
arXiv ↗PDF ↗

摘要

We determine the dense worst-case quantum query complexity of exact minimum multicut on simple unweighted undirected graphs. With at most kk explicit demand pairs, our adjacency-array algorithm uses $\OO(n+\min\{m,n^{3/2}\sqrt{k}\})$ queries; a matching lower bound holds for every 1≤k≤⌊n/2⌋1\le k\le\lfloor n/2\rfloor and sufficiently large nn, with constants uniform in kk. In particular, the k=1k=1 case gives an $\OO(n^{3/2})$ query algorithm for prescribed ss--tt cut. The upper bound combines degree-sensitive spectral estimates of local improvement with refinement by unions of label classes. These steps retain every original optimum and permit exact acquisition without an additional label-count factor. Separately, we prove an Ω(n3/2)Ω(n^{3/2}) global minimum-cut lower bound on dense connected graphs, matching the existing upper bound up to polylogarithmic factors. It holds for the value and for any optimum shore, even with known degrees and sorted neighbor arrays; regular hard instances have balanced optimum cuts. Both lower bounds use degree-preserving switches and classify optimum outputs across a hidden threshold. Our upper bound concerns input queries, not total running time: computation on acquired data may be exponential, even in the single-demand case. Matching bounds at each prescribed sparse edge count are not established.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-13 15:28 · 最新观测版本

Tight Quantum Query Bounds for Minimum Cut and Multicut on Dense Graphs

We determine the dense worst-case quantum query complexity of exact minimum multicut on simple unweighted undirected graphs. With at most kk explicit demand pairs, our adjacency-array algorithm uses $\OO(n+\min\{m,n^{3/2}\sqrt{k}\})$ queries; a matching lower bound holds for every 1≤k≤⌊n/2⌋1\le k\le\lfloor n/2\rfloor and sufficiently large nn, with constants uniform in kk. In particular, the k=1k=1 case gives an $\OO(n^{3/2})$ query algorithm for prescribed ss--tt cut. The upper bound combines degree-sensitive spectral estimates of local improvement with refinement by unions of label classes. These steps retain every original optimum and permit exact acquisition without an additional label-count factor. Separately, we prove an Ω(n3/2)Ω(n^{3/2}) global minimum-cut lower bound on dense connected graphs, matching the existing upper bound up to polylogarithmic factors. It holds for the value and for any optimum shore, even with known degrees and sorted neighbor arrays; regular hard instances have balanced optimum cuts. Both lower bounds use degree-preserving switches and classify optimum outputs across a hidden threshold. Our upper bound concerns input queries, not total running time: computation on acquired data may be exponential, even in the single-demand case. Matching bounds at each prescribed sparse edge count are not established.

查看此版本解读 →查看此版本原文 ↗