跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 08:44 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 13:48 — 2026-11-22 13:48(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 08:44最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 08:42(北京时间)
版本更新 · v3arXiv:2606.07322

A Non-Nested Quantum Search for TSP: Explicit Oracle Construction Beyond the $2^n$ Barrier

Xujun Bai, Yun Shang, Honghong Lin

原文摘要

The traveling salesman problem (TSP) is a classic NP-hard problem. Held--Karp dynamic programming~\cite{held1962dynamic, bellman1962dynamic} solves it exactly in $O(n^2 2^n)$ time. Ambainis et al.~\cite{ambainis2019quantum}\ (SODA~2019) proposed a hybrid classical-quantum dynamic programming that improved the query complexity to $O^*(1.727^n)$. However, their algorithm uses nested quantum minimum finding, which complicates coherent circuit implementation, particularly the handling of threshold updates within nested subroutines. To address this difficulty, we design a quantum divide-and-conquer framework without any recursive process. We overcome the oracle-construction bottleneck by preparing a set partition state, requiring $O(n^2)$ gates and $O(n)$ depth. Under assumed QRAM model, the structured state preparation enables polynomial-depth oracle evaluation, yielding an overall running time of $O^*(1.866^n)$ for TSP. Qiskit simulations for $n=6$ and 7, using QFT-based data loading in place of QRAM, yield empirical optimal-solution probabilities of $98.9\%$ and $100\%$, respectively, in fixed-threshold amplitude-amplification tests.

quant-ph · cs.CC