28 citations · 63 across the 9 of their papers we have counts for
4 papers · 1 filter
Effective Embedding of Integer Linear Inequalities for Variational Quantum Algorithms
Maximilian Hess, Lilly Palackal, Abhishek Awasthi +1
In variational quantum algorithms, constraints are usually added to the problem objective via penalty terms. For linear inequality constraints, this procedure requires additional s…
Improving Quantum and Classical Decomposition Methods for Vehicle Routing
Laura S. Herzog, Friedrich Wagner, Christian Ufrecht +4
Quantum computing is a promising technology to address combinatorial optimization problems, for example via the quantum approximate optimization algorithm (QAOA). Its potential, ho…
Quantum and classical correlations in shrinking algorithms for optimization
Victor Fischer, Maximilian Passek, Friedrich Wagner +3
Understanding the benefits of quantum computing for solving combinatorial optimization problems (COPs) remains an open research question. In this work, we extend and analyze algori…
Efficient Encodings of the Travelling Salesperson Problem for Variational Quantum Algorithms
Manuel Schnaus, Lilly Palackal, Benedikt Poggel +4
Routing problems are a common optimization problem in industrial applications, which occur on a large scale in supply chain planning. Due to classical limitations for solving NP-ha…