q-iPrune: One-Shot Pruning for QNNs

• The paper introduces q-iPrune, a one-shot, structured pruning algorithm that leverages q-deformed Lie groups and quantum geometric redundancy metrics to streamline quantum circuits.
• It employs a noise-calibrated deformation parameter and task-conditioned q-overlap distance to identify and remove algebraically consistent redundant gates with explicit error guarantees.
• Empirical evaluations on classification and VQE tasks demonstrate up to 60% gate reduction with minimal performance loss, ensuring robust optimization under NISQ conditions.

q-iPrune is a one-shot, structured pruning framework for quantum neural networks (QNNs) that leverages $q$-deformed Lie group representations and a task-conditioned quantum geometric redundancy metric. Designed for the noisy intermediate-scale quantum (NISQ) regime, q-iPrune rigorously formulates and eliminates gate-level redundancy by exploiting both the algebraic structure of $q$-groups and the operational similarities of gates on task-relevant state ensembles. It provides explicit, task-conditioned error guarantees, polynomial computational complexity, and integrates a noise-adaptive deformation parameter, distinguishing it from heuristic or gradient-based alternatives (Shao et al., 30 Dec 2025).

1. Algebraic Structure: $q$-Deformation and Hardware Adaptation

q-iPrune replaces the canonical $\mathrm{SU}(2)$ Lie group with its Drinfeld–Jimbo $q$-deformation, denoted $\mathrm{SU}_q(2)$. The deformation is controlled by a continuous parameter $\lambda \in [0,1]$, smoothly interpolating between the fully commutative limit ($\lambda \to 0$) and the conventional non-commutative $\mathrm{SU}(2)$ algebra ($\lambda=1$). The core components are:

• Deformation Function: $q$0 with $q$1; as $q$2, $q$3 and standard $q$4 is recovered.
• $q$5-Lie Algebra: Generators $q$6 satisfy $q$7, $q$8, $q$9, with $q$0.
• Noise-Adaptive Scaling: Scaled generators $q$1 yield commutators $q$2, capturing the decoherence-driven commutative contraction as $q$3.
• Gate Parametrization: Gate operators are constructed as $q$4, using the $q$5-exponential map.

Two-qubit gates (e.g., CNOT) are $q$6-deformed via the Hopf coproduct, resulting in unitary $q$7-generalizations such as $q$8. Hardware noise is modeled through $q$9, allowing the algebra to adapt to physical device imperfections.

2. Redundancy Detection via $\mathrm{SU}(2)$0-Subgroups

Redundancy identification in q-iPrune is restricted to "algebraically consistent" $\mathrm{SU}(2)$1-subgroups. Given the full gate multiset $\mathrm{SU}(2)$2, q-iPrune partitions $\mathrm{SU}(2)$3 into disjoint subsets ($\mathrm{SU}(2)$4, $\mathrm{SU}(2)$5) where each $\mathrm{SU}(2)$6 is closed under (approximate) composition and inversion within $\mathrm{SU}(2)$7 or $\mathrm{SU}(2)$8 as appropriate. Within each subgroup, a single representative gate $\mathrm{SU}(2)$9 is chosen (commonly the medoid under the redundancy metric). All comparisons and redundancy assessments are confined to the corresponding subgroup, ensuring that any gate replacement preserves the local group-theoretic structure of the quantum circuit.

3. Task-Conditioned $q$0-Overlap Distance

The operational similarity of gates is quantified using the task-conditioned $q$1-overlap distance, defined on a finite ensemble $q$2 (e.g., data encodings or VQE intermediates). The $q$3-inner product is introduced: $q$4 with $q$5 and $q$6. This induces the norm $q$7.

The task-conditioned $q$8-overlap distance for compiled unitaries $q$9 is

$\mathrm{SU}_q(2)$0

This quantity measures the average $\mathrm{SU}_q(2)$1-weighted angular deviation of $\mathrm{SU}_q(2)$2 and $\mathrm{SU}_q(2)$3 on the ensemble. A gate $\mathrm{SU}_q(2)$4 is classified as $\mathrm{SU}_q(2)$5-redundant with respect to $\mathrm{SU}_q(2)$6 if $\mathrm{SU}_q(2)$7. This redundancy implies a guaranteed bound on expectation shifts of any observable $\mathrm{SU}_q(2)$8: $\mathrm{SU}_q(2)$9

