<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dirros.openscience.si/IzpisGradiva.php?id=31508"><dc:title>Accuracy and performance evaluation of quantum, classical and hybrid solvers for the Max-Cut problem</dc:title><dc:creator>Vodeb,	Jaka	(Avtor)
	</dc:creator><dc:creator>Eržen,	Vid	(Avtor)
	</dc:creator><dc:creator>Hrga,	Timotej	(Avtor)
	</dc:creator><dc:creator>Povh,	Janez	(Avtor)
	</dc:creator><dc:subject>Max-Cut</dc:subject><dc:subject>QUBO</dc:subject><dc:subject>quantum annealing</dc:subject><dc:subject>simulated annealing</dc:subject><dc:description>This paper benchmarks quantum, classical, and hybrid solvers on NP-hard Max-Cut and QUBO problems, emphasizing solution quality relative to known global optima. We evaluate D-Wave’s fast annealing QPU and Hybrid solver against classical simulated annealing (SA) and Toshiba’s simulated bifurcation machine (SBM) using 139 Max-Cut instances (100 to 10,000 nodes). For small instances ( 250 nodes) with known global optima, Hybrid and SA consistently achieve optimal solutions, outperforming the QPU. For larger instances, SBM and slower SA yield superior solutions, while Hybrid and faster SA perform less effectively. Computation time varies across solvers.</dc:description><dc:publisher>Springer Nature</dc:publisher><dc:date>2026</dc:date><dc:date>2026-08-04 12:42:19</dc:date><dc:type>Neznano</dc:type><dc:identifier>31508</dc:identifier><dc:language>sl</dc:language><dc:rights>© The Author(s) 2026</dc:rights></rdf:Description></rdf:RDF>
