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:2509.11190 · International Conference on Agents and Artificial Intelligence (ICAART)

Investigating the Lottery Ticket Hypothesis for Variational Quantum Circuits

Michael Kölle, Leonhard Klingert, Julian Schönberger, Philipp J. Altmann, Tobias Rohe, Claudia Linnhoff–Popien

Published Jan 1, 2026• 1 citation
arXivHTMLPDF

Abstract

Quantum computing is an emerging field in computer science that has seen considerable progress in recent years, especially in machine learning. By harnessing the principles of quantum physics, it can surpass the limitations of classical algorithms. However, variational quantum circuits (VQCs), which rely on adjustable parameters, often face the barren plateau phenomenon, hindering optimization. The Lottery Ticket Hypothesis (LTH) is a recent concept in classical machine learning that has led to notable improvements in parameter efficiency for neural networks. It states that within a large network, a smaller, more efficient subnetwork, or ''winning ticket,'' can achieve comparable performance, potentially circumventing plateau challenges. In this work, we investigate whether this idea can apply to VQCs. We show that the weak LTH holds for VQCs, revealing winning tickets that retain just 26.0\% of the original parameters. For the strong LTH, where a pruning mask is learned without any training, we discovered a winning ticket in a binary VQC, achieving 100\% accuracy with only 45\% of the weights. These findings indicate that LTH may mitigate barren plateaus by reducing parameter counts while preserving performance, thus enhancing the efficiency of VQCs in quantum machine learning tasks.

DOI
10.5220/0014247600004052

Related papers

Strong Lottery Ticket Hypothesis for Quantum Neural Networks

Hongkyun Kwon, Hyun Kyu Lee, Joongheon Kim +1 more

Quantum Neural Networks (QNNs) possess high expressivity via rich unitary transformations, offering abundant representational capacity while maintaining a parameter-effective architecture. In classical deep learning, the high expressivity of deep neural networks (DNNs) motivates the Strong Lottery Ticket Hypothesis (SLTH), which suggests that a randomly initialized DNN contains sparse subnetworks that achieve high performance immediately or serve as a warm start. On the quantum side, a key question is: Does a strong lottery ticket exist in QNNs? Our answer is, Quantum-Strong Lottery Ticket Hypothesis (Q-SLTH), i.e., the first theoretical analysis for the existence of high-performing subnetworks in random scratch of QNNs. We validate our theory by proposing a quantum edge-popup algorithm to find strong subnetworks and empirically identifying winning tickets in randomly initialized QNNs on the MNIST and Fashion-MNIST benchmarks. For practice, Q-SLTH suggests a way to compress QNNs, allowing them to use fewer gates and thereby mitigating quantum-noise-induced degradation that is amplified across multiple layers of quantum gates.

ACM International Conference on Information and Knowledge Management (CIKM)•Nov 3, 2026•0 citations

Connectivity determines the capability of sparse neural network quantum states

Brandon Barton, Juan Carrasquilla, Christopher Roth +1 more

Abstract The lottery ticket hypothesis (LTH) posits that within overparametrized neural networks, there exist sparse subnetworks that are capable of matching the performance of the original model when trained in isolation from the original initialization. We extend this hypothesis to the unsupervised task of approximating the ground state of quantum many-body Hamiltonians, a problem equivalent to finding a neural-network compression of the lowest-lying eigenvector of an exponentially large matrix. Focusing on two representative quantum Hamiltonians, the transverse field Ising model and the toric code, we demonstrate that sparse neural networks can reach accuracies comparable to their dense counterparts, even when pruned by more than an order of magnitude in parameter count. Crucially, and unlike the original LTH, we find that performance depends only on the structure of the sparse subnetwork, not on the specific initialization, when trained in isolation. Moreover, we identify universal scaling behavior that persists across network sizes and physical models, where the boundaries of scaling regions are determined by the underlying Hamiltonian. At the onset of high-error scaling, we observe signatures of a sparsity-induced quantum phase transition that is first-order in shallow networks. Finally, we demonstrate that pruning enhances interpretability by linking the structure of sparse subnetworks to the underlying physics of the Hamiltonian.

arXiv:2505.22734•Machine Learning Science and Technology•Apr 21, 2026•6 citations

Enhancing variational quantum circuit training: an improved neural network approach for barren plateau mitigation

