Resource-Scalable Fully Quantum Metropolis-Hastings for Integer Linear Programming
Summarize this article with:
Quantum Physics arXiv:2602.11285 (quant-ph) [Submitted on 11 Feb 2026] Title:Resource-Scalable Fully Quantum Metropolis-Hastings for Integer Linear Programming Authors:Gabriel Escrig, Roberto Campos, M. A. Martin-Delgado View a PDF of the paper titled Resource-Scalable Fully Quantum Metropolis-Hastings for Integer Linear Programming, by Gabriel Escrig and Roberto Campos and M. A. Martin-Delgado View PDF HTML (experimental) Abstract:Integer linear programming (ILP) remains computationally challenging due to its NP-complete nature despite its central role in scheduling, logistics, and design optimization. We introduce a fully quantum Metropolis-Hastings algorithm for ILP that implements a coherent random walk over the discrete feasible region using only reversible quantum circuits, without quantum-RAM assumptions or classical pre/post-processing. Each walk step is a unitary update that prepares coherent candidate moves, evaluates the objective and constraints reversibly -- including a constraint-satisfaction counter to enforce feasibility -- and encodes Metropolis acceptance amplitudes via a low-overhead linearized rule. At the logical level, the construction uses $\mathcal{O}(n\log_2 N)$ qubits to represent $n$ integer variables over the interval $[-N,\,N-1]$, and the Toffoli-equivalent cost per Metropolis step grows linearly with the total logical qubit count. Using explicit ripple-carry adder constructions, we support linear objectives and mixed equality/inequality constraints. Numerical circuit-level simulations on a broad ensemble of randomly generated instances validate the predicted linear resource scaling and exhibit progressive thermalization toward low-cost feasible solutions under the annealing schedule. Overall, the method provides a coherent, resource-characterized baseline for fully quantum constraint programming and a foundation for incorporating additional quantum speedups in combinatorial optimization. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2602.11285 [quant-ph] (or arXiv:2602.11285v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2602.11285 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Gabriel Escrig [view email] [v1] Wed, 11 Feb 2026 19:01:45 UTC (1,763 KB) Full-text links: Access Paper: View a PDF of the paper titled Resource-Scalable Fully Quantum Metropolis-Hastings for Integer Linear Programming, by Gabriel Escrig and Roberto Campos and M. A. Martin-DelgadoView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-02 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)