3 papers
quant-ph2026
Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the 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 time,…
cs.CV2026
Event-Based Method for High-Speed 3D Deformation Measurement under Extreme Illumination Conditions
Banglei Guan, Yifei Bian, Zibin Liu +6
Background: Large engineering structures, such as space launch towers and suspension bridges, are subjected to extreme forces that cause high-speed 3D deformation and compromise sa…
quant-ph2025
A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits
Bai Xujun, Shang Yun
The Traveling Salesman Problem (TSP) is a classical NP-hard problem that plays a crucial role in combinatorial optimization. In this paper, we are interested in the quantum search…