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.
Barren plateaus in quantum neural network training landscapes.Nature communications, 9(1):1–6
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 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Optimization-free Recursive QAOA solves the Binary Paint Shop Problem near-optimally with reduced quantum resources and robustness to parameter choice compared to standard QAOA.
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.
-
Optimisation-Free Recursive QAOA for the Binary Paint Shop Problem
Optimization-free Recursive QAOA solves the Binary Paint Shop Problem near-optimally with reduced quantum resources and robustness to parameter choice compared to standard QAOA.