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

arXiv:2310.12389 · Globecom

Quantum Computing for MIMO Beam Selection Problem: Model and Optical Experimental Solution

Yühong Huang, Wenxin Li, Chengkang Pan, Shuai Hou, Xian Ping Lu, Chunfeng Cui, Jingwei Wen, Jiaqi Xu, Chongyu Cao, Yin Ma, Hai Wei, Kai Wen

Published Dec 4, 2023• 14 citations
arXivHTMLPDF

Abstract

Massive multiple-input multiple-output (MIMO) has gained widespread popularity in recent years due to its ability to increase data rates, improve signal quality, and provide better coverage in challenging environments. In this paper, we investigate the MIMO beam selection (MBS) problem, which is proven to be NP-hard and computationally intractable. To deal with this problem, quantum computing that can provide faster and more efficient solutions to large-scale combinatorial optimization is considered. MBS is formulated in a quadratic unbounded binary optimization form and solved with Coherent Ising Machine (CIM) physical machine. We compare the performance of our solution with two classic heuristics, simulated annealing and Tabu search. The results demonstrate an average performance improvement by a factor of 261.23 and 20.6, respectively, which shows that CIM-based solution performs significantly better in terms of selecting the optimal subset of beams. This work shows great promise for practical 5G operation and promotes the application of quantum computing in solving computationally hard problems in communication.

DOI
10.1109/globecom54140.2023.10436892

Related papers

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

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

Quantum Computing for Transport Network Optimization

Jiangwei Ju, Zhihang Liu, Yuelin Bai +5 more

Public transport systems play a crucial role in the development of large cities. Bus network design to optimize passenger flow coverage in a global metropolis is a challenging task. As an essential part of bus travel planning, considering the bus transfer factor in the existing extremely complex and extensive public bus network usually leads to a optimization problem characterized by high-dimensionality and non-linearity. While classical computers struggle to deal with this kind of problems, quantum computers shed new light into this field. The coherent Ising machine (CIM), a specialized optical quantum computer using a photonic dissipative architecture, has shown its remarkable computational power in combinatorial optimization problems. We construct the classical model and the quadratic unconstrained binary optimization (QUBO) model of the bus route optimization problem, and solve it using a classical computer and CIM, respectively. Our experimental results demonstrate the significant acceleration capability of CIM over classical computers in finding the optimal or near-optimal solutions, albeit subject to the hardware limitations of the 100-qubit CIM.

Entropy•Sep 13, 2025•5 citations

Application of High-Speed Ising Machine based Optimization to Wireless Resource Allocation Problems

Jialu Xing, Jin Nakazato, Maki Arai +3 more

The widespread deployment of 5G networks has drawn growing attention to the optimization of wireless communication systems. Among various techniques, quantum-based approaches are distinguished by their remarkably fast computation time compared to conventional optimization methods. In this paper, we propose a quantum-inspired approach to the wireless resource allocation problem. The problem is formulated as an Ising model and solved using both Coherent Ising Machine (CIM) and D-Wave’s quantum annealer. Furthermore, the performance of these quantum-based methods is compared with that of the Simulated Annealing (SA) algorithm.

IEEE Consumer Communications and Networking Conference•Jan 1, 2026•0 citations

Quantum computing for loan portfolio pricing optimization

Yanbo J. Wang, Xuan Yang, Chao Ju +8 more

For complex optimization problems in the financial services industry, specialized quantum computer can server as a transformative tool. Focusing on loan portfolio pricing optimization, we demonstrate the application potentials and advantages of quantum computing in financial optimization problems. For the first time, the loan portfolio pricing problem is modeled as a Quadratic Unconstrained Binary Optimization (QUBO) problem, and then solved by a specialized quantum computer, Coherent Ising Machine (CIM) based on optical dissipative systems. By introducing an auxiliary qubit and conducting a two-stage search for the appropriate penalty coefficients, we demonstrate the applicability and advantages of CIM in the loan portfolio pricing optimization problem. The experimental results demonstrate that compared to state-of-the-art classical solvers, CIM achieves significant acceleration capability and energy efficiency beyond classical methods. Furthermore, by conducting numerical and analytical evaluations of CIM’s scalability in the loan portfolio pricing optimization, we demonstrate the convergence guarantees of CIM and its ability to achieve a better solution quality than the state-of-the-art classical solver in large-scale problems.

Frontiers in Physics•Jun 4, 2026•0 citations

Leverage Quantum Computing and Artificial Intelligence for Complex Problem Resolution: Innovative Optimization Framework

Suresh Kumar Pithani, Hebatullah Awwad, J Lethisia Nithiya +3 more

