Hybrid GBS with classical post-processing for DkSP achieves near-optimal solutions and ~4X sampling efficiency gains on community graphs while outperforming pure post-selection on sparse graphs.
The maximum clique problem,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Towards a Hybrid Quantum Enhanced Solution for Densest k-Subgraph Problem
Hybrid GBS with classical post-processing for DkSP achieves near-optimal solutions and ~4X sampling efficiency gains on community graphs while outperforming pure post-selection on sparse graphs.