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,…
quant-ph2026
Quantum Eigensolver for Non-Normal Matrices via Ground State Energy Estimation
Honghong Lin, Yun Shang
Large-scale eigenvalue problems pose a significant challenge to classical computers. While there are efficient quantum algorithms for unitary or Hermitian matrices, eigenvalue prob…
quant-ph2024
Deterministic Search on Complete Bipartite Graphs by Continuous Time Quantum Walk
Honghong Lin, Yun Shang
This paper presents a deterministic search algorithm on complete bipartite graphs. Our algorithm adopts the simple form of alternating iterations of an oracle and a continuous-time…