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

IEICE Transactions on Communications

User Scheduling and Clustering for Distributed Antenna Network Using Quantum Computing

Keishi Hanakago, Ryo Takahashi, Takahiro Ohyama, Fumiyuki Adachi

Published Jul 23, 2023• 1 citation
Publisher

Abstract

In this study, an overloaded large-scale distributed antenna network is considered, for which the number of active users is larger than that of antennas distributed in a base station coverage area (called a cell). To avoid overload, users in each cell are divided into multiple user groups, and, to reduce the computational complexity required for multi-user multiple-input and multiple-output (MU-MIMO), users in each user group are grouped into multiple user clusters so that cluster-wise distributed MU-MIMO can be performed in parallel in each user group. However, as the network size increases, conventional computational methods may not be able to solve combinatorial optimization problems, such as user scheduling and user clustering, which are required for performing cluster-wise distributed MU-MIMO in a finite amount of time. In this study, we apply quantum computing to solve the combinatorial optimization problems of user scheduling and clustering for an overloaded distributed antenna network and propose a quantum computing-based user scheduling and clustering method. The results of computer simulations indicate that as the technology of quantum computers and their related algorithms evolves in the future, the proposed method can realize large-scale dense wireless systems and realize real-time optimization with a short optimization execution cycle.

DOI
10.1587/transcom.2023ebt0004

Related papers

QUBO Formulations of the Downlink MIMO Scheduling Problem in 5G Base Stations

Olli Apilo, Jorma Kilpi

Quantum computers can potentially solve large-scale combinatorial problems very efficiently when the problems are first converted into the quadratic unconstrained binary optimization (QUBO) format. Scheduling in fifth generation (5G) base stations is a practical combinatorial problem that cannot be solved optimally in real-time using classical computing. We formulate the downlink (DL) multiple-input multiple-output (MIMO) scheduling at 5G base stations as QUBO and analyze the QUBO formulation scalability with respect to the key system parameters. The single-user MIMO (SU-MIMO) QUBO formulation looks promising because the number of QUBO variables grows linearly while the problem search space grows exponentially with increasing number of users. Based on the simulation results, the suboptimal greedy algorithm for the SU-MIMO performs well with a high number of users and low bandwidth. A hybrid approach, where either a quantum solver or a suboptimal low-complexity classical algorithm is selected based on the system parameters, seems sensible in practice. This work paves the way for future quantum and quantum-inspired implementations of scheduling in cellular systems.

arXiv:2609.18580•Sep 16, 2026•0 citations

Antenna Weights Optimization Based on Filtered Variation Quantum Computing

Bao‐Zhu Guo, Jinge Guo, Yingtao Meng +4 more

Operators deploy large-scale array antennas on 5G base stations and set antenna weights to achieve beams with different angles and widths, enhancing 5G network coverage. Traditional antenna weight optimization is based on the user distribution characteristics of the network. Based on the user measurement reports, minimum drive tests, and engineering parameters, the antenna weight optimization determines the relative positions between hotspot areas with centralized user distribution and base station antennas. Then it calculates the antenna weights in the reverse direction. This method can achieve ideal results in optimizing single-cell antenna weights, but it is unsuitable for simultaneous optimization of multiple cells. Information technology is developing rapidly. 5G communication is evolving towards 6G communication, and the growth of network and business scale brings huge challenges to network optimization. Quantum computing is a new computing model that follows the laws of quantum mechanics. It has a computing speed advantage over classical computing and is expected to become a solution to communication network optimization. This paper presents an antenna weight optimization method based on the filter variational quantum matrix solver algorithm. The method utilizes the powerful solution space representation ability of qubits, and it is helpful to obtain better antenna weight optimization results or accelerate the optimization process.

International Conference on Ubiquitous Computing and Communications (IUCC)•Dec 20, 2024•0 citations

Quantum-Driven Optimization for Massive MIMO Wireless Communication: Toward 5G Advanced and 6G Spectral Efficiency

Loganathan Balaji, A. Dhanalakshm

Massive multiple-input multiple-output (MIMO) systems are a key enabling technology for 5G-Advanced and emerging 6G networks, yet their performance is fundamentally constrained by high-dimensional, non-convex optimization problems arising from beamforming, power allocation, and user scheduling under imperfect channel state information (CSI).This paper proposes a hybrid quantum-classical optimization framework that formulates discrete and continuous massive MIMO resource allocation problems using Quadratic Unconstrained Binary Optimization (QUBO) and variational quantum algorithms.Discrete beam selection is addressed using quantum annealing, while continuous power control and hybrid beamforming are refined using variational quantum circuits within a classical feedback loop.Simulation results demonstrate improvements in aggregate spectral efficiency, runtime scalability, and robustness under imperfect CSI compared to conventional ZF and WMMSE baselines.The benefits of using the proposed solution include scalable runtime performance with respect to larger numbers of antennas; thus, it highlights the potential of optimizing quantum-assisted technologies for the future of wireless networks based on realistic assumptions regarding near-term NISQ-era performance.

