11 papers · 1 filter
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…
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…
Quantum Fisher-Yates shuffle: Unifying methods for generating uniform superpositions of permutations
Lennart Binkowski, Marvin Schwiering
Uniform superpositions over permutations play a central role in quantum error correction, cryptography, and combinatorial optimisation. We introduce a simple yet powerful quantisat…
A quantum search method for quadratic and multidimensional knapsack problems
Sören Wilkening, Andreea-Iulia Lefterovici, Lennart Binkowski +5
Solving combinatorial optimization problems is a promising application area for quantum algorithms in real-world scenarios. In this work, we extend the "Quantum Tree Generator" (QT…
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…