4. One-Shot Structured Pruning Algorithm

q-iPrune performs a single traversal of each $\lambda \in [0,1]$0-subgroup, comparing all members to the designated reference gate. Gates within the $\lambda \in [0,1]$1-redundancy threshold are removed; those exceeding it are retained. The algorithm is as follows:

• Compute the redundancy threshold: $\lambda \in [0,1]$2 for a given task deviation $\lambda \in [0,1]$3.
• Initialize the set of kept gates $\lambda \in [0,1]$4 as empty.
• For each $\lambda \in [0,1]$5-subgroup $\lambda \in [0,1]$6:
  • Select $\lambda \in [0,1]$7 (the medoid under $\lambda \in [0,1]$8).
  • Add $\lambda \in [0,1]$9 to $\lambda \to 0$0.
  • For each $\lambda \to 0$1:
  • Compute $\lambda \to 0$2.
  • Keep $\lambda \to 0$3 if $\lambda \to 0$4; otherwise, discard.
• Return $\lambda \to 0$5.

There are no iterative retraining or gradient-based updates; each gate is processed once. The pruning is thus “one-shot” and structured, reflecting only algebraically and operationally justified redundancy.

5. Rigorous Theoretical Guarantees

Three main guarantees are established for q-iPrune:

1. Completeness of Redundancy Pruning: Only gates meeting the $\lambda \to 0$6-redundancy criterion are removed. Gates with $\lambda \to 0$7 are always kept (Theorem 4.1).
2. Circuit-Level Functional Bound: Replacing $\lambda \to 0$8 gates by reference representatives, the trace distance between the original and pruned circuit outputs is bounded as

$\lambda \to 0$9

with analogous bounds for observable drift (Theorem 4.2).

1. Polynomial Computational Complexity: If each $\mathrm{SU}(2)$0 computation costs $\mathrm{SU}(2)$1 work, the overall pruning cost is $\mathrm{SU}(2)$2, and medoid selection by all-pairs distance is $\mathrm{SU}(2)$3. There is no exponential scaling with Hilbert space size (Theorem 4.3).

These structural guarantees imply strict control over functional degradation and operational feasibility in the NISQ context.

6. Noise-Calibrated Deformation Parameter

The parameter $\mathrm{SU}(2)$4 modulates two aspects:

• Non-commutativity: $\mathrm{SU}(2)$5, interpolating between fully commutative and standard quantum regimes.
• Redundancy Thresholds: Because $\mathrm{SU}(2)$6 affects $\mathrm{SU}(2)$7 and hence $\mathrm{SU}(2)$8 in the $\mathrm{SU}(2)$9-inner product, smaller $\lambda=1$0 (corresponding to higher physical noise) typically increases the spectral bound $\lambda=1$1 and reduces the allowed $\lambda=1$2. This results in more conservative pruning under high noise.

In practical scenarios, $\lambda=1$3 is calibrated to match device decoherence characteristics, such as via randomized benchmarking.

7. Empirical Performance and Applicability

q-iPrune was validated on standard QNN benchmarks, including:

• Classification: 8 qubit, depth-12 circuits for MNIST "4 vs 9", Fashion-MNIST "Sandal vs Boot", and synthetic Bars-and-Stripes, with up to 480 gates.
• VQE: 4-qubit transverse-field Ising Model circuits, 240 gates.

Key results (with $\lambda=1$4 and $\lambda=1$5):

Task	Replacement %	Base Metric	Pruned Metric	Drop
Classification	60%	72.77% acc.	72.90% acc.	−0.13%
TFIM VQE	60%	0.3976 energy	0.3970 energy	$\lambda=1$6

Higher noise (larger $\lambda=1$7) or tolerance ($\lambda=1$8) yields less redundancy and larger (but still bounded) accuracy degradation. In all cases, the experimental accuracy and fidelity drops were well below the theoretical bounds (which are conservative and may be clipped at 100%).

q-iPrune thus delivers substantial circuit compression while certifying retention of task-relevant functionality, with robustness to hardware imperfections via the deformation parameter $\lambda=1$9 (Shao et al., 30 Dec 2025).