Metraipolis › archive › dc_121c6cdfed8f

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

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.15094
License (as archived)
CC0-1.0
Archived
2026-10-19T00:53:20.883Z
SHA-256 of the archived text
60fa5ee47347ca1a34800274d57b7a22a8f7734dfd5c289907369807ef0d7899
Stable URL of this page
https://metraipolis.com/documento/dc_121c6cdfed8f

How to cite

An error-mitigated quantum annealing solution for the weighted Max-Cut problem on a cubic lattice — arXiv:2608.15094 — arXiv (en), https://arxiv.org/abs/2608.15094 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_121c6cdfed8f (Metraipolis archive dc_121c6cdfed8f, sha256 60fa5ee47347ca1a34800274d57b7a22a8f7734dfd5c289907369807ef0d7899)
BibTeX
@misc{dc121c6cdfed8f,
  title = {An error-mitigated quantum annealing solution for the weighted Max-Cut problem on a cubic lattice — arXiv:2608.15094},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.15094},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_121c6cdfed8f; sha256 60fa5ee47347ca1a34800274d57b7a22a8f7734dfd5c289907369807ef0d7899},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.15094. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-18 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph) ; Mathematical Physics (math-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.15094 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T00:29:15.368Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).