mlsanityData to 14 Oct 2026

Symmetric Pruning in Quantum Neural Networks

arXiv 2208.14057 ↗First posted 30 Aug 2022quant-ph cs.AI cs.LGcited by 21

Not on the map. Why?

Abstract (arXiv)

Many fundamental properties of a quantum system are captured by its Hamiltonian and ground state. Despite the significance of ground states preparation (GSP), this task is classically intractable for large-scale Hamiltonians. Quantum neural networks (QNNs), which exert the power of modern quantum machines, have emerged as a leading protocol to conquer this issue. As such, how to enhance the performance of QNNs becomes a crucial topic in GSP. Empirical evidence showed that QNNs with handcraft symmetric ansatzes generally experience better trainability than those with asymmetric ansatzes, while theoretical explanations have not been explored. To fill this knowledge gap, here we propose the effective quantum neural tangent kernel (EQNTK) and connect this concept with over-parameterization theory to quantify the convergence of QNNs towards the global optima. We uncover that the advance of symmetric ansatzes attributes to their large EQNTK value with low effective dimension, which requests few parameters and quantum circuit depth to reach the over-parameterization regime permitting a benign loss landscape and fast convergence. Guided by EQNTK, we further devise a symmetric pruning (SP) scheme to automatically tailor a symmetric ansatz from an over-parameterized and asymmetric one to greatly improve the performance of QNNs when the explicit symmetry information of Hamiltonian is unavailable. Extensive numerical simulations are conducted to validate the analytical results of EQNTK and the effectiveness of SP.

Key facts. Cited by 21 papers in the map (data through 14 Oct 2026). Builds on 31 of its 75 references that are in the map. First posted on arXiv 30 Aug 2022.

Builds on

31 of 75 references.

References · 31

  1. 2021Convex optimizationcited by 2,515
  2. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  3. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  4. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  5. 2020Variational Quantum Algorithmscited by 692
  6. 2018Barren plateaus in quantum neural network training landscapescited by 630
  7. 2020What is the State of Neural Network Pruning?cited by 583
  8. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
  9. 2020The power of quantum neural networkscited by 379
  10. 2020The effect of data encoding on the expressive power of variational quantum machine learning modelscited by 333
  11. 2021Generalization in quantum machine learning from few training datacited by 216
  12. 2020Noise-Induced Barren Plateaus in Variational Quantum Algorithmscited by 193
19 more
  1. 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 182
  2. 2020Absence of Barren Plateaus in Quantum Convolutional Neural Networkscited by 125
  3. 2020Entanglement Induced Barren Plateauscited by 101
  4. 2021Theory of overparametrization in quantum neural networkscited by 100
  5. 2021QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuitscited by 98
  6. 2020Layerwise learning for quantum neural networkscited by 88
  7. 2020Quantum circuit architecture search for variational quantum algorithmscited by 82
  8. 2022Exploiting symmetry in variational quantum machine learningcited by 69
  9. 2022Group-Invariant Quantum Machine Learningcited by 56
  10. 2021Representation Learning via Quantum Neural Tangent Kernelscited by 40
  11. 2020On barren plateaus and cost function locality in variational quantum algorithmscited by 36
  12. 2021Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum Ans"atzecited by 29
  13. 2022Analytic theory for the dynamics of wide quantum neural networkscited by 21
  14. 2020Learning Unitaries by Gradient Descentcited by 20
  15. 2021The dilemma of quantum neural networkscited by 20
  16. 2022A Convergence Theory for Over-parameterized Variational Quantum Eigensolverscited by 15
  17. 2022Laziness, Barren Plateau, and Noise in Machine Learningcited by 10
  18. 2020Classical symmetries and the Quantum Approximate Optimization Algorithmcited by 5
  19. 2022Toward Super-polynomial Quantum Speedup of Equivariant Quantum Algorithms with SU(d) Symmetrycited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 5; 2023: 7; 2024: 5; 2025: 3; 2026: 1.

21 papers.

Sort:

  1. 2022Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networkscited by 52
  2. 2022Problem-Dependent Power of Quantum Neural Networks on Multi-Class Classificationcited by 20
  3. 2023Effects of noise on the overparametrization of quantum neural networkscited by 9
  4. 2023Analyzing Convergence in Quantum Neural Networks: Deviations from Neural Tangent Kernelscited by 8
  5. 2023Symmetry-invariant quantum machine learning force fieldscited by 8
  6. 2022QuACK: Accelerating Gradient-Based Quantum Optimization with Koopman Operator Learningcited by 7
  7. 2022SnCQA: A hardware-efficient equivariant quantum convolutional circuit architecturecited by 7
  8. 2023Expressibility-induced Concentration of Quantum Neural Tangent Kernelscited by 7
  9. 2024Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuitscited by 7
  10. 2025ATP: Adaptive Threshold Pruning for Efficient Data Encoding in Quantum Neural Networkscited by 5
  11. 2022The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learningcited by 4
  12. 2024MG-Net: Learn to Customize QAOA with Circuit Depth Awarenesscited by 4
9 more
  1. 2025Demonstration of Efficient Predictive Surrogates for Large-scale Quantum Processorscited by 3
  2. 2023Dynamical transition in controllable quantum neural networks with large depthcited by 2
  3. 2023Statistical Analysis of Quantum State Learning Process in Quantum Neural Networkscited by 1
  4. 2024Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theoremcited by 1
  5. 2024The curse of random quantum datacited by 1
  6. 2025PALQO: Physics-informed Model for Accelerating Large-scale Quantum Optimizationcited by 1
  7. 2023Symbolically integrating tensor networks over various random tensors by the second version of Python RTNIcited by 0
  8. 2024Quantum-data-driven dynamical transition in quantum learningcited by 0
  9. 2026When AI meets quantum information: A comprehensive reviewcited by 0