2 papers
math.OC2024
Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling
Camille Grange, Marion Lavignac, Valentina Pozzoli +1
Quantum Approximate Optimization Algorithm (QAOA) is one of the most short-term promising quantum-classical algorithm to solve unconstrained combinatorial optimization problems. It…
quant-ph2024
Moderate Exponential-time Quantum Dynamic Programming Across the Subsets for Scheduling Problems
Camille Grange, Michael Poss, Eric Bourreau +2
Grover Search is currently one of the main quantum algorithms leading to hybrid quantum-classical methods that reduce the worst-case time complexity for some combinatorial optimiza…