Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2405.09135 · IEEE Conference on Decision and Control (CDC)

On the Role of Controllability in Pulse-based Quantum Machine Learning Models

Han-Xiao Tao, Re-Bing Wu

Published Dec 16, 2024• 2 citations
arXivHTMLPDF

Abstract

Pulse-based quantum machine learning (QML) models possess full expressivity when they are ensemble controllable. However, the accompanied barren plateaus render training intractable for high-dimensional systems. In this paper, we show that the trade-off can be understood via controllability analysis. We first apply the Fliess-series expansion to pulse-based QML models to investigate the effect of control system structure on model expressivity, which leads to a universal criterion for assessing the expressivity of generic QML models. We then show that uncontrollable pulse-based models that evolve on low-dimensional manifolds can achieve better balance between expressivity and trainability. Numerical experiments verify the proposed criterion and our analysis, which further demonstrate that the expressivity can be enhanced by increasing dimensionality, while barren plateaus can be avoided by reducing the controllability. Our approach provides a promising path for designing pulse-based QML models that are both highly expressive and trainable.

DOI
10.1109/cdc56724.2024.10886070

Related papers

Design of expressive and trainable pulse-based quantum machine learning models

Han-Xiao Tao, Xin Wang, Re-Bing Wu

Pulse-based quantum machine learning (QML) has emerged as a promising paradigm in quantum artificial intelligence due to its exceptional hardware efficiency. For real-world applications, it is crucial that pulse-based models are both expressive and trainable. Previous studies have shown that pulse-based models operating under dynamical symmetry can be effectively trained, benefiting from a favorable loss landscape devoid of barren plateaus. However, this approach may lead to uncontrollability, which can limit expressivity if the model is poorly designed. In this paper, we explore the conditions necessary for pulse-based QML models to maintain both expressivity and trainability. We present a key requirement involving the system's initial state, the measurement observable, and the underlying dynamical symmetry Lie algebra, supported by numerical simulations. Our results provide a comprehensive framework for the design of practical pulse-based QML models that strike a good balance between expressivity and trainability.

arXiv:2508.05559•Physical Review Research•Feb 9, 2026•4 citations

Beyond the Expressivity-Trainability Paradox: A Dynamical Lie Algebra Perspective on Navigating Barren Plateaus in Quantum Machine Learning

Kung-Ming Lan, Edward Huang

As Quantum Machine Learning (QML) transitions toward practical implementation, the field faces a critical architectural bottleneck that challenges the fundamental assumptions of classical statistical learning theory. In classical deep learning, increasing model capacity typically risks overfitting. However, this study advances a counter-intuitive paradigm: unstructured contemporary QML architectures suffer from a profound state of quantum underfitting, driven by the "expressivity-trainability paradox." We demonstrate that the vast Hilbert space capacity of Parameterized Quantum Circuits (PQCs)-traditionally chased as the source of quantum advantage is the direct mathematical cause of Barren Plateaus (BPs), where gradient landscapes become exponentially flat. By synthesizing recent breakthroughs in Dynamical Lie Algebras (DLAs) and Geometric QML, we establish a comprehensive framework linking the algebraic dimension of circuit generators to their optimization dynamics. Furthermore, we empirically validate this framework on a non-linear binary classification task, illuminating a uniquely quantum manifestation of the bias-variance tradeoff: while unstructured architectures achieve near-perfect training accuracy via unscalable parameterization (quantum overfitting), embedding group-theoretic geometric priors acts as a structural regularizer. By restricting the DLA growth to a polynomial regime, our symmetry-preserving approach sacrifices raw memorization capacity to guarantee scalable, gradient-rich training landscapes, offering a robust roadmap for "Trainability-by-Design" in scalable quantum neural networks.

cs.LGCross-listedarXiv:2606.31536•Jul 1, 2026•1 citation

Subtleties in the trainability of quantum machine learning models

Supanut Thanasilp, Samson Wang, Nhat A. Nghiem +2 more