Yi Zhu, Yanying Liang, Haozhen Situ

Abstract Combining classical optimization with parameterized quantum circuit evaluation, variational quantum algorithms (VQAs) are among the most promising algorithms in near-term quantum computing. However, the training of variational quantum circuits (VQCs) is susceptible to a phenomenon known as barren plateaus (BPs). Various approaches have been proposed to mitigate this issue, such as using neural networks to generate VQC parameters. In this paper, we improve the NN-based BP mitigation approach by refining the neural network architecture and extend its applicability to a more generalized scenario that includes random quantum inputs and VQC structures. We evaluate the effectiveness of the approach by comparing the convergence speed before and after it is utilized. Furthermore, we give an explanation for the effectiveness of the NN-based BP mitigation approach by utilizing a loss landscape visualization technique and the expressibility metric of VQC. The smoothness of the loss landscape offers an intuitive insight into the approach’s utility, while the reduction in expressibility accounts for the enhanced trainability. Our research highlights the universal applicability of the NN-based BP mitigation approach, underscoring its potential to drive progress in the development of VQAs across diverse domains.

arXiv:2411.09226•Physica Scripta•Jul 16, 2025•8 citations

Investigating Parameter Initialization Techniques in Variational Quantum Circuits

Jack Cunningham, Jun Zhuang

In recent years, Variational Quantum Circuit (VQC)s have been widely explored to advance quantum circuits against classic models on various domains, such as quantum chemistry and quantum machine learning. Similar to classic machine-learning models, VQCs can be optimized through gradient-based approaches. However, the gradient of VQCs may dramatically vanish during the optimization process as the number of qubits or layers increases. This issue, known as Barren Plateau (BP)s, seriously hinders the scaling of VQCs on large datasets. To mitigate the exponential gradient vanishing, extensive efforts have been devoted to tackling this issue through different methods. Some BP mitigation strategies include VQC parameter initialization and more complex VQC architectures such as Quantum Neural Network (QNN)s and Quantum Convolutional Neural Network (QCNN). In this thesis, we aim to investigate several circuit components through the lens of parameter initialization techniques. We study the performance and gradient variance of the different quantum circuit structures in combination with various initialization methods. In most existing studies, researchers typically focus on improving or understanding one aspect of the VQC approach. Instead, we plan to investigate how the two components of the VQC behave as we interchange the different variables of the circuit. This investigation will provide a better understanding of how the VQC structures behave under different initialization strategies for binary classification problems.

•Dec 1, 2024•0 citations

Investigating and mitigating barren plateaus in variational quantum circuits: a survey

Jack Cunningham, Jun Zhuang

Abstract In recent years, variational quantum circuits (VQCs) have been widely explored to advance quantum circuits against classic models on various domains, such as quantum chemistry and quantum machine learning. Similar to classic machine-learning models, VQCs can be trained through various optimization approaches, such as gradient-based or gradient-free methods. However, when employing gradient-based methods, the gradient variance of VQCs may dramatically vanish as the number of qubits or layers increases. This issue, a.k.a. barren plateaus (BPs), seriously hinders the scaling of VQCs on large datasets. To mitigate the barren plateaus, extensive efforts have been devoted to tackling this issue through diverse strategies. In this survey, we conduct a systematic literature review of recent works from both investigation and mitigation perspectives. Furthermore, we propose a new taxonomy to categorize most existing mitigation strategies into five groups and introduce them in detail. Also, we compare the concurrent survey papers about BPs. Finally, we provide insightful discussion on future directions for BPs.

arXiv:2407.17706•Quantum Information Processing•Jan 31, 2025•51 citations

Illustration of Barren Plateaus in Quantum Computing

Gerhard Stenzel, Tobias Rohe, Michael Kölle +3 more

