On three tiny railway-timetabling instances, QAOA with a polynomial (PUBO) encoding returned optimal feasible solutions in 55-71% of runs versus 4-8% for a quadratic (QUBO) encoding.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling
On three tiny railway-timetabling instances, QAOA with a polynomial (PUBO) encoding returned optimal feasible solutions in 55-71% of runs versus 4-8% for a quadratic (QUBO) encoding.