Journal of Engineering Science and Technology Review•Apr 1, 2026•0 citations

Quantum Computing for Optimization Problems

Immanuvel C, Dr.M.Mohanapriya

Cluster computing is a distributed computing paradigm that integrates multiple independent computers, known as nodes, into a unified system to achieve high performance, scalability, and reliability. These nodes are interconnected through high-speed networks and coordinated using specialized software to execute tasks efficiently. The primary objective of cluster computing is to enhance computational power by enabling parallel processing, where large and complex problems are divided into smaller sub-tasks and processed simultaneously across multiple machines. This approach significantly reduces execution time and improves system efficiency compared to traditional single-system computing. Cluster computing also offers fault tolerance, ensuring continuous operation even if one or more nodes fail, thereby increasing system reliability. It is widely applied in areas such as scientific simulations, big data analytics, artificial intelligence, and cloud computing environments. Furthermore, cluster systems are cost-effective, as they utilize commodity hardware instead of expensive supercomputers. With advancements in networking and distributed system technologies, cluster computing has become a critical solution for handling large-scale computational demands. Overall, it provides a flexible and efficient framework for organizations to process vast amounts of data while maintaining performance, availability, and scalability in modern computing applications.

•Mar 11, 2026•0 citations

Quantum Deep Learning for Massive MIMO User Scheduling

Xingyu Huang, Ruining Fan, Mouli Chakraborty +2 more

We introduce a hybrid Quantum Neural Networks (QNN) architecture for the efficient user scheduling in 5G/Beyond 5G (B5G) massive Multiple Input Multiple Output (MIMO) systems, addressing the scalability issues of traditional methods. By leveraging statistical Channel State Information (CSI), our model reduces computational overhead and enhances spectral efficiency. It integrates classical neural networks with a variational quantum circuit kernel, outperforming classical Convolutional Neural Networks (CNN) and maintaining robust performance in noisy channels. This demonstrates the potential of quantum-enhanced Machine Learning (ML) for wireless scheduling.

arXiv:2508.03327•IEEE Vehicular Technology Conference•Oct 19, 2025•1 citation

Quantum Machine Learning for Optimal Antenna Placement

Masoud Salmani Arani, Reza Shahidi, Lihong Zhang

This work presents a novel framework combining quantum computing and machine learning to optimize base antenna station placement in$5 \mathrm{G} / 6 \mathrm{G}$networks. Initially, spectral clustering is employed to identify dense population areas, providing initial antenna locations. The problem is then reformulated as a Maximum Independent Set (MIS) problem in graph theory to address overlapping coverage constraints. Neutral atom representations of the potential antenna sites are constructed, and the Rydberg Blockade property is utilized to optimize spatial configurations. Using the QuTiP quantum simulator, this method effectively solves the MIS problem, achieving 85% household coverage with the minimum possible number of antenna stations.

