← 研踪 PaperTrailarXiv: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
摘要
The traveling salesman problem (TSP) is a classic NP-hard problem. Held--Karp dynamic programming~\cite{held1962dynamic, bellman1962dynamic} solves it exactly in time. Ambainis et al.~\cite{ambainis2019quantum}\ (SODA~2019) proposed a hybrid classical-quantum dynamic programming that improved the query complexity to . 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 gates and depth. Under assumed QRAM model, the structured state preparation enables polynomial-depth oracle evaluation, yielding an overall running time of for TSP. Qiskit simulations for and 7, using QFT-based data loading in place of QRAM, yield empirical optimal-solution probabilities of and , respectively, in fixed-threshold amplitude-amplification tests.
观测到的版本
相邻记录可能跳过中间版本;首次发现 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 time. Ambainis et al.~\cite{ambainis2019quantum}\ (SODA~2019) proposed a hybrid classical-quantum dynamic programming that improved the query complexity to . 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 gates and depth. Under assumed QRAM model, the structured state preparation enables polynomial-depth oracle evaluation, yielding an overall running time of for TSP. Qiskit simulations for and 7, using QFT-based data loading in place of QRAM, yield empirical optimal-solution probabilities of and , respectively, in fixed-threshold amplitude-amplification tests.
查看此版本解读 →查看此版本原文 ↗