Kernel-Weighted Aggregation for Hyperparameter-Free Quantum Federated Learning

Quantum federated learning (QFL) enables collaborative training of variational quantum circuits across decentralized clients, but client drift under non-IID data distributions degrades standard Federated Averaging (FedAvg). Existing aggregation methods either introduce tunable hyperparameters that depend on unknown data heterogeneity or incur structural costs such as order-dependent error propagation. We propose Kernel-Weighted Aggregation (KWA), a hyperparameter-free aggregation strategy that constructs a non-parametric kernel density estimate over the received client parameter vectors at each communication round. Clients in high-density regions receive greater voting power, and isolated clients are automatically attenuated. The kernel bandwidth is the median of all pairwise squared distances. We evaluate KWA against six state-of-the-art QFL methods and five classical robust baselines on five binary MNIST digit-pair tasks under IID, Dir(0.5), and Dir(0.1) distributions with a unified four-qubit benchmark. Under IID data, KWA recovers the performance of FedAvg. Under Dir(0.5), KWA attains the highest average accuracy (0.7120), followed by FedAvg (0.7093). The margin at N=4 clients is not statistically significant. It grows to +0.023 at N=16 in the client scaling experiment. Under this distribution, the five classical robust baselines also rank below FedAvg. Under Dir(0.1), KWA exceeds FedAvg by 0.028 on average, with a pooled paired t-test p=0.068. Larger-circuit and three-class experiments show that the advantage does not yet transfer consistently beyond the four-qubit binary setting. KWA thus provides a hyperparameter-free aggregation strategy that recovers FedAvg under IID conditions, adapts to client drift, and requires no manually tuned hyperparameters.