3 papers
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…
quant-ph2025
Constraint-oriented biased quantum search for linear constrained combinatorial optimization problems
Sören Wilkening, Timo Ziegler, Maximilian Hess
In this paper, we extend a previously presented Grover-based heuristic to tackle general combinatorial optimization problems with linear constraints. We further describe the introd…
quant-ph2024
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…