10 papers
Symmetry-based quantum algorithms for open-shop scheduling with hard constraints
Lennart Binkowski, Gereon KoÃmann, Christian Tutschku +1
Encoding hard-constrained optimization problems into a variational quantum algorithm often turns out to be a challenging task. In this work, we provide a solution for the class of…
Practical lower bounds for hybrid quantum interior point methods in linear programming
Lennart Binkowski
Quantum interior point methods (QIPMs) promise polynomial speed-ups over classical solvers for linear programming by outsourcing the solution of Newton linear systems to quantum li…
Exhaustive and feasible parametrisation with applications to the travelling salesperson problem
Marvin Schwiering, Timo Ziegler, Lennart Binkowski +1
This paper introduces the concept of exhaustively parametrised, feasibility-respecting quantum circuits for constrained combinatorial optimisation problems. Such circuits can reach…
Deep-Circuit QAOA
Gereon KoÃmann, Lennart Binkowski, Lauritz van Luijk +2
Despite its popularity, several empirical and theoretical studies suggest that the quantum approximate optimization algorithm (QAOA) has persistent issues in providing a substantia…
Classification of coined quantum walks on the line and comparison to correlated classical random walks
Lukas Hantzko, Lennart Binkowski
We present a comprehensive classification of one-dimensional coined quantum walks on the infinite line, focusing on the spatial probability distributions they induce. Building on p…
Fast generation of Pauli transfer matrices utilizing tensor product structure
Lukas Hantzko, Lennart Binkowski, Sabhyata Gupta
Analysis of quantum processes, especially in the context of noise, errors, and decoherence is essential for the improvement of quantum devices. An intuitive representation of those…