REVIEW 2 cited by
Two-Step QAOA: Enhancing Quantum Optimization by Decomposing K-hot Constraints in QUBO Formulations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The Quantum Approximate Optimization Algorithm (QAOA) has shown promise in solving combinatorial optimization problems by leveraging quantum computational power. We propose a simple approach, the Two-Step QAOA, which aims to improve the effectiveness of QAOA by decomposing problems with k-hot encoding QUBO (Quadratic Unconstrained Binary Optimization) formulations. By identifying and separating the problem into two stages, we transform soft constraints into hard constraints, simplifying the generation of initial conditions and enabling more efficient optimization. The method is particularly beneficial for tackling complex societal problems that often involve intricate constraint structures.
Forward citations
Cited by 2 Pith papers
-
Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design
Decomposition-based QAOA with spectral graph cuts and GSR merging solves large satellite MCLP instances with competitive coverage and bounded qubit use where standard QAOA is infeasible.
-
QTIS: A QAOA-Based Quantum Time Interval Scheduler
QTIS-QAOA separates the objective and overlap-penalty parts of the scheduling Hamiltonian with distinct QAOA angles, yielding a small measured improvement on toy instances.
Discussion (0). Continue with ORCID to comment.