Adaptive min-vertex-cut qubit freezing plus bias folding makes DC-QAOA partition every graph (to n=10k) while matching quality on separable instances and beating QAOA2 at equal coverage.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA
Adaptive min-vertex-cut qubit freezing plus bias folding makes DC-QAOA partition every graph (to n=10k) while matching quality on separable instances and beating QAOA2 at equal coverage.