Non-variational QAOA with fixed angles solves QRAO's relaxed MaxCut Hamiltonian with performance close to optimized parameters and about three times fewer qubits than standard QAOA.
Solving Boolean satisfiability problems with the quantum approximate optimization algorithm,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz
Non-variational QAOA with fixed angles solves QRAO's relaxed MaxCut Hamiltonian with performance close to optimized parameters and about three times fewer qubits than standard QAOA.