Self-supervised representation learning for Bayesian quantum architecture search
Zhimin He, Hongxiang Chen, Yan Zhou +3 more
Quantum architecture search (QAS) has shown significant promise in automating quantum circuit design for variational quantum algorithms (VQAs). However, a central challenge remains in the high computational cost of evaluating the ground-truth performance of numerous circuit architectures during the search process. This challenge is further complicated by factors such as inefficient gradient computation, the barren plateau phenomenon, and frequent data exchange between classical and quantum systems within VQAs, all of which restrict the scalability of QAS for increasingly complex VQAs. In this study, we propose an enhanced QAS framework that integrates a performance predictor trained through self-supervised learning with Bayesian optimization to overcome these computational barriers. To address the challenges of circuit performance evaluation, we develop a graph-isomorphism-network-based predictor pretrained using expressibility prediction, an intrinsic measure of a circuit's capacity to explore the Hilbert space uniformly. This pretraining process creates a structured and smooth latent space, significantly improving the predictor's accuracy and generalizability with minimal labeled data. Furthermore, Bayesian optimization is integrated into the QAS framework to refine the predictor iteratively, concentrating the search on regions containing high-performance circuits and thus accelerating the search process. Simulation results for VQAs involving the variational quantum eigensolver and quantum approximate optimization algorithm demonstrate that the proposed framework achieves faster convergence to optimal circuits and substantially reduces computational costs compared to existing QAS methods.
Physical Review A•Mar 4, 2025•18 citations