QAdaPrune: Adaptive Parameter Pruning For Training Variational Quantum Circuits
Not on the map. Why?
Abstract (arXiv)
In the present noisy intermediate scale quantum computing era, there is a critical need to devise methods for the efficient implementation of gate-based variational quantum circuits. This ensures that a range of proposed applications can be deployed on real quantum hardware. The efficiency of quantum circuit is desired both in the number of trainable gates and the depth of the overall circuit. The major concern of barren plateaus has made this need for efficiency even more acute. The problem of efficient quantum circuit realization has been extensively studied in the literature to reduce gate complexity and circuit depth. Another important approach is to design a method to reduce the parameter complexity in a variational quantum circuit. Existing methods include hyperparameter-based parameter pruning which introduces an additional challenge of finding the best hyperparameters for different applications. In this paper, we present QAdaPrune - an adaptive parameter pruning algorithm that automatically determines the threshold and then intelligently prunes the redundant and non-performing parameters. We show that the resulting sparse parameter sets yield quantum circuits that perform comparably to the unpruned quantum circuits and in some cases may enhance trainability of the circuits even if the original quantum circuit gets stuck in a barren plateau. noindentbf Reproducibility: The source code and data are available at urlhttps://github.com/aicaffeinelife/QAdaPrune.git
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 10 of its 25 references that are in the map. First posted on arXiv 23 Aug 2024.
Builds on
10 of 25 references.
References · 10
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2018Barren plateaus in quantum neural network training landscapescited by 624
- 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 241
- 2020Quantum circuit architecture search for variational quantum algorithmscited by 81
- 2022QOC: Quantum On-Chip Training with Parameter Shift and Gradient Pruningcited by 23
- 2022BEINIT: Avoiding Barren Plateaus in Variational Quantum Algorithmscited by 15
- 2021Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computerscited by 14
- 2022Quantum Neural Network Compressioncited by 12
- 2019Multilevel Combinatorial Optimization Across Quantum Architecturescited by 9
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 1.
4 papers.
- 2025ATP: Adaptive Threshold Pruning for Efficient Data Encoding in Quantum Neural Networkscited by 5
- 2024Scalable iterative pruning of large language and vision models using block coordinate descentcited by 1
- 2026WSBD: Freezing-Based Optimizer for Quantum Neural Networkscited by 1
- 2025Investigating the Lottery Ticket Hypothesis for Variational Quantum Circuitscited by 0
- 2026WSBD: Freezing-Based Optimizer for Quantum Neural Networks11 Feb 2026
- 2025Investigating the Lottery Ticket Hypothesis for Variational Quantum Circuits14 Sep 2025
- 2025ATP: Adaptive Threshold Pruning for Efficient Data Encoding in Quantum Neural Networks26 Mar 2025
- 2024Scalable iterative pruning of large language and vision models using block coordinate descent26 Nov 2024