40 citations · 53 across the 4 of their papers we have counts for
5 papers
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…
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,…
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…
NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
Rhonda Au-Yeung, Nicholas Chancellor, Pascal Halffmann
In the last decade, public and industrial research funding has moved quantum computing from the early promises of Shor's algorithm through experiments to the era of noisy intermedi…
A Quantum Computing Approach for the Unit Commitment Problem
Pascal Halffmann, Patrick Holzer, Kai Plociennik +1
Planning energy production is a challenging task due to its cost-sensitivity, fast-moving energy markets, uncertainties in demand, and technical constraints of power plants. Thus,…