DAPO dynamically sparsifies the QAOA phase Hamiltonian using the previous layer's most likely solution plus local search, improving approximation ratio and cutting RZZ gate count on small MaxCut and NAE3SAT instances.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
DAPO-QAOA: An algorithm for solving combinatorial optimization problems by dynamically constructing phase operators
DAPO dynamically sparsifies the QAOA phase Hamiltonian using the previous layer's most likely solution plus local search, improving approximation ratio and cutting RZZ gate count on small MaxCut and NAE3SAT instances.