arXiv:2607. 21647v1 Announce Type: new Abstract: Quantum federated learning enables distributed clients to train quantum neural networks without sharing local data, making it promising for privacy-aware intelligent services.
By Shanika Iroshi Nanayakkara, Shiva Raj Pokhrel
The paper introduces vFedProtoQNAS, a prototype‑guided personalized quantum neural architecture search method for virtual federated learning. It allows each client to independently design and train a device‑specific quantum neural network while avoiding parameter aggregation across structurally different models. Instead, clients share class‑wise latent prototypes, which are refined using global prototypes from the server to serve as federated semantic anchors, leading to a 3.70% accuracy improvement over FedAvg.
By Seok Bin Son, Samuel Yen-Chi Chen, Soohyun Park, Joongheon Kim
arXiv:2609.00356v1 Announce Type: new
Abstract: Quantum federated learning (QFL) enables clients to train quantum neural network (QNN) models without sharing private data. We find that aggregation in...
By Shanika Nanayakkara, Shiva Raj Pokhrel
arXiv:2609.25082v1 Announce Type: new
Abstract: Quantum machine learning (QML) is increasingly recognized as one of the most promising near-term applications of quantum computing, viewed as a next-fr...
By Carlos Cano, Daniel M. Jimenez-Gutierrez, Diego Sal, Georgios Kellaris, Joaquin del Rio, Oleksii Sliusarenko, Xabi Uribe-Etxebarria
The paper introduces QFWP-ANO, a quantum neural network architecture that uses a classical hypernetwork to program variational quantum circuit parameters and non‑local observables conditioned on each input. Unlike existing adaptive non‑local observable (ANO) methods that learn a single static observable, QFWP-ANO dynamically adapts to each input. Experiments on multivariate time‑series forecasting and reinforcement learning tasks show that QFWP-ANO outperforms traditional ANO‑based VQCs and other strong baselines, achieving the lowest mean‑squared error in most settings.
By Yu-Ting Lee, Samuel Yen-Chi Chen, Huan-Hsin Tseng
The paper proposes Entanglement-Weighted Pruning (EWP), a method for unlearning a client’s contribution from a federated quantum classifier without retraining from scratch. EWP scores each trainable circuit parameter by combining a Fisher‑information estimate on the target client’s data with a structural entanglement weight, pruning the lowest‑scoring parameters and optionally fine‑tuning the remaining ones. Experiments on a four‑qubit data‑re‑uploading ansatz trained with FedAvg across five simulated supply‑chain‑risk clients show that EWP achieves accuracy comparable to full retraining while reducing forgetting and wall‑clock time by about sixteenfold, outperforming random, Fisher‑only, or entanglement‑only pruning.
By Aditya Kumar, Sumit Chongder