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.
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.
Abstract Understanding the origins of trainability in variational quantum circuits remains one of the central challenges in quantum machine learning. Existing approaches based on dynamical Lie algebras characterize the reachable orbit generated by a variational ansatz and provide important information about controllability and expressivity. However, optimization is inherently a local differential process, and the geometric mechanisms governing the transmission of optimization information remain poorly understood. In this work, we develop a differential-geometric framework for trainability based on the variational Jacobian. The Jacobian is interpreted as the differential map connecting the parameter manifold with the tangent space of the reachable orbit. \textcolor{blue}{We derive an exact modal decomposition of gradient generation in terms of Jacobian singular directions and task-dependent modal information, showing that gradient suppression may arise from spectral attenuation, from a reduction of the task-gradient magnitude, from directional misalignment between the task gradient and the Jacobian-accessible subspace, or from combinations of these effects.} We further establish an explicit connection between the variational Jacobian and the underlying dynamical Lie algebra through effective commutator directions. \textcolor{blue}{In the numerical settings considered here, coarse task-independent spectral diagnostics such as the Jacobian rank, the largest singular value, and the total spectral weight exhibit little correlation with optimization performance, whereas normalized directional alignment and task-weighted spectral transmission retain significant predictive associations.} \textcolor{blue}{Finally, we show that Jacobian degeneration suppresses the task-Hessian component transmitted through the variational map, while the additional second-order map contribution need not vanish.} \textcolor{blue}{Taken together, these results provide a geometric framework in which local trainability can be viewed as emerging from the interaction between Lie-algebraic structure, Jacobian geometry, and the learning task, and as a problem of differential information transmission rather than accessibility alone.}
This chapter develops variational quantum models as the dominant framework for near-term quantum machine learning (QML), emphasizing their role as trainable quantum circuits embedded within hybrid quantum-classical optimization loops. Building on earlier chapters on encoding and quantum feature geometry, it formulates parameterized quantum circuits (PQCs) as families of unitary transformations acting on reference states, with model outputs obtained through expectation values of observables. This measurement-based structure makes variational learning inherently stochastic and closely ties model behavior to circuit architecture, observable choice, and optimization strategy. This chapter examines variational quantum circuits (VQCs) as learning models, introduces quantum neural networks (QNNs) as structured variational architectures, and analyzes layered, data-reuploading, recurrent, and hybrid classical-quantum designs. It highlights the central tension between expressivity and trainability, showing how universality and approximation power are counterbalanced by optimization barriers such as barren plateaus. The discussion further develops ansatz design strategies, supervised, fidelity-based, and energy-based losses, regularization under noise, and practical methods for gradient estimation and optimization, including the parameter-shift rule, Simultaneous Perturbation Stochastic Approximation (SPSA), and layer-wise training. Together, these ideas establish variational quantum models as a flexible yet hardware-constrained paradigm whose practical success depends on careful coordination among architecture, measurement, and optimization.
Variational quantum algorithms (VQAs) are commonly developed under the assumption that a parameterized circuit corresponds to a single, well-defined physical realization. In practice, this assumption is not satisfied. Differences in compilation, gate ordering, and hardware-level perturbations lead to multiple admissible circuit realizations, each associated with a distinct objective over the same parameter space. The resulting optimization problem is therefore not defined by a single loss function, but by a family of configuration-dependent objectives whose aggregate behaviour must be considered. This study formulates optimization explicitly at the level of such configuration families. A consistent extension of natural-gradient methods is developed in which both the descent direction and the local geometric structure are obtained through averaging across configurations. The resulting update preserves the structure of quantum natural gradient methods while ensuring alignment with the family-defined objective. The approach is evaluated using exact statevector simulations on transverse-field Ising and Heisenberg Hamiltonians under controlled variability. Across all tested regimes, the method produces lower average loss, substantially reduced dispersion across configurations, and improved worst-case performance relative to both configuration-specific optimization and gradient-averaged baselines. These results show that when the objective depends on a set of admissible circuit realizations, optimization must be constructed at the same level to obtain stable and reliable solutions.
Parameterized Quantum Circuits have emerged as a central framework for variational quantum algorithms in the NISQ regime, with major applications in quantum simulation, combinatorial optimization, and, more recently, quantum machine learning (QML). By developing a new approach for computing dynamical Lie algebras associated with quantum circuits combining parametrized gates and non-parametrized entangling gates, we aim to extend the applicability of recent algebraic results to architectures that are actually used in quantum machine learning.
We propose SUN-VQC, a variational-circuit architecture whose elementary layers are single exponentials of a symmetry-restricted Lie subgroup, SU(2k)⊂SU(2n) with k≪n. Confining the evolution to this compact subspace reduces the dynamical Lie-algebra dimension from O(4n) to O(4k), ensuring only polynomial suppression of gradient variance and circumventing barren plateaus that plague hardware-efficient ansätze. Exact, hardware-compatible gradients are obtained using a generalized parameter-shift rule, avoiding ancillary qubits and finite-difference bias. Numerical experiments on quantum auto-encoding and classification show that SUN-VQCs sustain order-of-magnitude larger gradient signals, converge 2--3× faster, and reach higher final fidelities than depth-matched Pauli-rotation or hardware-efficient circuits. These results demonstrate that Lie-subalgebra engineering provides a principled, scalable route to barren-plateau-resilient VQAs compatible with near-term quantum processors.
An important application for near-term quantum computing lies in optimization tasks, with applications ranging from quantum chemistry and drug discovery to machine learning. In many settings, most prominently in so-called parametrized or variational algorithms, the objective function is a result of hybrid quantum-classical processing. To optimize the objective, it is useful to have access to exact gradients of quantum circuits with respect to gate parameters. This paper shows how gradients of expectation values of quantum measurements can be estimated using the same, or almost the same, architecture that executes the original circuit. It generalizes previous results for qubit-based platforms, and proposes recipes for the computation of gradients of continuous-variable circuits. Interestingly, in many important instances it is sufficient to run the original quantum circuit twice while shifting a single gate parameter to obtain the corresponding component of the gradient. More general cases can be solved by conditioning a single gate on an ancilla.