Preprint
Jul 2026
Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks
A constraint-preserving hybrid quantum-classical greedy framework for the minimum vertex cover problem, which extends directly to maximum independent set by bitwise complementation, and which achieves lower mean approximation ratios and solve a larger fraction of instances optimally than their corresponding classical g...
R. P. Bassa, F. A. Quinton, Franz G. Fuchs et al.
· 0 citations