hardware algorithms policy

Dynamic Entanglement-Weighted Pruning for Quantum Federated Unlearning in Supply-Chain Risk Prediction

Curator's Take

AI Commentary

This article tackles a pressing gap at the intersection of quantum machine learning and data‑privacy law by showing how a variational quantum classifier can be “unlearned” without retraining from scratch—a capability that will become essential as federated quantum services move toward real‑world deployment. By marrying quantum Fisher information with an entanglement‑based weight, the Entanglement‑Weighted Pruning (EWP) method identifies and removes the most client‑specific circuit parameters, achieving oracle‑level accuracy while cutting compute time dramatically compared with full retraining. The work not only demonstrates a practical pathway for GDPR‑compliant quantum federated learning on near‑term hardware but also sets a benchmark that future experimental implementations will need to meet, highlighting both the promise and the current reliance on simulated validation.

— Mark Eatherly

Summary

Federated deployments of variational quantum classifiers are attractive for cross-organisation risk prediction in supply chains, because raw data never leaves the client, yet data-protection regulations such as the GDPR grant clients a right to request that their contribution be removed from a trained model after the fact. Retraining a federated model from scratch to honour such a request is correct but wasteful, and it is not obvious which quantum circuit parameters actually carry a given client's influence. We introduce Entanglement-Weighted Pruning (EWP), an unlearning procedure for quantum federated learning that scores every trainable circuit parameter with the product of two signals: the diagonal entry of the quantum Fisher information matrix estimated on the target client's data via the parameter-shift rule, and a structural entanglement weight associated with the parameter's gate. Parameters with the lowest scores are pruned, optionally followed by a short fine-tuning pass on the retained clients. We implement the full pipeline in Qiskit for a four-qubit data-re-uploading ansatz trained with FedAvg across five simulated supply-chain-risk clients, and benchmark EWP against full retraining, fine-tuning alone, random pruning, Fisher-only pruning, and entanglement-only pruning, over three random seeds. EWP attains a mean post-unlearning accuracy statistically indistinguishable from the full-retraining oracle, while producing a lower forgetting score and requiring roughly 16 times less wall-clock time. Ablations over pruning threshold, client count, and non-IID strength show that combining the two signals is necessary, as entanglement-only and Fisher-only pruning each substantially degrade accuracy relative to EWP.