Quantum federated learning (QFL) combines the robust data processing of quantum computing with the privacy-preserving features of federated learning (FL). However, in large-scale wireless networks, optimizing sum-rate is crucial for unlocking the true potential of QFL, facilitating effective model sharing and aggregation as devices compete for limited bandwidth amid dynamic channel conditions and fluctuating power resources. This paper studies a novel sum-rate maximization problem within a muti-channel QFL framework, specifically designed for non-orthogonal multiple access (NOMA)-based large-scale wireless networks. We develop a sum-rate maximization problem by jointly considering quantum device’s channel selection and transmit power. Our formulated problem is a non-convex, mixed-integer non-linear programming (MINLP) challenge that remains non-deterministic polynomial time (NP)-hard even with specified channel selection parameters. The complexity of the problem motivates us to create an effective iterative optimization approach that utilizes the sophisticated quantum approximate optimization algorithm (QAOA) to derive high-quality approximate solutions. Additionally, our study presents the first theoretical exploration of QFL convergence properties under full device participation, rigorously analyzing real-world scenarios with nonconvex loss functions, diverse data distributions, and the effects of quantum shot noise. Extensive simulation results indicate that our multi-channel NOMA-based QFL framework enhances model training and convergence behavior, surpassing conventional algorithms in terms of accuracy and loss. Moreover, our quantum-centric joint optimization approach achieves more than a 100% increase in sum-rate while ensuring rapid convergence, significantly outperforming the state-of-the-arts.
Quantum federated learning (QFL) combines the robust data processing of quantum computing with the privacy-preserving features of federated learning (FL). However, in large-scale wireless networks, optimizing sum-rate is crucial for unlocking the true potential of QFL, facilitating effective model sharing and aggregation as devices compete for limited bandwidth amid dynamic channel conditions and fluctuating power resources. This paper studies a novel sum-rate maximization problem within a muti-channel QFL framework, specifically designed for non-orthogonal multiple access (NOMA)-based large-scale wireless networks. We develop a sum-rate maximization problem by jointly considering quantum device’s channel selection and transmit power. Our formulated problem is a non-convex, mixed-integer non-linear programming (MINLP) challenge that remains non-deterministic polynomial time (NP)-hard even with specified channel selection parameters. The complexity of the problem motivates us to create an effective iterative optimization approach that utilizes the sophisticated quantum approximate optimization algorithm (QAOA) to derive high-quality approximate solutions. Additionally, our study presents the first theoretical exploration of QFL convergence properties under full device participation, rigorously analyzing real-world scenarios with nonconvex loss functions, diverse data distributions, and the effects of quantum shot noise. Extensive simulation results indicate that our multi-channel NOMA-based QFL framework enhances model training and convergence behavior, surpassing conventional algorithms in terms of accuracy and loss. Moreover, our quantum-centric joint optimization approach achieves more than a 100% increase in sum-rate while ensuring rapid convergence, significantly outperforming the state-of-the-arts.
Quantum federated learning (QFL) combines the robust data processing of quantum computing with the privacy-preserving features of federated learning (FL). However, in large-scale wireless networks, optimizing sum-rate is crucial for unlocking the true potential of QFL, facilitating effective model sharing and aggregation as devices compete for limited bandwidth amid dynamic channel conditions and fluctuating power resources. This paper studies a novel sum-rate maximization problem within a muti-channel QFL framework, specifically designed for non-orthogonal multiple access (NOMA)-based large-scale wireless networks. We develop a sum-rate maximization problem by jointly considering quantum device's channel selection and transmit power. Our formulated problem is a non-convex, mixed-integer nonlinear programming (MINLP) challenge that remains non-deterministic polynomial time (NP)-hard even with specified channel selection parameters. The complexity of the problem motivates us to create an effective iterative optimization approach that utilizes the sophisticated quantum approximate optimization algorithm (QAOA) to derive high-quality approximate solutions. Additionally, our study presents the first theoretical exploration of QFL convergence properties under full device participation, rigorously analyzing real-world scenarios with nonconvex loss functions, diverse data distributions, and the effects of quantum shot noise. Extensive simulation results indicate that our multi-channel NOMA-based QFL framework enhances model training and convergence behavior, surpassing conventional algorithms in terms of accuracy and loss. Moreover, our quantum-centric joint optimization approach achieves more than a 100% increase in sum-rate while ensuring rapid convergence, significantly outperforming the state-of-the-arts.
This paper studies a novel energy-efficient quantum federated learning (QFL) framework designed for low-altitude quantum-enabled unmanned aerial vehicle (UAV) networks. We develop a novel energy minimization problem by jointly considering UAV’s quantum computing power, computational frequency, transmit power, number of quantum noise measurements, and trajectory. The energy minimization problem we formulate is inherently non-convex and cannot be efficiently solved using conventional convex optimization methods in its original form. To overcome this challenge, we develop an iterative optimization approach that integrates block coordinate descent (BCD) with successive convex approximation (SCA) techniques to effectively find optimal solutions for QFL’s energy optimization. Moreover, we conduct a holistic convergence analysis of federated quantum model training, which reveals the important trade-off between the convergence rate and number of quantum noise measurements. Evaluations under different data settings demonstrate that our theoretical results are consistent with QFL model training simulations, thereby facilitating future QFL algorithm design. Extensive simulation results also show that our optimization methodology significantly improves energy efficiency over baseline methods.
AI-native 6G networks are envisioned to tightly embed artificial intelligence (AI) into the wireless ecosystem, enabling real-time, personalized, and privacy-preserving intelligence at the edge. A foundational pillar of this vision is federated learning (FL), which allows distributed model training across devices without sharing raw data. However, implementing classical FL methods faces several bottlenecks in heterogeneous dynamic wireless networks, including limited device compute capacity, unreliable connectivity, intermittent communications, and vulnerability to model security and data privacy breaches. This article investigates the integration of quantum federated learning (QFL) into AI-native 6G networks, forming a transformative paradigm capable of overcoming these challenges. By leveraging quantum techniques across computing, communication, and cryptography within FL workflows, QFL offers new capabilities along three key dimensions: (i) edge intelligence, (ii) network optimization, and (iii) security and privacy, which are studied in this work. We further present a case study demonstrating that a QFL framework employing the quantum approximate optimization algorithm outperforms classical methods in model convergence. We conclude the paper by identifying practical challenges facing QFL deployment, such as quantum state fragility, incompatibility with classical protocols, and hardware constraints, and then outline key research directions toward its scalable real-world adoption.
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.
Abstract This paper addresses Quantum Federated Learning (QFL), an adaptation of classical federated learning for quantum computing that enables collaboration among multiple quantum devices. A significant challenge in QFL arises from non-independent and identically distributed (non-IID) data, primarily due to inherent variations in quantum devices and environments, which substantially degrades performance. To mitigate this, we propose novel QFL algorithms that employ weighted averaging and clustering-optimized averaging strategies. Specifically, Quantum Weighted Federated Averaging (QW-FedAvg) is introduced, which utilizes a model aggregation strategy combining quantum weighted averaging with a global data-sharing mechanism to reduce the impact of non-IID data. Building on this, we further propose the Quantum Federated Clustering-Optimized Averaging (QF-COA) algorithm. QF-COA enhances performance by selecting client-side training parameters that demonstrate superior efficacy through a clustering method, thereby further minimizing the adverse effects of non-IID data on model performance. Our models were trained and evaluated using the MNIST and Fashion-MNIST datasets. Simulation results demonstrate that the proposed algorithms improve accuracy by 2% to 5% in non-IID environments compared to traditional quantum federated averaging algorithms. Additionally, these advancements lead to enhanced communication efficiency and increased robustness. These improvements contribute to the greater generalization and adaptability of QFL frameworks, offering both theoretical insights and practical guidance for future research in the field. The source code is available at https://github.com/wang-lab-repository/qavg-gzq.git .
In the healthcare sector, the scarcity of data and privacy concerns present formidable challenges to the widespread adoption of machine learning. In the present-day scenario, Federated Learning (FL) emerges as a pivotal solution, fostering the rapid evolution of distributed machine learning paradigms while adeptly addressing the problem of data governance and privacy. It allows distributed clients to collaboratively train a global model by synchronizing their local updates without sharing private data. In recent years, federated learning and quantum computing have individually shown great promise to revolutionize various sectors, including healthcare, finance, and manufacturing, where privacy protection is paramount. In this article, we propose a communication-efficient Quantum Federated Learning (QFL) framework based on a variational circuit that enables clients to efficiently train and transmit quantum model parameters, thereby reducing communication rounds significantly and enhancing QFL performance using quantum natural gradient descent (QNGD) optimization. This paper demonstrates the feasibility of a QFL framework for predicting the presence of coronary heart disease, diagnosing whether a patient is suffering from diabetes or not, and differentiating malignant and benign cancer by distributing the UCI datasets unbalanced among healthcare institutions. The proposed framework has the potential to incorporate privacy, security, and the expedited processing of distributed data. QNGD outperformed classical GD by reducing communication rounds by a range of 5% to 60%. In addition to reducing the communication rounds by optimizing the QFL training algorithm and achieving quicker convergence, it also determines the important features regardless of the data imbalance among the clients.