Let q ≥ 1 an integer andq ∈ P(q) a weight-q configuration basis number

(57) One may next for eachs[0], s[−1] ∈ {0, 1}, value ofq′ s[0] s[−1], sum overq0 s[0] s[−1], q1 s[0] s[−1] such that their sum q′ s[0] s[−1] is fixed, this is done using the

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

Applying the quantum approximate optimization algorithm to general constraint satisfaction problems

quant-ph · 2024-11-26 · conditional · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

Applying the quantum approximate optimization algorithm to general constraint satisfaction problems quant-ph · 2024-11-26 · conditional · none · ref 3
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.

Let q ≥ 1 an integer andq ∈ P(q) a weight-q configuration basis number

fields

years

verdicts

representative citing papers

citing papers explorer