Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Quantum Artificial Intelligence

Federated Quantum Machine Learning with Privacy-Preserving Measurement Statistics for Edge Analytics

Muhammad Iqbal

Published Aug 31, 2026• 0 citations
Publisher

Abstract

Edge analytics requires continuous model adaptation under tight latency, bandwidth, and confidentiality constraints, yet conventional federated learning can leak sensitive information through shared updates and often struggles under non-IID client data. This study introduces Federated Quantum Machine Learning that transmits privacy-preserving measurement statistics derived from hybrid parameterized quantum circuits rather than raw samples or high-dimensional gradients. Across 50 edge clients over 20 rounds, the proposed method achieves 0.844 accuracy and 0.836 macro-F1 with ECE 0.048, outperforming a classical FedAvg baseline (0.801 accuracy, 0.788 macro-F1, ECE 0.062) while maintaining predictable edge overhead (845 ms average round latency) and compact messaging (3.1 KB average payload per round). Privacy–measurement sweeps demonstrate accuracy saturation with increasing privacy budget, improving from 0.816 at ε = 0.5 to 0.856 at ε = 8.0 under 512 shots, while calibration improves more sharply, with ECE decreasing from 0.068 to 0.046 over the same range. Increasing shot budget from 128 to 2048 consistently increases accuracy under all privacy settings, confirming that measurement variance is a controllable bottleneck for protected learning. Communication analysis shows that statistics-only messaging remains an order of magnitude smaller than gradient-style baselines (33.9 KB average payload per round), and secure aggregation adds bounded overhead (4.8 KB average payload) with a modest utility shift (0.836 accuracy, ECE 0.051). Robustness experiments under severe non-IID drift (severity 0.9) preserve macro-F1 at 0.801 with expectation-based statistics versus 0.772 for histogram-based statistics, and perturbed-client tests show improved stability with robust aggregation, sustaining 0.836 accuracy at 10% perturbed participation compared to 0.824 under naïve aggregation. These results indicate that low-dimensional, privatized measurement summaries enable practical, reliable, and privacy-aligned federated quantum learning on constrained edge infrastructures.

DOI
10.63913/jqai.v1i2.12

Related papers

Quantum-Guided Federated Transformers for Privacy–Preserving Large-Scale Analytics

D. Jayasutha

The proliferation of large-scale analytics across distributed edge–cloud environments has raised critical challenges related to data privacy, communication overhead, and computational efficiency. To address these issues, this paper proposes a Quantum-Guided Federated Transformer (QGFT) framework for privacy-preserving large-scale analytics, integrating quantum-inspired optimization with federated transformer learning. In the proposed model, a quantum-guided variational optimizer leverages superposition-driven exploration and entanglement-inspired correlation modeling to adaptively optimize transformer attention weights during decentralized training, without sharing raw data. Federated aggregation is enhanced using privacy-aware adaptive parameter fusion, enabling robust convergence under heterogeneous and non-IID client data distributions. Extensive evaluations conducted on large-scale benchmark datasets demonstrate that QGFT achieves a 3.8–6.4% improvement in analytics accuracy, a 28–35% reduction in communication overhead, and a 22–31% faster convergence rate compared to conventional federated transformer and Fed Avg-based approaches. Furthermore, the integration of quantum-guided optimization improves model generalization by 18.6% under high data heterogeneity. Differential privacy analysis confirms that the proposed framework maintains a privacy leakage probability below 10⁻⁶, satisfying stringent regulatory requirements. These results indicate that QGFT provides a scalable, secure, and efficient solution for next-generation privacy-preserving analytics in federated edge–cloud intelligence. The framework enhances the confidentiality of data during the collaborating process of different nodes while preserving the accuracy of the models across multiple resources. In addition, QGFT is adaptable to all types of edge devices, thus enabling intelligent distributed systems to use Privacy-Aware systems.

CompSci & AI Advances•Jul 29, 2025•0 citations

