13 citations · 22 across the 5 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
quant-ph2026
From Hilbert's Tenth Problem to Quantum Speedup: Explicit Oracles for Bounded Diophantine Systems
Gabriel Escrig, M. A. Martin-Delgado
Solving non-linear Diophantine systems lies at the mathematical core of integer optimization and cryptography. While the general unbounded problem is undecidable, even over bounded…
quant-ph2026
Resource-Scalable Fully Quantum Metropolis-Hastings for Integer Linear Programming
Gabriel Escrig, Roberto Campos, M. A. Martin-Delgado
Integer linear programming (ILP) remains computationally challenging due to its NP-complete nature despite its central role in scheduling, logistics, and design optimization. We in…