Investigating the Lottery Ticket Hypothesis for Variational Quantum Circuits

• URL: http://arxiv.org/abs/2509.11190v1
• Date: Sun, 14 Sep 2025 09:39:32 GMT
• Title: Investigating the Lottery Ticket Hypothesis for Variational Quantum Circuits
• Authors: Michael Kölle, Leonhard Klingert, Julian Schönberger, Philipp Altmann, Tobias Rohe, Claudia Linnhoff-Popien,
• Abstract summary: Lottery Ticket Hypothesis (LTH) is a recent concept in classical machine learning.<n>We show that the weak LTH holds for VQCs, revealing winning tickets that retain just 26.0% of the original parameters.<n>These findings indicate that LTH may mitigate barren plateaus by reducing parameter counts while preserving performance.
• Score: 3.3180230163290463
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Quantum-Train: Rethinking Hybrid Quantum-Classical Machine Learning in the Model Compression Perspective [7.7063925534143705]
  We introduce the Quantum-Train(QT) framework, a novel approach that integrates quantum computing with machine learning algorithms. QT achieves remarkable results by employing a quantum neural network alongside a classical mapping model.
  arXiv  Detail & Related papers  (2024-05-18T14:35:57Z)
• Weight Re-Mapping for Variational Quantum Algorithms [54.854986762287126]
  We introduce the concept of weight re-mapping for variational quantum circuits (VQCs) We employ seven distinct weight re-mapping functions to assess their impact on eight classification datasets. Our results indicate that weight re-mapping can enhance the convergence speed of the VQC.
  arXiv  Detail & Related papers  (2023-06-09T09:42:21Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• TeD-Q: a tensor network enhanced distributed hybrid quantum machine learning framework [48.491303218786044]
  TeD-Q is an open-source software framework for quantum machine learning.<n>It seamlessly integrates classical machine learning libraries with quantum simulators.<n>It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
  arXiv  Detail & Related papers  (2023-01-13T09:35:05Z)
• Improving Convergence for Quantum Variational Classifiers using Weight Re-Mapping [60.086820254217336]
  In recent years, quantum machine learning has seen a substantial increase in the use of variational quantum circuits (VQCs) We introduce weight re-mapping for VQCs, to unambiguously map the weights to an interval of length $2pi$. We demonstrate that weight re-mapping increased test accuracy for the Wine dataset by $10%$ over using unmodified weights.
  arXiv  Detail & Related papers  (2022-12-22T13:23:19Z)
• On the practical usefulness of the Hardware Efficient Ansatz [0.40498500266986387]
  One-dimensional layered Hardware Efficient Ansatz (HEA) seeks to minimize the effect of hardware noise by using native gates and connectives. We show that in these cases a shallow HEA is always trainable and that there exists an anti-concentration of loss function values.
  arXiv  Detail & Related papers  (2022-11-02T20:57:55Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Alternating Layered Variational Quantum Circuits Can Be Classically Optimized Efficiently Using Classical Shadows [4.680722019621822]
  Variational quantum algorithms (VQAs) are the quantum analog of classical neural networks (NNs) We introduce a training algorithm with an exponential reduction in training cost of such VQAs.
  arXiv  Detail & Related papers  (2022-08-24T15:47:44Z)
• QOC: Quantum On-Chip Training with Parameter Shift and Gradient Pruning [18.939312562621634]
  We present QOC, the first experimental demonstration of practical on-chip PQC training with parameter shift.<n>We propose probabilistic gradient pruning to firstly identify gradients with potentially large errors and then remove them.<n>The results demonstrate that our on-chip training achieves over 90% and 60% accuracy for 2-class and 4-class image classification tasks.
  arXiv  Detail & Related papers  (2022-02-26T22:27:36Z)
• Improved variational quantum eigensolver via quasi-dynamical evolution [0.0]
  The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm designed for current and near-term quantum devices. There are problems with VQE that forbid a favourable scaling towards quantum advantage. We propose and extensively test a quantum annealing inspired algorithm that supplements VQE. The improved VQE avoids barren plateaus, exits local minima, and works with low-depth circuits.
  arXiv  Detail & Related papers  (2022-02-21T11:21:44Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• On the learnability of quantum neural networks [132.1981461292324]
  We consider the learnability of the quantum neural network (QNN) built on the variational hybrid quantum-classical scheme. We show that if a concept can be efficiently learned by QNN, then it can also be effectively learned by QNN even with gate noise.
  arXiv  Detail & Related papers  (2020-07-24T06:34:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.