Iterative orthogonal-basis interpolation constructs high-quality QAOA parameter schedules for depths exceeding 1000 layers, outperforming prior methods on SK, portfolio, and LABS benchmarks.
Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2025 2verdicts
UNVERDICTED 2representative 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
-
Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm
Iterative orthogonal-basis interpolation constructs high-quality QAOA parameter schedules for depths exceeding 1000 layers, outperforming prior methods on SK, portfolio, and LABS benchmarks.
-
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.