PC-QAOA partitions constraints into structural enforcement via feasible-state preparation and Grover mixers plus energetic penalties, reporting improved feasibility and quality over penalty-only QAOA across 413 instances.
The art of avoiding constraints: A penalty- free approach to constrained combinatorial optimization with qaoa
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
A sandbox platform enables end-to-end hybrid workflows that reduce graph problems, run QAOA on IBM hardware up to 128 qubits, and refine outputs classically for problems including vertex cover and clique.
citing papers explorer
-
Partitioned-Constraint QAOA (PC-QAOA): Structural State Preparation and Penalty Enforcement for Quantum Optimization
PC-QAOA partitions constraints into structural enforcement via feasible-state preparation and Grover mixers plus energetic penalties, reporting improved feasibility and quality over penalty-only QAOA across 413 instances.
-
Experimental Workflows for Combinatorial Optimization: Towards Quantum Advantage
A sandbox platform enables end-to-end hybrid workflows that reduce graph problems, run QAOA on IBM hardware up to 128 qubits, and refine outputs classically for problems including vertex cover and clique.