CCD-QAOA incorporates counterdiabatic terms into the QAOA ansatz and shows higher approximation ratios than standard XY-mixer, Grover-mixer, and penalty QAOA for portfolio problems with budget and risk constraints.
Con- strained quantum optimization via iterative warm-start XY- mixers
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
An iterative nonvariational quantum algorithm using warm-start states and classically computed imaginary time evolution circuits achieves median solutions within 95% of optimal for MaxCut on small 3-regular graphs using only 100 shots, outperforming random and basic classical searches.
citing papers explorer
-
Constrained Counterdiabatic Quantum Approximate Optimization Algorithm for Portfolio Optimization
CCD-QAOA incorporates counterdiabatic terms into the QAOA ansatz and shows higher approximation ratios than standard XY-mixer, Grover-mixer, and penalty QAOA for portfolio problems with budget and risk constraints.
-
Iterative warm-start optimization with quantum imaginary time evolution
An iterative nonvariational quantum algorithm using warm-start states and classically computed imaginary time evolution circuits achieves median solutions within 95% of optimal for MaxCut on small 3-regular graphs using only 100 shots, outperforming random and basic classical searches.