Review on Ansatz Architectures of Variational Quantum Algorithms for Continuous Optimization: From Fixed Structures to Adaptive Evolution
Open Access
Abstract
Variational quantum algorithms (VQAs) are a leading framework for realizing quantum advantages in the Noisy Intermediate-Scale Quantum (NISQ) era, with applications spanning discrete combinatorial problems and continuous optimization. While the topologies of parameterized quantum circuits (ansatzes) fundamentally govern both expressibility and trainability in continuous landscapes, existing reviews predominantly focus on static algorithmic classifications or discrete settings, leaving the structural evolution and practical limitations of ansatz architectures insufficiently explored. To address this gap, this review presents a systematic analysis of variational ansatz architectures, tracing their progression from static, pre-defined topologies to adaptive growth mechanisms. Beyond traditional gradient-driven and architecture-search paradigms, we evaluate supplementary strategies such as layerwise training and noise-adaptive construction, revealing inherent vulnerabilities such as local minima entrapment and the compilation overhead induced by calibration drift. The mathematical foundations of VQAs are outlined, and representative fixed ansatz architectures, including hardware-efficient, physics-inspired, and problem-specific designs, are characterized within continuous-domain mappings. Intrinsic limitations arising from barren plateaus (BPs) and noise-induced barren plateaus (NIBPs) are analyzed, revealing the fundamental coupling between circuit depth, parameter scaling, and trainability degradation. Furthermore, adaptive construction strategies and recent advances in automated variational quantum architecture search (VQAS) are examined. Through the synthesis of intrinsic limitations (BPs, NIBPs, and hardware-algorithm coupling) and the evaluation of standardized benchmarking protocols, this review rigorously assesses the resource trade-offs of current VQA frameworks. Ultimately, next-generation ansatz design will adopt hardware–software co-design principles grounded in physical constraints, enabling scalable and noise-resilient quantum optimization.Keywords
Funding Information
- National Natural Science Foundation of China (61105125)
- National Natural Science Foundation of China (51177177)
This publication has 75 references indexed in Scilit:
- Evaluating Angle and Amplitude Encoding Strategies for Variational Quantum Machine Learning: Their Impact on Model's AccuracyAdvanced Quantum Technologies, 2026
- Benchmarking variational quantum algorithms for combinatorial optimization in practiceQuantum Machine Intelligence, 2026
- Hardware‐Efficient Ansatz Variational Quantum Regression for Molecular Energy PredictionChemistrySelect, 2026
- Pruned-ADAPT-VQE: Compacting Molecular Ansätze by Removing Irrelevant OperatorsJournal of Chemical Theory and Computation, 2025
- Gradient-based optimization for quantum architecture searchNeural Networks, 2024
- Variational quantum algorithms: fundamental concepts, applications and challengesQuantum Information Processing, 2024
- The Variational Quantum Eigensolver: A review of methods and best practicesPhysics Reports, 2022
- Layerwise learning for quantum neural networksQuantum Machine Intelligence, 2021
- Expressibility and Entangling Capability of Parameterized Quantum Circuits for Hybrid Quantum‐Classical AlgorithmsAdvanced Quantum Technologies, 2019
- Generalized Unitary Coupled Cluster Wave functions for Quantum ComputationJournal of Chemical Theory and Computation, 2018