3 papers
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
We introduce a constraint-preserving hybrid quantum-classical greedy framework for the minimum vertex cover problem, which extends directly to maximum independent set by bitwise co…
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,…
quant-ph2024
Harnessing Inferior Solutions For Superior Outcomes: Obtaining Robust Solutions From Quantum Algorithms
Pascal Halffmann, Steve Lenk, Michael Trebing
In the rapidly advancing domain of quantum optimization, the confluence of quantum algorithms such as Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAO…