With rapid advances in quantum hardware, a central question is whether quantum devices with or without full error correction can outperform classical computers on practically relevant problems. Variational quantum algorithms (VQAs) have gained significant attention as promising candidates in this pursuit, particularly for combinatorial optimization problems. While reports of their challenges and limitations continue to accumulate, many studies remain optimistic based on small-scale, idealized testing setups, leaving doubt about the scalability of VQAs for large-scale problems. We systematically investigate this scaling behavior by analyzing how classical optimizers minimize variational quantum loss functions for random Quadratic Unconstrained Binary Optimization instances in the presence of uncertainty, modeled as effective Gaussian noise. We find that the critical noise threshold for successful optimization decreases rapidly as system size grows. This decline exceeds what can be explained solely by shrinking loss variance, confirming deeper, fundamental limitations in the loss landscapes of VQAs beyond barren plateaus. Translating these thresholds into required measurement shots reveals that achieving sufficient precision in the evaluated loss values quickly becomes impractical, even for moderatelysized problems. Our findings demonstrate serious scalability challenges for VQAs in optimization stemming from mere uncertainty, indicating potential barriers to achieving practical quantum advantage with current hybrid approaches.
Bärligea et al. (Wed,) studied this question.