26 citations · 53 across the 14 of their papers we have counts for
15 papers
Refuting the QAOA fixed-angle conjecture
Lennart Binkowski
The fixed-angle conjecture for the quantum approximate optimisation algorithm (QAOA) is shown to be false for depth-2 QAOA on 9-regular graphs, and proven to be correct for depth-1…
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…
Quantum tree generator improves QAOA state-of-the-art for the knapsack problem
Paul Christiansen, Lennart Binkowski, Debora Ramacciotti +1
This paper introduces a novel approach to the Quantum Approximate Optimization Algorithm (QAOA), specifically tailored to the knapsack problem. We combine the recently proposed qua…
One for All: Universal Quantum Conic Programming Framework for Hard-Constrained Combinatorial Optimization Problems
Lennart Binkowski, Tobias J. Osborne, Marvin Schwiering +2
We present a unified quantum-classical framework for addressing NP-complete constrained combinatorial optimisation problems, generalising the recently proposed Quantum Conic Progra…
Tensorized Pauli decomposition algorithm
Lukas Hantzko, Lennart Binkowski, Sabhyata Gupta
This paper introduces a novel general-purpose algorithm for Pauli decomposition that employs matrix slicing and addition rather than expensive matrix multiplication, significantly…
A quantum algorithm for solving 0-1 Knapsack problems
Sören Wilkening, Andreea-Iulia Lefterovici, Lennart Binkowski +3
Here we present two novel contributions for achieving quantum advantage in solving difficult optimisation problems, both in theory and foreseeable practice. (1) We introduce the "Q…
From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits
Lennart Binkowski, Gereon Koßmann, Tobias J. Osborne +2
Optimisation via parameterised quantum circuits is the prevalent technique of near-term quantum algorithms. However, the omnipresent phenomenon of barren plateaus - parameter regio…
Elementary Proof of QAOA Convergence
Lennart Binkowski, Gereon Koßmann, Timo Ziegler +1
The Quantum Alternating Operator Ansatz (QAOA) and its predecessor, the Quantum Approximate Optimization Algorithm, are one of the most widely used quantum algorithms for solving c…
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…
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…