Abstract A new paradigm for data science has emerged, with quantum data, quantum models, and quantum computational devices. This field, called quantum machine learning (QML), aims to achieve a speedup over traditional machine learning for data analysis. However, its success usually hinges on efficiently training the parameters in quantum neural networks, and the field of QML is still lacking theoretical scaling results for their trainability. Some trainability results have been proven for a closely related field called variational quantum algorithms (VQAs). While both fields involve training a parametrized quantum circuit, there are crucial differences that make the results for one setting not readily applicable to the other. In this work, we bridge the two frameworks and show that gradient scaling results for VQAs can also be applied to study the gradient scaling of QML models. Our results indicate that features deemed detrimental for VQA trainability can also lead to issues such as barren plateaus in QML. Consequently, our work has implications for several QML proposals in the literature. In addition, we provide theoretical and numerical evidence that QML models exhibit further trainability issues not present in VQAs, arising from the use of a training dataset. We refer to these as dataset-induced barren plateaus. These results are most relevant when dealing with classical data, as here the choice of embedding scheme (i.e., the map between classical data and quantum states) can greatly affect the gradient scaling.

arXiv:2110.14753•Quantum Machine Intelligence•May 15, 2023•115 citations

Provably Trainable Rotationally Equivariant Quantum Machine Learning

Maxwell T. West, Jamie Heredge, Martin E. Sevior +1 more

Exploiting the power of quantum computation to realize superior machine learning algorithms has been a major research focus of recent years, but the prospects of quantum machine learning (QML) remain dampened by considerable technical challenges. A particularly significant issue is that generic QML models suffer from so-called barren plateaus in their training landscapes—large regions where cost function gradients vanish exponentially in the number of qubits employed, rendering large models effectively untrainable. A leading strategy for combating this effect is to build problem-specific models that take into account the symmetries of their data in order to focus on a smaller, relevant subset of Hilbert space. In this work, we introduce a family of rotationally equivariant QML models built upon the quantum Fourier transform, and leverage recent insights from the Lie-algebraic study of QML models to prove that (a subset of) our models do not exhibit barren plateaus. In addition to our analytical results we numerically test our rotationally equivariant models on a dataset of simulated scanning tunneling microscope images of phosphorus impurities in silicon, where rotational symmetry naturally arises, and find that they dramatically outperform their generic counterparts in practice. Published by the American Physical Society 2024

arXiv:2311.05873•PRX Quantum•Jul 31, 2024•54 citations

Rethinking Expressibility-Trainability Trade-off in Hybrid Quantum Neural Networks

Muhammad Kashif, Muhammad Shafique

Hybrid quantum neural networks (HQNNs) integrate parameterized quantum circuits (PQCs) within classical networks, where the behavior of the underlying PQCs is often the primary focus of analysis. In this context, expressibility and trainability are widely used to characterize PQC's performance and are commonly assumed to exhibit a trade-off, where highly expressive circuits are more susceptible to barren plateaus. However, the validity of this relationship in HQNNs remains unclear. In this paper, we systematically analyze the expressibility--trainability relationship in HQNNs across varying circuit depths, qubit counts, entanglement topologies. We consider different training configurations, including pure PQCs, quantum-only training in hybrid setting, and full end-to-end training of hybrid models. Our results show that pure PQCs exhibit only a weak and regime-dependent trade-off, while hybrid architectures increasingly disrupt and can eliminate this relationship under full hybrid training. This indicates that classical components reshape the optimization landscape, decoupling trainability from PQC expressibility. We further propose a multi-objective neural architecture search (NAS) framework that jointly optimizes expressibility, trainability, and task performance over a combined classical--quantum design space, revealing different Pareto-optimal solutions under full end-to-end and quantum only training in hybrid setting. different trainability definitions. Our results suggest that hybridization is not just an implementation detail, but a defining factor in the performance of quantum machine learning models.

quant-pharXiv:2605.25768•May 26, 2026•1 citation

Trainability and Expressivity of Hamming-Weight Preserving Quantum Circuits for Machine Learning

Léo Monbroussou, Eliott Z. Mamon, Jonas Landman +3 more

