Scalable Quantum Architecture Search via Landscape Analysis (2505.05380v1)

Abstract: Balancing trainability and expressibility is a central challenge in variational quantum computing, and quantum architecture search (QAS) plays a pivotal role by automatically designing problem-specific parameterized circuits that address this trade-off. In this work, we introduce a scalable, training-free QAS framework that efficiently explores and evaluates quantum circuits through landscape fluctuation analysis. This analysis captures key characteristics of the cost function landscape, enabling accurate prediction of circuit learnability without costly training. By combining this metric with a streamlined two-level search strategy, our approach identifies high-performance, large-scale circuits with higher accuracy and fewer gates. We further demonstrate the practicality and scalability of our method, achieving significantly lower classical resource consumption compared to prior work. Notably, our framework attains robust performance on a challenging 50-qubit quantum many-body simulation, highlighting its potential for addressing complex quantum problems.