Digest - IEEE Antennas and Propagation Society. International Symposium•Jul 13, 2025•0 citations
In this study, an overloaded large-scale distributed antenna network is considered, for which the number of active users is larger than that of antennas distributed in a base station coverage area (called a cell). To avoid overload, users in each cell are divided into multiple user groups, and, to reduce the computational complexity required for multi-user multiple-input and multiple-output (MU-MIMO), users in each user group are grouped into multiple user clusters so that cluster-wise distributed MU-MIMO can be performed in parallel in each user group. However, as the network size increases, conventional computational methods may not be able to solve combinatorial optimization problems, such as user scheduling and user clustering, which are required for performing cluster-wise distributed MU-MIMO in a finite amount of time. In this study, we apply quantum computing to solve the combinatorial optimization problems of user scheduling and clustering for an overloaded distributed antenna network and propose a quantum computing-based user scheduling and clustering method. The results of computer simulations indicate that as the technology of quantum computers and their related algorithms evolves in the future, the proposed method can realize large-scale dense wireless systems and realize real-time optimization with a short optimization execution cycle.
Quantum computers can potentially solve large-scale combinatorial problems very efficiently when the problems are first converted into the quadratic unconstrained binary optimization (QUBO) format. Scheduling in fifth generation (5G) base stations is a practical combinatorial problem that cannot be solved optimally in real-time using classical computing. We formulate the downlink (DL) multiple-input multiple-output (MIMO) scheduling at 5G base stations as QUBO and analyze the QUBO formulation scalability with respect to the key system parameters. The single-user MIMO (SU-MIMO) QUBO formulation looks promising because the number of QUBO variables grows linearly while the problem search space grows exponentially with increasing number of users. Based on the simulation results, the suboptimal greedy algorithm for the SU-MIMO performs well with a high number of users and low bandwidth. A hybrid approach, where either a quantum solver or a suboptimal low-complexity classical algorithm is selected based on the system parameters, seems sensible in practice. This work paves the way for future quantum and quantum-inspired implementations of scheduling in cellular systems.
Operators deploy large-scale array antennas on 5G base stations and set antenna weights to achieve beams with different angles and widths, enhancing 5G network coverage. Traditional antenna weight optimization is based on the user distribution characteristics of the network. Based on the user measurement reports, minimum drive tests, and engineering parameters, the antenna weight optimization determines the relative positions between hotspot areas with centralized user distribution and base station antennas. Then it calculates the antenna weights in the reverse direction. This method can achieve ideal results in optimizing single-cell antenna weights, but it is unsuitable for simultaneous optimization of multiple cells. Information technology is developing rapidly. 5G communication is evolving towards 6G communication, and the growth of network and business scale brings huge challenges to network optimization. Quantum computing is a new computing model that follows the laws of quantum mechanics. It has a computing speed advantage over classical computing and is expected to become a solution to communication network optimization. This paper presents an antenna weight optimization method based on the filter variational quantum matrix solver algorithm. The method utilizes the powerful solution space representation ability of qubits, and it is helpful to obtain better antenna weight optimization results or accelerate the optimization process.
Massive multiple-input multiple-output (MIMO) systems are a key enabling technology for 5G-Advanced and emerging 6G networks, yet their performance is fundamentally constrained by high-dimensional, non-convex optimization problems arising from beamforming, power allocation, and user scheduling under imperfect channel state information (CSI).This paper proposes a hybrid quantum-classical optimization framework that formulates discrete and continuous massive MIMO resource allocation problems using Quadratic Unconstrained Binary Optimization (QUBO) and variational quantum algorithms.Discrete beam selection is addressed using quantum annealing, while continuous power control and hybrid beamforming are refined using variational quantum circuits within a classical feedback loop.Simulation results demonstrate improvements in aggregate spectral efficiency, runtime scalability, and robustness under imperfect CSI compared to conventional ZF and WMMSE baselines.The benefits of using the proposed solution include scalable runtime performance with respect to larger numbers of antennas; thus, it highlights the potential of optimizing quantum-assisted technologies for the future of wireless networks based on realistic assumptions regarding near-term NISQ-era performance.
Cluster computing is a distributed computing paradigm that integrates multiple independent computers, known as nodes, into a unified system to achieve high performance, scalability, and reliability. These nodes are interconnected through high-speed networks and coordinated using specialized software to execute tasks efficiently. The primary objective of cluster computing is to enhance computational power by enabling parallel processing, where large and complex problems are divided into smaller sub-tasks and processed simultaneously across multiple machines. This approach significantly reduces execution time and improves system efficiency compared to traditional single-system computing. Cluster computing also offers fault tolerance, ensuring continuous operation even if one or more nodes fail, thereby increasing system reliability. It is widely applied in areas such as scientific simulations, big data analytics, artificial intelligence, and cloud computing environments. Furthermore, cluster systems are cost-effective, as they utilize commodity hardware instead of expensive supercomputers. With advancements in networking and distributed system technologies, cluster computing has become a critical solution for handling large-scale computational demands. Overall, it provides a flexible and efficient framework for organizations to process vast amounts of data while maintaining performance, availability, and scalability in modern computing applications.
We introduce a hybrid Quantum Neural Networks (QNN) architecture for the efficient user scheduling in 5G/Beyond 5G (B5G) massive Multiple Input Multiple Output (MIMO) systems, addressing the scalability issues of traditional methods. By leveraging statistical Channel State Information (CSI), our model reduces computational overhead and enhances spectral efficiency. It integrates classical neural networks with a variational quantum circuit kernel, outperforming classical Convolutional Neural Networks (CNN) and maintaining robust performance in noisy channels. This demonstrates the potential of quantum-enhanced Machine Learning (ML) for wireless scheduling.
This work presents a novel framework combining quantum computing and machine learning to optimize base antenna station placement in5G/6G5 \mathrm{G} / 6 \mathrm{G}5G/6Gnetworks. Initially, spectral clustering is employed to identify dense population areas, providing initial antenna locations. The problem is then reformulated as a Maximum Independent Set (MIS) problem in graph theory to address overlapping coverage constraints. Neutral atom representations of the potential antenna sites are constructed, and the Rydberg Blockade property is utilized to optimize spatial configurations. Using the QuTiP quantum simulator, this method effectively solves the MIS problem, achieving 85% household coverage with the minimum possible number of antenna stations.