QAOA achieves the conjectured optimal (2p+1)/(2p+2) edge-cut fraction on cycle graphs at depth p by equivalence to Laurent polynomial optimization using quantum signal processing.
Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
CRiSP uses neural-guided MCTS and curriculum learning to insert Clifford prefixes before parameterized rotations in VQAs, yielding mean 3.17x and max 45x gains in energy accuracy on 22-qubit QAOA benchmarks versus prior Clifford initializers.
PCE framework matches or exceeds QOPTLib benchmark solutions on tested optimization problems while analyzing compression, noise, and post-processing effects.
citing papers explorer
-
The QAOA on the ring of disagrees
QAOA achieves the conjectured optimal (2p+1)/(2p+2) edge-cut fraction on cycle graphs at depth p by equivalence to Laurent polynomial optimization using quantum signal processing.
-
Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learning
CRiSP uses neural-guided MCTS and curriculum learning to insert Clifford prefixes before parameterized rotations in VQAs, yielding mean 3.17x and max 45x gains in energy accuracy on 22-qubit QAOA benchmarks versus prior Clifford initializers.
-
Benchmark of Pauli Correlation Encoding for different optimisation problems
PCE framework matches or exceeds QOPTLib benchmark solutions on tested optimization problems while analyzing compression, noise, and post-processing effects.