5 papers · 1 filter
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,…
Beyond Single Trajectories: Optimal Control and Jordan-Lie Algebra in Hybrid Quantum Walks for Combinatorial Optimization
Tianen Chen, Yun Shang
The Quantum Approximate Optimization Algorithm (QAOA) follows a single, fixed evolution path, overlooking the potential computational advantage of coherently superposing multiple t…
Hybrid Gaussian-exponential zero-noise extrapolation for periodic circuits
Tao Wang, Yun Shang
Zero-noise extrapolation provides a practical means of suppressing gate errors in current noisy intermediate-scale quantum hardware. The accuracy of the zero-noise estimate depends…
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…
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…