Kernel-Weighted Aggregation for Hyperparameter-Free Quantum Federated Learning

Rui Huang

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.

Entropy•Aug 26, 2026•0 citations

Quantum Machine Learning-aided Personalized Federated Learning for Big Data

Nguyen Doan Hieu, Nguyen Xuan Tung, Joon-Ho Kwon +1 more

Federated learning (FL) has emerged as a compelling paradigm for big-data analytics, enabling collaborative training of a global model across distributed mobile or edge devices without centralizing raw data. Yet conventional FL is challenged by model drift under statistical heterogeneity and by the limited computational budgets of client devices, which together hinder convergence and scalability-particularly when the i.i.d. assumption is violated. To address these limitations, we propose a personalized quantum federated learning (QFL) framework that combines quantum machine learning with distributed optimization to deliver client-specific adaptation atop a compact shared representation. Empirically, our method outperforms state-of-the-art baselines on non-IID workloads while reducing computational complexity through a smaller set of trainable parameters.

IEEE International Conference on Big Data and Smart Computing (BigComp)•Feb 2, 2026•0 citations

Hybrid Quantum-Classical Computing for Privacy-Preserving Machine Learning on Edge Devices

B. Dinesh, M. Thangamani, B. Paulchamy +3 more

The edge computing environment faces a challenge in maintaining data privacy while performing machine learning tasks. The current solutions for privacy preservation are inefficient or do not provide security guarantees, causing a critical gap in the edge computing environment, which is resource-constrained. The aim of this research work is to design a hybrid quantum-classical computing system that addresses the challenges of privacy preservation and efficiency in machine learning tasks. We design a novel architecture combining variational quantum circuits for secure data encoding with classical neural networks for scalable inference, implemented through federated learning protocols enhanced with quantum differential privacy mechanisms. Experimental evaluation demonstrates a 35% reduction in communication overhead compared to traditional federated learning approaches while maintaining 99.2% classification accuracy across diverse datasets. The quantum-enhanced privacy mechanisms achieve provable security guarantees with information-theoretic bounds, outperforming conventional cryptographic methods by 28% in computational overhead reduction. This hybrid approach establishes a new paradigm for secure and efficient machine learning deployment on edge devices, enabling privacy-preserving artificial intelligence in healthcare, finance, and IoT applications.

IEEE International Conference on Emerging Computing and Intelligent Technologies (ICoECIT)•Jan 28, 2026•0 citations

FEDCOMPASS: Federated Clustered and Periodic Aggregation Framework for Hybrid Classical-Quantum Models

Yue Wang, Xing He, Zinuo Cai +4 more

Federated learning enables collaborative model training across decentralized clients under privacy constraints. Quantum computing offers potential for alleviating computational and communication burdens in federated learning, yet hybrid classical-quantum federated learning remains susceptible to performance degradation under non-IID data. To address this, we propose FEDCOMPASS, a layered aggregation framework for hybrid classical-quantum federated learning. FEDCOMPASS employs spectral clustering to group clients by class distribution similarity and performs cluster-wise aggregation for classical feature extractors. For quantum parameters, it uses circular mean aggregation combined with adaptive optimization to ensure stable global updates. Experiments on three benchmark datasets show that FEDCOMPASS improves test accuracy by up to 10.22% and enhances convergence stability under non-IID settings, outperforming six strong federated learning baselines.

arXiv:2602.03052•IEEE International Conference on Acoustics Speech and Signal Processing•Apr 21, 2026•2 citations

Quantum Federated Learning: Bridging Quantum Computing and Distributed AI

Tariq Qayyum, Manzoor Ahmed Khan, Asadullah Tariq +4 more

