A framework computes one-layer QAOA success probabilities for arbitrary random boolean CSPs, and the comparison singles out random k-SAT as the most promising target for a quantum speedup.
This amounts to computing the single-clause polynomial, i.e
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Applying the quantum approximate optimization algorithm to general constraint satisfaction problems
A framework computes one-layer QAOA success probabilities for arbitrary random boolean CSPs, and the comparison singles out random k-SAT as the most promising target for a quantum speedup.