Scholarlink

<p>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).</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On finding PUBO problems on Diophantine equations

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年3月26日

查看全文
  • J. M. Hernández Cáceres,
  • I. F. Rúa

摘要

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).