20 citations · 27 across the 9 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
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…
math.OC2022★ 20 cited
An introduction to variational quantum algorithms for combinatorial optimization problems
Camille Grange, Michael Poss, Eric Bourreau
Noisy intermediate-scale quantum computers (NISQ computers) are now readily available, motivating many researchers to experiment with Variational Quantum Algorithms (VQAs). Among t…