Variational Quantum Circuits (VQCs) have emerged as a promising paradigm for quantum machine learning in the NISQ era. While parameter sharing in VQCs can reduce the parameter space dimensionality and potentially mitigate the barren plateau phenomenon, it introduces a complex trade-off that has been largely overlooked. This paper investigates how parameter sharing, despite creating better global optima with fewer parameters, fundamentally alters the optimization landscape through deceptive gradients -- regions where gradient information exists but systematically misleads optimizers away from global optima. Through systematic experimental analysis, we demonstrate that increasing degrees of parameter sharing generate more complex solution landscapes with heightened gradient magnitudes and measurably higher deceptiveness ratios. Our findings reveal that traditional gradient-based optimizers (Adam, SGD) show progressively degraded convergence as parameter sharing increases, with performance heavily dependent on hyperparameter selection. We introduce a novel gradient deceptiveness detection algorithm and a quantitative framework for measuring optimization difficulty in quantum circuits, establishing that while parameter sharing can improve circuit expressivity by orders of magnitude, this comes at the cost of significantly increased landscape deceptiveness. These insights provide important considerations for quantum circuit design in practical applications, highlighting the fundamental mismatch between classical optimization strategies and quantum parameter landscapes shaped by parameter sharing.

cs.LGCross-listedarXiv:2602.16558•International Conference on Agents and Artificial Intelligence (ICAART)•Feb 19, 2026•2 citations
Quantum computing is an emerging field in computer science that has seen considerable progress in recent years, especially in machine learning. By harnessing the principles of quantum physics, it can surpass the limitations of classical algorithms. However, variational quantum circuits (VQCs), which rely on adjustable parameters, often face the barren plateau phenomenon, hindering optimization. The Lottery Ticket Hypothesis (LTH) is a recent concept in classical machine learning that has led to notable improvements in parameter efficiency for neural networks. It states that within a large network, a smaller, more efficient subnetwork, or ''winning ticket,'' can achieve comparable performance, potentially circumventing plateau challenges. In this work, we investigate whether this idea can apply to VQCs. We show that the weak LTH holds for VQCs, revealing winning tickets that retain just 26.0% of the original parameters. For the strong LTH, where a pruning mask is learned without any training, we discovered a winning ticket in a binary VQC, achieving 100% accuracy with only 45% of the weights. These findings indicate that LTH may mitigate barren plateaus by reducing parameter counts while preserving performance, thus enhancing the efficiency of VQCs in quantum machine learning tasks.
Quantum Neural Networks (QNNs) possess high expressivity via rich unitary transformations, offering abundant representational capacity while maintaining a parameter-effective architecture. In classical deep learning, the high expressivity of deep neural networks (DNNs) motivates the Strong Lottery Ticket Hypothesis (SLTH), which suggests that a randomly initialized DNN contains sparse subnetworks that achieve high performance immediately or serve as a warm start. On the quantum side, a key question is: Does a strong lottery ticket exist in QNNs? Our answer is, Quantum-Strong Lottery Ticket Hypothesis (Q-SLTH), i.e., the first theoretical analysis for the existence of high-performing subnetworks in random scratch of QNNs. We validate our theory by proposing a quantum edge-popup algorithm to find strong subnetworks and empirically identifying winning tickets in randomly initialized QNNs on the MNIST and Fashion-MNIST benchmarks. For practice, Q-SLTH suggests a way to compress QNNs, allowing them to use fewer gates and thereby mitigating quantum-noise-induced degradation that is amplified across multiple layers of quantum gates.
Abstract The lottery ticket hypothesis (LTH) posits that within overparametrized neural networks, there exist sparse subnetworks that are capable of matching the performance of the original model when trained in isolation from the original initialization. We extend this hypothesis to the unsupervised task of approximating the ground state of quantum many-body Hamiltonians, a problem equivalent to finding a neural-network compression of the lowest-lying eigenvector of an exponentially large matrix. Focusing on two representative quantum Hamiltonians, the transverse field Ising model and the toric code, we demonstrate that sparse neural networks can reach accuracies comparable to their dense counterparts, even when pruned by more than an order of magnitude in parameter count. Crucially, and unlike the original LTH, we find that performance depends only on the structure of the sparse subnetwork, not on the specific initialization, when trained in isolation. Moreover, we identify universal scaling behavior that persists across network sizes and physical models, where the boundaries of scaling regions are determined by the underlying Hamiltonian. At the onset of high-error scaling, we observe signatures of a sparsity-induced quantum phase transition that is first-order in shallow networks. Finally, we demonstrate that pruning enhances interpretability by linking the structure of sparse subnetworks to the underlying physics of the Hamiltonian.
Abstract Combining classical optimization with parameterized quantum circuit evaluation, variational quantum algorithms (VQAs) are among the most promising algorithms in near-term quantum computing. However, the training of variational quantum circuits (VQCs) is susceptible to a phenomenon known as barren plateaus (BPs). Various approaches have been proposed to mitigate this issue, such as using neural networks to generate VQC parameters. In this paper, we improve the NN-based BP mitigation approach by refining the neural network architecture and extend its applicability to a more generalized scenario that includes random quantum inputs and VQC structures. We evaluate the effectiveness of the approach by comparing the convergence speed before and after it is utilized. Furthermore, we give an explanation for the effectiveness of the NN-based BP mitigation approach by utilizing a loss landscape visualization technique and the expressibility metric of VQC. The smoothness of the loss landscape offers an intuitive insight into the approach’s utility, while the reduction in expressibility accounts for the enhanced trainability. Our research highlights the universal applicability of the NN-based BP mitigation approach, underscoring its potential to drive progress in the development of VQAs across diverse domains.
In recent years, Variational Quantum Circuit (VQC)s have been widely explored to advance quantum circuits against classic models on various domains, such as quantum chemistry and quantum machine learning. Similar to classic machine-learning models, VQCs can be optimized through gradient-based approaches. However, the gradient of VQCs may dramatically vanish during the optimization process as the number of qubits or layers increases. This issue, known as Barren Plateau (BP)s, seriously hinders the scaling of VQCs on large datasets. To mitigate the exponential gradient vanishing, extensive efforts have been devoted to tackling this issue through different methods. Some BP mitigation strategies include VQC parameter initialization and more complex VQC architectures such as Quantum Neural Network (QNN)s and Quantum Convolutional Neural Network (QCNN). In this thesis, we aim to investigate several circuit components through the lens of parameter initialization techniques. We study the performance and gradient variance of the different quantum circuit structures in combination with various initialization methods. In most existing studies, researchers typically focus on improving or understanding one aspect of the VQC approach. Instead, we plan to investigate how the two components of the VQC behave as we interchange the different variables of the circuit. This investigation will provide a better understanding of how the VQC structures behave under different initialization strategies for binary classification problems.
Abstract In recent years, variational quantum circuits (VQCs) have been widely explored to advance quantum circuits against classic models on various domains, such as quantum chemistry and quantum machine learning. Similar to classic machine-learning models, VQCs can be trained through various optimization approaches, such as gradient-based or gradient-free methods. However, when employing gradient-based methods, the gradient variance of VQCs may dramatically vanish as the number of qubits or layers increases. This issue, a.k.a. barren plateaus (BPs), seriously hinders the scaling of VQCs on large datasets. To mitigate the barren plateaus, extensive efforts have been devoted to tackling this issue through diverse strategies. In this survey, we conduct a systematic literature review of recent works from both investigation and mitigation perspectives. Furthermore, we propose a new taxonomy to categorize most existing mitigation strategies into five groups and introduce them in detail. Also, we compare the concurrent survey papers about BPs. Finally, we provide insightful discussion on future directions for BPs.
Variational Quantum Circuits (VQCs) have emerged as a promising paradigm for quantum machine learning in the NISQ era. While parameter sharing in VQCs can reduce the parameter space dimensionality and potentially mitigate the barren plateau phenomenon, it introduces a complex trade-off that has been largely overlooked. This paper investigates how parameter sharing, despite creating better global optima with fewer parameters, fundamentally alters the optimization landscape through deceptive gradients -- regions where gradient information exists but systematically misleads optimizers away from global optima. Through systematic experimental analysis, we demonstrate that increasing degrees of parameter sharing generate more complex solution landscapes with heightened gradient magnitudes and measurably higher deceptiveness ratios. Our findings reveal that traditional gradient-based optimizers (Adam, SGD) show progressively degraded convergence as parameter sharing increases, with performance heavily dependent on hyperparameter selection. We introduce a novel gradient deceptiveness detection algorithm and a quantitative framework for measuring optimization difficulty in quantum circuits, establishing that while parameter sharing can improve circuit expressivity by orders of magnitude, this comes at the cost of significantly increased landscape deceptiveness. These insights provide important considerations for quantum circuit design in practical applications, highlighting the fundamental mismatch between classical optimization strategies and quantum parameter landscapes shaped by parameter sharing.