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