Optimization problems that are computationally intractable can be tackled with the help of AI and quantum computing. Standard optimization techniques are ill-equipped to deal with high-dimensional search spaces and non-linear constraints in domains such as logistics, finance, energy management, pharmaceutical research, and large-scale industrial scheduling. Using quantum computing with AI-driven learning, this research presents a hybrid optimization strategy that enhances the efficiency and accuracy of problem-solving. Adaptive optimization, parameter changes, and pattern discovery are all part of machine learning models, whereas quantum annealing and variational quantum eigen solvers simultaneously explore massive solution spaces. The proposed method uses quantum probabilistic computation and heuristic refining based on AI to reduce computational complexity and speed up the convergence of global optimums. While quantum computers optimize computationally expensively at the quantum-classical interface, deep learning models preprocess and extract features. Compared to metaheuristics, simulation-based performance analysis improves both the quality of solutions and the speed of convergence. The study demonstrated that AI frameworks boosted with quantum computing may solve combinatorial optimization problems and NP-hard problems. Using a computational paradigm that is both scalable and future-proof, this work reimagines optimization in the scientific, industrial, and engineering spheres.

International Conference on Intelligent Computing (ICONIC)•Mar 27, 2026•0 citations
Massive multiple-input multiple-output (MIMO) has gained widespread popularity in recent years due to its ability to increase data rates, improve signal quality, and provide better coverage in challenging environments. In this paper, we investigate the MIMO beam selection (MBS) problem, which is proven to be NP-hard and computationally intractable. To deal with this problem, quantum computing that can provide faster and more efficient solutions to large-scale combinatorial optimization is considered. MBS is formulated in a quadratic unbounded binary optimization form and solved with Coherent Ising Machine (CIM) physical machine. We compare the performance of our solution with two classic heuristics, simulated annealing and Tabu search. The results demonstrate an average performance improvement by a factor of 261.23 and 20.6, respectively, which shows that CIM-based solution performs significantly better in terms of selecting the optimal subset of beams. This work shows great promise for practical 5G operation and promotes the application of quantum computing in solving computationally hard problems in communication.
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.
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.
Public transport systems play a crucial role in the development of large cities. Bus network design to optimize passenger flow coverage in a global metropolis is a challenging task. As an essential part of bus travel planning, considering the bus transfer factor in the existing extremely complex and extensive public bus network usually leads to a optimization problem characterized by high-dimensionality and non-linearity. While classical computers struggle to deal with this kind of problems, quantum computers shed new light into this field. The coherent Ising machine (CIM), a specialized optical quantum computer using a photonic dissipative architecture, has shown its remarkable computational power in combinatorial optimization problems. We construct the classical model and the quadratic unconstrained binary optimization (QUBO) model of the bus route optimization problem, and solve it using a classical computer and CIM, respectively. Our experimental results demonstrate the significant acceleration capability of CIM over classical computers in finding the optimal or near-optimal solutions, albeit subject to the hardware limitations of the 100-qubit CIM.
The widespread deployment of 5G networks has drawn growing attention to the optimization of wireless communication systems. Among various techniques, quantum-based approaches are distinguished by their remarkably fast computation time compared to conventional optimization methods. In this paper, we propose a quantum-inspired approach to the wireless resource allocation problem. The problem is formulated as an Ising model and solved using both Coherent Ising Machine (CIM) and D-Wave’s quantum annealer. Furthermore, the performance of these quantum-based methods is compared with that of the Simulated Annealing (SA) algorithm.
For complex optimization problems in the financial services industry, specialized quantum computer can server as a transformative tool. Focusing on loan portfolio pricing optimization, we demonstrate the application potentials and advantages of quantum computing in financial optimization problems. For the first time, the loan portfolio pricing problem is modeled as a Quadratic Unconstrained Binary Optimization (QUBO) problem, and then solved by a specialized quantum computer, Coherent Ising Machine (CIM) based on optical dissipative systems. By introducing an auxiliary qubit and conducting a two-stage search for the appropriate penalty coefficients, we demonstrate the applicability and advantages of CIM in the loan portfolio pricing optimization problem. The experimental results demonstrate that compared to state-of-the-art classical solvers, CIM achieves significant acceleration capability and energy efficiency beyond classical methods. Furthermore, by conducting numerical and analytical evaluations of CIM’s scalability in the loan portfolio pricing optimization, we demonstrate the convergence guarantees of CIM and its ability to achieve a better solution quality than the state-of-the-art classical solver in large-scale problems.
Optimization problems that are computationally intractable can be tackled with the help of AI and quantum computing. Standard optimization techniques are ill-equipped to deal with high-dimensional search spaces and non-linear constraints in domains such as logistics, finance, energy management, pharmaceutical research, and large-scale industrial scheduling. Using quantum computing with AI-driven learning, this research presents a hybrid optimization strategy that enhances the efficiency and accuracy of problem-solving. Adaptive optimization, parameter changes, and pattern discovery are all part of machine learning models, whereas quantum annealing and variational quantum eigen solvers simultaneously explore massive solution spaces. The proposed method uses quantum probabilistic computation and heuristic refining based on AI to reduce computational complexity and speed up the convergence of global optimums. While quantum computers optimize computationally expensively at the quantum-classical interface, deep learning models preprocess and extract features. Compared to metaheuristics, simulation-based performance analysis improves both the quality of solutions and the speed of convergence. The study demonstrated that AI frameworks boosted with quantum computing may solve combinatorial optimization problems and NP-hard problems. Using a computational paradigm that is both scalable and future-proof, this work reimagines optimization in the scientific, industrial, and engineering spheres.