4 papers · 1 filter
Grover Adaptive Search with Problem-Specific State Preparation
Maximilian Hess, Lilly Palackal, Abhishek Awasthi +5
Grover's search algorithm is one of the basic building block in the world of quantum algorithms. Successfully applying it to combinatorial optimization problems is a subtle challen…
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…
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…