continuous-time quantum walk 1graph optimization 1greedy heuristic 1hybrid quantum-classical algorithm 1minimum vertex cover 1trotterization 1
From the 1 of 2 linked papers with an AI index.
Showing quant-phShow all
2 papers · 1 filter
quant-ph2026
Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks
Ruben Pariente Bassa, Finley A. Quinton, Franz G. Fuchs +1
The paper proposes a hybrid quantum‑classical greedy algorithm that uses continuous‑time quantum walks to solve the minimum vertex cover problem (and maximum independent set) more…
quant-ph2025
Enhancing Variational Quantum Algorithms for Multicriteria Optimization
Ivica Turkalj, Tom Ewen, Pascal Halffmann +3
This paper presents methodological improvements to variational quantum algorithms (VQAs) for solving multicriteria optimization problems. We introduce two key contributions. First,…