Quantum machine learning (QML) has become a promising area for real world applications of quantum computers, but near-term methods and their scalability are still important research topics. In this context, we analyze the trainability and controllability of specific Hamming weight preserving variational quantum circuits (VQCs). These circuits use qubit gates that preserve subspaces of the Hilbert space, spanned by basis states with fixed Hamming weight k . In this work, we first design and prove the feasibility of new heuristic data loaders, performing quantum amplitude encoding of (nk) -dimensional vectors by training an n -qubit quantum circuit. These data loaders are obtained using controllability arguments, by checking the Quantum Fisher Information Matrix (QFIM)'s rank. Second, we provide a theoretical justification for the fact that the rank of the QFIM of any VQC state is almost-everywhere constant, which is of separate interest. Lastly, we analyze the trainability of Hamming weight preserving circuits, and show that the variance of the l2 cost function gradient is bounded according to the dimension (nk) of the subspace. This proves conditions of existence/lack of Barren Plateaus for these circuits, and highlights a setting where a recent conjecture on the link between controllability and trainability of variational quantum circuits does not apply.

arXiv:2309.15547•Quantum•May 15, 2025•43 citations
Pulse-based quantum machine learning (QML) models possess full expressivity when they are ensemble controllable. However, the accompanied barren plateaus render training intractable for high-dimensional systems. In this paper, we show that the trade-off can be understood via controllability analysis. We first apply the Fliess-series expansion to pulse-based QML models to investigate the effect of control system structure on model expressivity, which leads to a universal criterion for assessing the expressivity of generic QML models. We then show that uncontrollable pulse-based models that evolve on low-dimensional manifolds can achieve better balance between expressivity and trainability. Numerical experiments verify the proposed criterion and our analysis, which further demonstrate that the expressivity can be enhanced by increasing dimensionality, while barren plateaus can be avoided by reducing the controllability. Our approach provides a promising path for designing pulse-based QML models that are both highly expressive and trainable.
Pulse-based quantum machine learning (QML) has emerged as a promising paradigm in quantum artificial intelligence due to its exceptional hardware efficiency. For real-world applications, it is crucial that pulse-based models are both expressive and trainable. Previous studies have shown that pulse-based models operating under dynamical symmetry can be effectively trained, benefiting from a favorable loss landscape devoid of barren plateaus. However, this approach may lead to uncontrollability, which can limit expressivity if the model is poorly designed. In this paper, we explore the conditions necessary for pulse-based QML models to maintain both expressivity and trainability. We present a key requirement involving the system's initial state, the measurement observable, and the underlying dynamical symmetry Lie algebra, supported by numerical simulations. Our results provide a comprehensive framework for the design of practical pulse-based QML models that strike a good balance between expressivity and trainability.
As Quantum Machine Learning (QML) transitions toward practical implementation, the field faces a critical architectural bottleneck that challenges the fundamental assumptions of classical statistical learning theory. In classical deep learning, increasing model capacity typically risks overfitting. However, this study advances a counter-intuitive paradigm: unstructured contemporary QML architectures suffer from a profound state of quantum underfitting, driven by the "expressivity-trainability paradox." We demonstrate that the vast Hilbert space capacity of Parameterized Quantum Circuits (PQCs)-traditionally chased as the source of quantum advantage is the direct mathematical cause of Barren Plateaus (BPs), where gradient landscapes become exponentially flat. By synthesizing recent breakthroughs in Dynamical Lie Algebras (DLAs) and Geometric QML, we establish a comprehensive framework linking the algebraic dimension of circuit generators to their optimization dynamics. Furthermore, we empirically validate this framework on a non-linear binary classification task, illuminating a uniquely quantum manifestation of the bias-variance tradeoff: while unstructured architectures achieve near-perfect training accuracy via unscalable parameterization (quantum overfitting), embedding group-theoretic geometric priors acts as a structural regularizer. By restricting the DLA growth to a polynomial regime, our symmetry-preserving approach sacrifices raw memorization capacity to guarantee scalable, gradient-rich training landscapes, offering a robust roadmap for "Trainability-by-Design" in scalable quantum neural networks.
Abstract A new paradigm for data science has emerged, with quantum data, quantum models, and quantum computational devices. This field, called quantum machine learning (QML), aims to achieve a speedup over traditional machine learning for data analysis. However, its success usually hinges on efficiently training the parameters in quantum neural networks, and the field of QML is still lacking theoretical scaling results for their trainability. Some trainability results have been proven for a closely related field called variational quantum algorithms (VQAs). While both fields involve training a parametrized quantum circuit, there are crucial differences that make the results for one setting not readily applicable to the other. In this work, we bridge the two frameworks and show that gradient scaling results for VQAs can also be applied to study the gradient scaling of QML models. Our results indicate that features deemed detrimental for VQA trainability can also lead to issues such as barren plateaus in QML. Consequently, our work has implications for several QML proposals in the literature. In addition, we provide theoretical and numerical evidence that QML models exhibit further trainability issues not present in VQAs, arising from the use of a training dataset. We refer to these as dataset-induced barren plateaus. These results are most relevant when dealing with classical data, as here the choice of embedding scheme (i.e., the map between classical data and quantum states) can greatly affect the gradient scaling.
Exploiting the power of quantum computation to realize superior machine learning algorithms has been a major research focus of recent years, but the prospects of quantum machine learning (QML) remain dampened by considerable technical challenges. A particularly significant issue is that generic QML models suffer from so-called barren plateaus in their training landscapes—large regions where cost function gradients vanish exponentially in the number of qubits employed, rendering large models effectively untrainable. A leading strategy for combating this effect is to build problem-specific models that take into account the symmetries of their data in order to focus on a smaller, relevant subset of Hilbert space. In this work, we introduce a family of rotationally equivariant QML models built upon the quantum Fourier transform, and leverage recent insights from the Lie-algebraic study of QML models to prove that (a subset of) our models do not exhibit barren plateaus. In addition to our analytical results we numerically test our rotationally equivariant models on a dataset of simulated scanning tunneling microscope images of phosphorus impurities in silicon, where rotational symmetry naturally arises, and find that they dramatically outperform their generic counterparts in practice. Published by the American Physical Society 2024
Hybrid quantum neural networks (HQNNs) integrate parameterized quantum circuits (PQCs) within classical networks, where the behavior of the underlying PQCs is often the primary focus of analysis. In this context, expressibility and trainability are widely used to characterize PQC's performance and are commonly assumed to exhibit a trade-off, where highly expressive circuits are more susceptible to barren plateaus. However, the validity of this relationship in HQNNs remains unclear. In this paper, we systematically analyze the expressibility--trainability relationship in HQNNs across varying circuit depths, qubit counts, entanglement topologies. We consider different training configurations, including pure PQCs, quantum-only training in hybrid setting, and full end-to-end training of hybrid models. Our results show that pure PQCs exhibit only a weak and regime-dependent trade-off, while hybrid architectures increasingly disrupt and can eliminate this relationship under full hybrid training. This indicates that classical components reshape the optimization landscape, decoupling trainability from PQC expressibility. We further propose a multi-objective neural architecture search (NAS) framework that jointly optimizes expressibility, trainability, and task performance over a combined classical--quantum design space, revealing different Pareto-optimal solutions under full end-to-end and quantum only training in hybrid setting. different trainability definitions. Our results suggest that hybridization is not just an implementation detail, but a defining factor in the performance of quantum machine learning models.
Quantum machine learning (QML) has become a promising area for real world applications of quantum computers, but near-term methods and their scalability are still important research topics. In this context, we analyze the trainability and controllability of specific Hamming weight preserving variational quantum circuits (VQCs). These circuits use qubit gates that preserve subspaces of the Hilbert space, spanned by basis states with fixed Hamming weight k . In this work, we first design and prove the feasibility of new heuristic data loaders, performing quantum amplitude encoding of (nk) -dimensional vectors by training an n -qubit quantum circuit. These data loaders are obtained using controllability arguments, by checking the Quantum Fisher Information Matrix (QFIM)'s rank. Second, we provide a theoretical justification for the fact that the rank of the QFIM of any VQC state is almost-everywhere constant, which is of separate interest. Lastly, we analyze the trainability of Hamming weight preserving circuits, and show that the variance of the l2 cost function gradient is bounded according to the dimension (nk) of the subspace. This proves conditions of existence/lack of Barren Plateaus for these circuits, and highlights a setting where a recent conjecture on the link between controllability and trainability of variational quantum circuits does not apply.