arXiv AI

PAS-QFL: Personalized Ansatz Selection for Quantum Federated Learning under Client Data Heterogeneity

arXiv:2608. 14995v1 Announce Type: cross Abstract: Quantum federated learning (QFL) lets multiple quantum clients collaboratively train quantum neural networks (QNNs) without sharing private local data.

arXiv AI
2d ago

vFedProtoQNAS: Prototype-Guided Personalized Quantum Neural Architecture Search for Virtual Federated Learning

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 Machine Learning
Sep 23

Federating Quantum and Classical Computing: A Privacy-Preserving Hybrid Approach

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
arXiv Machine Learning
Sep 17

Learning to Program Adaptive Non-Local Observables for Machine Learning

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
arXiv Machine Learning
Aug 19

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

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
arXiv Machine Learning
Jun 24

Quantum Adaptive Self-Attention for Quantum Transformer Models

arXiv:2504. 05336v4 Announce Type: replace-cross Abstract: A recurring weakness in quantum machine learning (QML) is that reported ``quantum advantages'' are seldom tested against a \emph{capacity-matched} classical control, leaving it unclear whether a gain comes from the quantum substrate or from the architectural change that accompanies it.

By Chi-Sheng Chen, En-Jui Kuo
arXiv Machine Learning
Sep 25

Learning and interpreting policies for simultaneous entanglement requests in quantum networks

The paper presents a reinforcement‑learning approach to schedule link‑level entanglement in quantum networks, using a Markov Decision Process and double deep Q‑networks with message‑passing neural networks. The resulting policies achieve 100% success rates even when the link activation probability is reduced by up to 71% compared to baseline heuristics, and maintain at least 80% success when task placements are hardware‑restricted. The authors also develop metrics to interpret the learned policy and employ a large language model to generate a heuristic that matches the DQN performance, suggesting a scalable method for extracting interpretable strategies in large quantum networks.

By Leon Rode, Sumeet Khatri, Supartha Podder