Understanding how the performance of parameterized quantum circuits scales with available resources is important for characterizing their trainability and effective model capacity. In this study, we numerically investigate data scaling, model scaling, and compute scaling in parameterized quantum circuits and examine Lie-algebraic quantities as alternative measures of model size. In addition to the number of circuit parameters, we consider the dimension of the dynamical Lie algebra, the observable-orbit dimension, and a Jacobian effective dimension defined as the rank of the Jacobian of the parameterized observable orbit. Using a regression task with randomly generated Pauli-string generators, we observe decreasing loss with increasing training dataset size, parameter size, and number of optimization iterations over the ranges investigated. For model scaling, the dynamical Lie algebra and observable orbit dimensions rapidly saturate as the parameter size increases, whereas the Jacobian effective dimension remains strongly correlated with the parameter size and exhibits comparable scaling behavior. These results suggest that the Jacobian effective dimension provides a geometry-aware measure of the locally accessible observable degrees of freedom of finite-depth parameterized quantum circuits and may serve as a useful scaling parameter beyond the nominal parameter size.
Understanding how the performance of parameterized quantum circuits scales with available resources is important for characterizing their trainability and effective model capacity. In this study, we numerically investigate data scaling, model scaling, and compute scaling in parameterized quantum circuits and examine Lie-algebraic quantities as alternative measures of model size. In addition to the number of circuit parameters, we consider the dimension of the dynamical Lie algebra, the observable-orbit dimension, and a Jacobian effective dimension defined as the rank of the Jacobian of the parameterized observable orbit. Using a regression task with randomly generated Pauli-string generators, we observe decreasing loss with increasing training dataset size, parameter size, and number of optimization iterations over the ranges investigated. For model scaling, the dynamical Lie algebra and observable orbit dimensions rapidly saturate as the parameter size increases, whereas the Jacobian effective dimension remains strongly correlated with the parameter size and exhibits comparable scaling behavior. These results suggest that the Jacobian effective dimension provides a geometry-aware measure of the locally accessible observable degrees of freedom of finite-depth parameterized quantum circuits and may serve as a useful scaling parameter beyond the nominal parameter size.
A central challenge in quantum machine learning is understanding the scaling behavior of parameterized quantum circuits (PQCs). In particular, it remains unclear how their performance on unseen data changes as the number of trainable parameters increases. Prior works have derived formal generalization guarantees for quantum models, but it is well-known that many such results do not fully characterize generalization behavior in practice. In this work, we show that gradient-based PQCs can exhibit improved performance on unseen data as model size increases, displaying the phenomenon of double descent. This contrasts with the traditional view that larger models lead to degraded generalization. We provide analytical results rigorously underpinning this behavior by leveraging add-one-in perturbation techniques and spectral properties of random matrices. We support these results with numerical experiments on re-uploading PQCs across several data sets and training set sizes, consistently observing the predicted double descent behavior. While other obstacles on the path toward practical quantum machine learning remain, our finding that deeper parameterized quantum circuits do not necessarily exhibit degraded performance provides reasons for cautious optimism.
Orbit dimension, not parameter count, bounds quantum sample complexity. For continuous parameterized quantum circuits on n qubits, the minimax estimation risk obeys R(deff,M)≥Ω(Mdeff), where deff=dim(OO) is the real dimension of the observable's adjoint orbit under the dynamical Lie group. For balanced Pauli observables O=Z⊗n, quotienting the dynamical Lie algebra by the stabilizer subgroup yields the complex Grassmannian Gr(2n−1,2n) of real dimension deff=22n−1=214n≈21dim(g), which matches upper bounds of Caro et al.~(2022) and Ohno~(2025) up to a universal constant and resolves the exact tightness rate Θ(dim(g)/M). For rank-1 projective observables, the orbit contracts instead to complex projective space CP2n−1 with dimension deff=2(2n−1). Sample requirements therefore explode exponentially with qubit count. The scaling identifies Wang \& Wu's (2025) dimension-independent O(1/M) uniform convergence bound as an artifact of uniform stability rather than true estimation power. PennyLane benchmarks across n=1,2,3,4 qubits confirm this exponential threshold. Barren plateaus and statistical sample bottlenecks stem from an identical geometric origin: volume growth in SU(2n) simultaneously suppresses gradient variances as ∼1/dim(g) and drives sample complexity up to ∼dim(g)/M.
The analysis of Hamiltonian Variational Ansätze centers on three fundamental questions: which states are exactly reachable from a given initial state, what native control depth suffices for local and global synthesis, and whether a bounded circuit extension can expose a direction of decreasing cost at a suboptimal output. We address these challenges by leveraging the dynamical Lie algebras (DLAs) associated with the circuits and the geometry of the initial state's orbit under the action of the corresponding dynamical Lie group G. We show that an initial state has a closed projective orbit whenever it is a nondegenerate eigenstate of a control Hamiltonian. Combined with asymptotic QAOA convergence, this guarantees exact, finite depth ground state preparation for architectures employing diagonal problem Hamiltonians and irreducible stoquastic mixers. We bound the number of native control exponentials required for local unitary synthesis and state preparation using DLA commutator filtration growth alongside reachable orbit dimensions. Complementing these local results, we construct global frameworks on invariant sectors equipped with full unitary or special unitary dynamical Lie algebras. These constructions yield explicit applications to Pauli-generated systems and constrained maximum independent set multi-angle QAOA circuits; specifically, we show that their native control costs are directly determined by commutator filtration depth and independent-set toggle-group geometry, respectively. Finally, if the dynamical Lie group is compact, the observable HP generates an admissible evolution (iHP∈g, where g is the DLA), and the projective orbit of the initial state contains a ground state ray of HP, then a bounded depth, identity-initialized circuit extension exhibits either first-order descent or negative curvature at every suboptimal circuit output.
Abstract Variational quantum circuits are a central paradigm of quantum machine learning and near-term quantum computing, yet their practical optimization is often limited by strongly suppressed parameter gradients. Dynamical Lie algebras provide a rigorous description of the infinitesimal directions accessible to a variational architecture, but dynamical accessibility alone does not determine the gradient signal exposed by an actual circuit parametrization. In this work, we develop a Lie-theoretic description of parameter-gradient structure that separates four successive mechanisms: dynamical accessibility, observable visibility, state-dependent activation, and local parameter realization. The optimization observable determines which accessible directions can influence the objective and how strongly they couple to it, while the quantum state selects which of these response modes are locally activated. This information is then pulled back through the circuit parametrization to recover the actual parameter gradients. The resulting construction yields an exact modal decomposition of the accessible gradient signal, a hierarchy of structural bounds, and a natural description of state averaging. An analytical single-qubit example and controlled numerical experiments validate the successive levels of the hierarchy and show that accessible Lie dimension alone is insufficient to characterize the parameter-gradient scale. The results support a mechanism-based view of variational trainability in which parameter gradients emerge from the interaction between accessible dynamics, observable coupling, quantum-state activation, and circuit parametrization.
Dynamical Lie algebras (DLAs) are a versatile tool for various topics that span from the expressibility-trainability of variational quantum algorithms (VQAs), to simulation of many body Hamiltonians. Quantum gates and most of the Hamiltonians of interest consist of local interactions; therefore, the analysis of all possible DLAs generated by 1- and 2-local operators is crucial for quantum simulation and VQAs on current hardware. Previously in [R. Wiersema et al., npj Quantum Inf. 10, 110 (2024)], we analyzed the DLAs on linear, circular and all-to-all topologies, and obtained results about their dimensions and algebraic structure. In this work, we extend our analysis into any possible hardware topology and provide a classification of all DLAs generated by Pauli strings on any undirected interaction graph. Our results indicate that the DLAs depend solely on whether the connectivity or interaction graph is bipartite or not. In addition, we find that the non-trivial polynomially scaling DLAs appear only on 1D line or circle topologies, and all other DLAs have dimensions scaling exponentially with the system size. Together with the current VQA literature, our results imply that either the majority of VQAs are non-trainable, or we are yet to understand the role of DLAs on the trainability of VQAs.
Quantum Machine Learning (QML) is fundamentally limited by two challenges: barren plateaus (exponentially vanishing gradients) and the fragility of parameterized quantum circuits under noise. Despite extensive empirical studies, a unified theoretical framework remains lacking. We introduce LieTrunc-QNN, an algebraic-geometric framework that characterizes trainability via Lie-generated dynamics. Parameterized quantum circuits are modeled as Lie subalgebras of u(2^n), whose action induces a Riemannian manifold of reachable quantum states. Expressivity is reinterpreted as intrinsic manifold dimension and geometry. We establish a geometric capacity-plateau principle: increasing effective dimension leads to exponential gradient suppression due to concentration of measure. By restricting to structured Lie subalgebras (LieTrunc), the manifold is contracted, preventing concentration and preserving non-degenerate gradients. We prove two main results: (1) a trainability lower bound for LieTrunc-QNN, and (2) that the Fubini-Study metric rank is bounded by the algebraic span of generators, showing expressivity is governed by structure rather than parameter count. Compact Lie subalgebras also provide inherent robustness to perturbations. Importantly, we establish a polynomial trainability regime where gradient variance decays polynomially instead of exponentially. Experiments (n=2-6) validate the theory: LieTrunc-QNN maintains stable gradients and high effective dimension, while random truncation leads to metric rank collapse. At n=6, full metric rank is preserved (rank=16). Results support a scaling law between gradient variance and effective dimension. This work provides a unified geometric framework for QNN design, linking Lie algebra, manifold geometry, and optimization.