Balanced k-way hypergraph partitioning is cast as QUBO and higher-order binary problems for quantum optimization, with small-instance tests confirming effectiveness for the all-or-nothing cut on 3-uniform hypergraphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quantum Hypergraph Partitioning
Balanced k-way hypergraph partitioning is cast as QUBO and higher-order binary problems for quantum optimization, with small-instance tests confirming effectiveness for the all-or-nothing cut on 3-uniform hypergraphs.