Abstract We apply a standard encoding technique to reformulate Diophantine equations as polynomial unconstrained binary optimization (PUBO) problems and study their solvability using the quantum approximate optimization algorithm (QAOA).
Cáceres et al. (Thu,) studied this question.