Year: 2026
Type: article
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).
Source: Quantum Information Processing
Authors: J. M. Hernández Cáceres, I. F. Rúa
Institution: Universidad de Oviedo
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,990
OpenAlex ID: W7140688442