The trainability boundary for variational quantum objectives is the affine regime; non-affine amplification-capable losses can mitigate barren plateaus when using coarse-grained statistics at polynomial widths.
Improving Variational Quantum Optimization using CVaR.Quantum, 4:256, April 2020
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
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.
Numerical benchmarks identify a minimum problem size where variational quantum circuits for Max-Cut outperform sampling on average, with quantified separation from greedy methods and instance-level performance correlations.
citing papers explorer
-
Trainability Beyond Linearity in Variational Quantum Objectives
The trainability boundary for variational quantum objectives is the affine regime; non-affine amplification-capable losses can mitigate barren plateaus when using coarse-grained statistics at polynomial widths.
-
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.
-
Benchmarking Variational Quantum Algorithms for Combinatorial Optimization in Practice
Numerical benchmarks identify a minimum problem size where variational quantum circuits for Max-Cut outperform sampling on average, with quantified separation from greedy methods and instance-level performance correlations.