An error-mitigated quantum annealing solution for the weighted Max-Cut problem on a cubic lattice

[2608.15094] An error-mitigated quantum annealing solution for the weighted Max-Cut problem on a cubic lattice Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Quantum Physics arXiv:2608.15094 (quant-ph) [Submitted on 15 Aug 2026] Title: An error-mitigated quantum annealing solution for the weighted Max-Cut problem on a cubic lattice Authors: Y. S. Yang , P. Tyson , A. B Murphy View a PDF of the paper titled An error-mitigated quantum annealing solution for the weighted Max-Cut problem on a cubic lattice, by Y. S. Yang and 2 other authors View PDF Abstract: The weighted Max-Cut problem is an NP-hard problem with application implications. It is investigated on a cubic lattice with 113 nodes and mixed-signed random edge weights. For a fixed upper bound on edge weights, it has been demonstrated that the computational difficulty increases as the lower bound on edge weights becomes more negative. The solution time for the problem using a novel error-mitigated quantum annealing approach is compared with standard D-Wave quantum annealing (QA) and BQM hybrid solvers, as well as various classical solvers. For the QPU-embeddable weighted Max-Cut instances with mixed-signed edge weights, it has been quantitatively demonstrated that the SEMO (spin-error mitigation for optimisation) error-mitigated quantum annealing achieved substantially shorter time-to solution than standard D-Wave QA, D-Wave BQM, simulated annealing and Tabu search baselines. The error-mitigated quantum annealing approach presented in this article potentially elevates the efficiency and application scope of quantum annealing and would be applicable in solving other discrete optimisation problems that can be formulated as QUBO or Ising instances. The promising solution time advantage would be particularly impactful for time-critical optimisation applications. Comments: 9 pages, 6 figures, 1 table, 31 references, submitted to Quantum Science & Technology journal Subjects: Quantum Physics (quant-ph) ; Mathematical Physics (math-ph) Cite as: arXiv:2608.15094 [quant-ph] (or arXiv:2608.15094v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2608.15094 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Sam Yang Dr [ view email ] [v1] Sat, 15 Aug 2026 07:38:24 UTC (1,137 KB) Full-text links: Access Paper: View a PDF of the paper titled An error-mitigated quantum annealing solution for the weighted Max-Cut problem on a cubic lattice, by Y. S. Yang and 2 other authors View PDF view license Current browse context: quant-ph < prev | next > new | recent | 2026-08 Change to browse by: math math-ph math.MP References & Citations INSPIRE HEP NASA ADS Google 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? ) 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? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• An error-mitigated quantum annealing solution for the weighted Max-Cut problem on a cubic lattice#611044
• Unfair Sampling of Quantum Annealing in Weighted Graph Bipartitioning Problems#670559
• Unfair Sampling of Quantum Annealing in Weighted Graph Bipartitioning Problems#668494
• Quantum Maximum Entropy Inference and Hamiltonian Learning#670287
• Verifiable quantum advantage in extremely low depth#821380