In recent years, the growing demand for secure, efficient, and scalable machine learning has highlighted significant challenges in traditional Federated Learning (FL) systems. These challenges include computational inefficiencies in handling large-scale, high-dimensional data, privacy concerns, and the limitations of classical hardware in solving complex optimization problems. Additionally, the increasing complexity of data and the need for more robust privacy-preserving methods have pushed the boundaries of classical FL. To address these issues, this paper presents a detailed framework for Quantum Federated Learning (QFL), where quantum computing and FL converge to enable distributed quantum model training with enhanced privacy preservation. The system is modeled using local quantum models on clients and a global aggregation strategy at the server. We develop quantum gradient-based optimization with quantum cross-entropy loss, privacy preservation through encryption, and robustness to quantum noise. A set of theorems is provided to prove the correctness and efficiency of the model, supported by rigorous mathematical formulations. We used IBM Qiskit for the simulation and compared our proposed QFL with classical FL. The results demonstrate that our QFL outperformed classical FL in terms of accuracy, precision, recall, and F1 score.

IEEE/ACM International Conference on Utility and Cloud Computing (UCC)•Dec 16, 2024•6 citations
Edge analytics requires continuous model adaptation under tight latency, bandwidth, and confidentiality constraints, yet conventional federated learning can leak sensitive information through shared updates and often struggles under non-IID client data. This study introduces Federated Quantum Machine Learning that transmits privacy-preserving measurement statistics derived from hybrid parameterized quantum circuits rather than raw samples or high-dimensional gradients. Across 50 edge clients over 20 rounds, the proposed method achieves 0.844 accuracy and 0.836 macro-F1 with ECE 0.048, outperforming a classical FedAvg baseline (0.801 accuracy, 0.788 macro-F1, ECE 0.062) while maintaining predictable edge overhead (845 ms average round latency) and compact messaging (3.1 KB average payload per round). Privacy–measurement sweeps demonstrate accuracy saturation with increasing privacy budget, improving from 0.816 at ε = 0.5 to 0.856 at ε = 8.0 under 512 shots, while calibration improves more sharply, with ECE decreasing from 0.068 to 0.046 over the same range. Increasing shot budget from 128 to 2048 consistently increases accuracy under all privacy settings, confirming that measurement variance is a controllable bottleneck for protected learning. Communication analysis shows that statistics-only messaging remains an order of magnitude smaller than gradient-style baselines (33.9 KB average payload per round), and secure aggregation adds bounded overhead (4.8 KB average payload) with a modest utility shift (0.836 accuracy, ECE 0.051). Robustness experiments under severe non-IID drift (severity 0.9) preserve macro-F1 at 0.801 with expectation-based statistics versus 0.772 for histogram-based statistics, and perturbed-client tests show improved stability with robust aggregation, sustaining 0.836 accuracy at 10% perturbed participation compared to 0.824 under naïve aggregation. These results indicate that low-dimensional, privatized measurement summaries enable practical, reliable, and privacy-aligned federated quantum learning on constrained edge infrastructures.
The proliferation of large-scale analytics across distributed edge–cloud environments has raised critical challenges related to data privacy, communication overhead, and computational efficiency. To address these issues, this paper proposes a Quantum-Guided Federated Transformer (QGFT) framework for privacy-preserving large-scale analytics, integrating quantum-inspired optimization with federated transformer learning. In the proposed model, a quantum-guided variational optimizer leverages superposition-driven exploration and entanglement-inspired correlation modeling to adaptively optimize transformer attention weights during decentralized training, without sharing raw data. Federated aggregation is enhanced using privacy-aware adaptive parameter fusion, enabling robust convergence under heterogeneous and non-IID client data distributions. Extensive evaluations conducted on large-scale benchmark datasets demonstrate that QGFT achieves a 3.8–6.4% improvement in analytics accuracy, a 28–35% reduction in communication overhead, and a 22–31% faster convergence rate compared to conventional federated transformer and Fed Avg-based approaches. Furthermore, the integration of quantum-guided optimization improves model generalization by 18.6% under high data heterogeneity. Differential privacy analysis confirms that the proposed framework maintains a privacy leakage probability below 10⁻⁶, satisfying stringent regulatory requirements. These results indicate that QGFT provides a scalable, secure, and efficient solution for next-generation privacy-preserving analytics in federated edge–cloud intelligence. The framework enhances the confidentiality of data during the collaborating process of different nodes while preserving the accuracy of the models across multiple resources. In addition, QGFT is adaptable to all types of edge devices, thus enabling intelligent distributed systems to use Privacy-Aware systems.
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.
Federated learning (FL) has emerged as a compelling paradigm for big-data analytics, enabling collaborative training of a global model across distributed mobile or edge devices without centralizing raw data. Yet conventional FL is challenged by model drift under statistical heterogeneity and by the limited computational budgets of client devices, which together hinder convergence and scalability-particularly when the i.i.d. assumption is violated. To address these limitations, we propose a personalized quantum federated learning (QFL) framework that combines quantum machine learning with distributed optimization to deliver client-specific adaptation atop a compact shared representation. Empirically, our method outperforms state-of-the-art baselines on non-IID workloads while reducing computational complexity through a smaller set of trainable parameters.
The edge computing environment faces a challenge in maintaining data privacy while performing machine learning tasks. The current solutions for privacy preservation are inefficient or do not provide security guarantees, causing a critical gap in the edge computing environment, which is resource-constrained. The aim of this research work is to design a hybrid quantum-classical computing system that addresses the challenges of privacy preservation and efficiency in machine learning tasks. We design a novel architecture combining variational quantum circuits for secure data encoding with classical neural networks for scalable inference, implemented through federated learning protocols enhanced with quantum differential privacy mechanisms. Experimental evaluation demonstrates a 35% reduction in communication overhead compared to traditional federated learning approaches while maintaining 99.2% classification accuracy across diverse datasets. The quantum-enhanced privacy mechanisms achieve provable security guarantees with information-theoretic bounds, outperforming conventional cryptographic methods by 28% in computational overhead reduction. This hybrid approach establishes a new paradigm for secure and efficient machine learning deployment on edge devices, enabling privacy-preserving artificial intelligence in healthcare, finance, and IoT applications.
Federated learning enables collaborative model training across decentralized clients under privacy constraints. Quantum computing offers potential for alleviating computational and communication burdens in federated learning, yet hybrid classical-quantum federated learning remains susceptible to performance degradation under non-IID data. To address this, we propose FEDCOMPASS, a layered aggregation framework for hybrid classical-quantum federated learning. FEDCOMPASS employs spectral clustering to group clients by class distribution similarity and performs cluster-wise aggregation for classical feature extractors. For quantum parameters, it uses circular mean aggregation combined with adaptive optimization to ensure stable global updates. Experiments on three benchmark datasets show that FEDCOMPASS improves test accuracy by up to 10.22% and enhances convergence stability under non-IID settings, outperforming six strong federated learning baselines.
In recent years, the growing demand for secure, efficient, and scalable machine learning has highlighted significant challenges in traditional Federated Learning (FL) systems. These challenges include computational inefficiencies in handling large-scale, high-dimensional data, privacy concerns, and the limitations of classical hardware in solving complex optimization problems. Additionally, the increasing complexity of data and the need for more robust privacy-preserving methods have pushed the boundaries of classical FL. To address these issues, this paper presents a detailed framework for Quantum Federated Learning (QFL), where quantum computing and FL converge to enable distributed quantum model training with enhanced privacy preservation. The system is modeled using local quantum models on clients and a global aggregation strategy at the server. We develop quantum gradient-based optimization with quantum cross-entropy loss, privacy preservation through encryption, and robustness to quantum noise. A set of theorems is provided to prove the correctness and efficiency of the model, supported by rigorous mathematical formulations. We used IBM Qiskit for the simulation and compared our proposed QFL with classical FL. The results demonstrate that our QFL outperformed classical FL in terms of accuracy, precision, recall, and F1 score.