跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2606.07322 · v3

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

首次提交 2026-06-05 22:39
版本更新 2026-11-19 16:09
雷达观测 2026-11-20 19:58
arXiv ↗PDF ↗

摘要

The traveling salesman problem (TSP) is a classic NP-hard problem. Held--Karp dynamic programming~\cite{held1962dynamic, bellman1962dynamic} solves it exactly in O(n22n)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.727n)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(n2)O(n^2) gates and O(n)O(n) depth. Under assumed QRAM model, the structured state preparation enables polynomial-depth oracle evaluation, yielding an overall running time of O∗(1.866n)O^*(1.866^n) for TSP. Qiskit simulations for n=6n=6 and 7, using QFT-based data loading in place of QRAM, yield empirical optimal-solution probabilities of 98.9%98.9\% and 100%100\%, respectively, in fixed-threshold amplitude-amplification tests.

AI 论文解读

基于摘要 · 非全文审阅

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

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

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

v3 · 2026-11-19 16:09 · 最新观测版本

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

The traveling salesman problem (TSP) is a classic NP-hard problem. Held--Karp dynamic programming~\cite{held1962dynamic, bellman1962dynamic} solves it exactly in O(n22n)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.727n)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(n2)O(n^2) gates and O(n)O(n) depth. Under assumed QRAM model, the structured state preparation enables polynomial-depth oracle evaluation, yielding an overall running time of O∗(1.866n)O^*(1.866^n) for TSP. Qiskit simulations for n=6n=6 and 7, using QFT-based data loading in place of QRAM, yield empirical optimal-solution probabilities of 98.9%98.9\% and 100%100\%, respectively, in fixed-threshold amplitude-amplification tests.

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