Dynamic depth quantum approximate optimization algorithm for solving constrained shortest path problem
The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for solving NP-hard combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) hardware. However, its performance critically depends on the choice of circuit depth–a parameter that must be specified a priori wi...