aiqbench analysis
This research introduces Entanglement-Weighted Pruning, a method to efficiently remove specific client data from federated quantum models without full retraining, addressing critical GDPR compliance needs in supply-chain risk prediction. By combining Quantum Fisher information with structural entanglement weights, the approach maintains accuracy comparable to complete retraining while significantly reducing computational time and memory overhead.
Dynamic Entanglement-Weighted Pruning for Quantum Federated Unlearning in Supply-Chain Risk Prediction
arXiv:2608.17069v1 Announce Type: cross Abstract: 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.
Abstract: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.
25 pages, 10 figures, 11 tables. Code: this https URL. Data (Zenodo): this https URL. Research carried out as part of the QIntern 2026 programme (QWorld Association)
Quantum Physics (quant-ph); Machine Learning (cs.LG)
I.2.6; I.2.11; C.2.4
arXiv:2608.17069 [quant-ph]
(or arXiv:2608.17069v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2608.17069 arXiv-issued DOI via DataCite (pending registration)
Full text under the publisher's open licence · 293 words
Related coverage

Little Venice, little Sparta: The UAE statecraft meets the war on Iran – European Council on Foreign Relations
ecfr.eu · Sep 21, 2026

News
Quantum Computing Report · Jul 25, 2026

Little Venice, Little Sparta: The UAE Statecraft Meets The War On Iran - Analysis
eurasiareview.com · Sep 24, 2026

AI and Quantum Computing Briefing
livetradingnews.com · Aug 4, 2026