paper-with-me

Papers

QAdaPrune: Adaptive Parameter Pruning For Training Variational Quantum Circuits

2024-08-23 · Ankit Kulshrestha, Xiaoyuan Liu, Hayato Ushijima-Mwesigwa, Bao Bach, Ilya Safro

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 \emph{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 \emph{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.\\ \noindent{\bf Reproducibility}: The source code and data are available at \url{https://github.com/aicaffeinelife/QAdaPrune.git}

📄 PDF Abstract BibTeX arXiv:2408.13352

Code (1)

aicaffeinelife/qadaprune 공식 구현

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Robust Learning of Parsimonious Deep Neural Networks

2022-05-10 · Valentin Frank Ingmar Guenter, Athanasios Sideris

We propose a simultaneous learning and pruning algorithm capable of identifying and eliminating irrelevant structures in a neural network during the early stages of training. Thus, the computational cost of subsequent tr…

Variational Inference

Concurrent Training and Layer Pruning of Deep Neural Networks

2024-06-06 · Valentin Frank Ingmar Guenter, Athanasios Sideris

We propose an algorithm capable of identifying and eliminating irrelevant layers of a neural network during the early stages of training. In contrast to weight or filter-level pruning, layer pruning reduces the harder to…

Variational Inference

Complexity-Aware Training of Deep Neural Networks for Optimal Structure Discovery

2024-11-14 · Valentin Frank Ingmar Guenter, Athanasios Sideris

We propose a novel algorithm for combined unit/filter and layer pruning of deep neural networks that functions during training and without requiring a pre-trained network to apply. Our algorithm optimally trades-off lear…

Network PruningStochastic Optimization

Variational Convolutional Neural Network Pruning

2019-06-01 · CVPR 2019 6 · Chenglong Zhao, Bingbing Ni, Jian Zhang, Qiwei Zhao 외

We propose a variational Bayesian scheme for pruning convolutional neural networks in channel level. This idea is motivated by the fact that deterministic value based pruning methods are inherently improper and unstable.…

Network Pruning

QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits

2021-07-22 · Hanrui Wang, Yongshan Ding, Jiaqi Gu, Zirui Li 외

Quantum noise is the key challenge in Noisy Intermediate-Scale Quantum (NISQ) computers. Previous work for mitigating noise has primarily focused on gate-level or pulse-level noise-adaptive compilation. However, limited …