Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization

Show simple item record
dc.contributor.authorPeng, Zedong
dc.contributor.authorde Roux, Daniel
dc.contributor.authorBernal Neira, David E.
dc.contributor.editorKais, Sabre
dc.contributor.editorSkala, Václav
dc.date.accessioned2025-10-08T15:01:01Z
dc.date.available2025-10-08T15:01:01Z
dc.date.issued2025
dc.description.abstract-translatedQuantum algorithms have shown promise in solving Quadratic Unconstrained Binary Optimization (QUBO) problems, benefiting from their connection to the transverse field Ising model. Various Ising solvers, both classical and quantum, have emerged to tackle such problems efficiently but lack global optimality guarantees and oftentimes sufer from hardware limitations such as limited qubit availability. In this work, we propose a hybrid branch-and bound (B&B) framework that integrates Ising solvers as heuristics within a classical B&B algorithm. Unlike prior theoretical studies, our work presents a practical implementation, available as open-source at GitHub. We explore when and where to apply Ising solvers in the search tree, and introduce a custom branching rule optimized QUBO embedding. Our method is evaluated on hundreds of QUBO instances from QUBOLib.jl using Gurobi and the D-Wave quantum annealer. Our Results show up to 11% less solution time and 17% fewer nodes compared to default Gurobi, an off-the-shelf commercial optimization solver. These findings demonstrate the value of hybrid quantum-classical strategies for enhancing exact optimization.en
dc.format10 s.cs
dc.identifier.doihttp://www.doi.org/10.24132/CSRN.2025-A67
dc.identifier.issn2464-4617
dc.identifier.issn2464-4625
dc.identifier.urihttp://hdl.handle.net/11025/62934
dc.language.isoenen
dc.publisherVaclav Skala - UNION Agencyen
dc.rights© Václav Skala - UNION Agencyen
dc.rights.accessopenAccessen
dc.subjectkvadratická neomezená binární optimalizacecs
dc.subjectvětvení a řezánícs
dc.subjectkvantová optimalizacecs
dc.subject.translatedQuadratic Unconstrained Binary Optimizationen
dc.subject.translatedbranch-and-cuten
dc.subject.translatedquantum optimizationen
dc.titleHybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimizationen
dc.typekonferenční příspěvekcs
dc.typeconferenceObjecten
dc.type.statusPeer revieweden
dc.type.versionpublishedVersionen
local.files.count2*
local.files.size2706654*
local.has.filesyes*

Files

Original bundle
Showing 1 - 2 out of 2 results
No Thumbnail Available
Name:
CSRN-QC-uvod.pdf
Size:
823.9 KB
Format:
Adobe Portable Document Format
Download
No Thumbnail Available
Name:
A67.pdf
Size:
1.78 MB
Format:
Adobe Portable Document Format
Download
License bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

QC–HORIZON 2025 Proceedings