26 citations · 53 across the 14 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
quant-ph2026
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…
quant-ph2026
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…
quant-ph2026
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…