On finding PUBO problems on Diophantine equations

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

Authors

Institutions

Publication Details

Journal
Quantum Information Processing
Published
2026-03-26
DOI
https://doi.org/10.1007/s11128-026-05143-y
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On finding PUBO problems on Diophantine equations

I. F. Rúa, J. M. Hernández Cáceres
Quantum Information Processing
Quantum Computing Algorithms and Architecture
article

On finding PUBO problems on Diophantine equations

I. F. Rúa, J. M. Hernández Cáceres
article en

Abstract

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

Quantum Information ProcessingVol. 25(4)
Universidad de Oviedo (ES)
Openalex Percentile: Top 8%
Quantum Computing Algorithms and Architecture
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

On finding PUBO problems on Diophantine equations — I. F. Rúa, J. M. Hernández Cáceres · Quantum Information Processing (2026) | TGRS Research Map | TGRS