Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes

ArXi:2507.06344v3 Announce Type: replace-cross Variational Quantum Algorithms are promising candidates for near-term quantum computing, yet they face scalability challenges due to barren plateaus, where gradients vanish exponentially relative to system size. Recent conjectures suggest that avoiding these plateaus might inherently lead to classical simulability, thereby limiting the opportunities for quantum advantage.