Quick Navigation
Topics
Quantum Optimization
Advancing stable set problem solutions through quantum annealers
arXiv
Authors: Janez Povh, Dunja Pucher
Year
2023
Paper ID
55564
Status
Preprint
Abstract Read
~2 min
Abstract Words
71
Citations
N/A
Abstract
We assess the performance of D-wave quantum solvers for solving the stable set problem in a graph, one of the most studied NP-hard problems. We perform computations on some instances from the literature with up to 125 vertices and compare the quality of the obtained solutions with known optimum solutions. It turns out that the hybrid solver gives very good results, while the Quantum Processing Unit solver shows rather modest performance overall.
Why This Paper Matters
- This paper contributes to the Quantum Optimization research area in the Quantum Articles archive.
- It adds a 2023 reference point for readers tracking recent quantum research.
- We assess the performance of D-wave quantum solvers for solving the stable set problem in a graph, one of the most studied NP-hard problems.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.