Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
A Resource-Efficient Variational Quantum Framework for the Traveling Salesman Problem
Yuefeng Lin, Chao Zheng, Cong Guo
The Traveling Salesman Problem (TSP) is a prototypical combinatorial optimization problem, but its quantum implementation is limited by the O(n^2)-qubit overhead of standard one-ho…
quant-ph2026
Enhanced Distributed Variational Quantum Eigensolver for Large-Scale MaxCut Problem
Yuefeng Lin, Kun Wang, Qinyuan Zheng +6
MaxCut is a canonical NP-hard combinatorial optimization problem in graph theory with broad applications ranging from physics to bioinformatics. Although variational quantum algori…
quant-ph2023
Pure Quantum Gradient Descent Algorithm and Full Quantum Variational Eigensolver
Ronghang Chen, Shi-Yao Hou, Cong Guo +1
Optimization problems are prevalent in various fields, and the gradient-based gradient descent algorithm is a widely adopted optimization method. However, in classical computing, c…