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

IEEE Consumer Communications and Networking Conference

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

Jialu Xing, Jin Nakazato, Maki Arai, Hiroki Takesue, Kazuyuki Aihara, Mikio Hasegawa

Published Jan 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/ccnc65079.2026.11366461

Related papers

Optimization by Neural Networks in the Coherent Ising Machine and its Application to Wireless Communication Systems

Mikio Hasegawa, Hirotake Ito, Hiroki Takesue +1 more

Recently, new optimization machines based on non-silicon physical systems, such as quantum annealing machines, have been developed, and their commercialization has been started. These machines solve the problems by searching the state of the Ising spins, which minimizes the Ising Hamiltonian. Such a property of minimization of the Ising Hamiltonian can be applied to various combinatorial optimization problems. In this paper, we introduce the coherent Ising machine (CIM), which can solve the problems in a milli-second order, and has higher performance than the quantum annealing machines especially on the problems with dense mutual connections in the corresponding Ising model. We explain how a target problem can be implemented on the CIM, based on the optimization scheme using the mutually connected neural networks. We apply the CIM to traveling salesman problems as an example benchmark, and show experimental results of the real machine of the CIM. We also apply the CIM to several combinatorial optimization problems in wireless communication systems, such as channel assignment problems. The CIM's ultra-fast optimization may enable a real-time optimization of various communication systems even in a dynamic communication environment.

IEICE Transactions on Communications•Aug 31, 2020•31 citations

Hybrid Optimization Method Using Simulated-Annealing-Based Ising Machine and Quantum Annealer

Shuta Kikuchi, Nozomu Togawa, Shu Tanaka

Ising machines have the potential to realize fast and highly accurate solvers for combinatorial optimization problems. They are classified based on their internal algorithms. Examples include simulated-annealing-based Ising machines (non-quantum-type Ising machines) and quantum-annealing-based Ising machines (quantum annealers). Herein we propose a hybrid optimization method, which utilizes the advantages of both types. In this hybrid optimization method, the preprocessing step is performed by solving the non-quantum-annealing Ising machine multiple times. Then sub-Ising models with a reduced size by spin fixing are solved using a quantum annealer. The performance of the hybrid optimization method is evaluated via simulations using Simulated Annealing (SA) as a non-quantum-type Ising machine and D-Wave Advantage as a quantum annealer. Additionally, we investigate the parameter dependence of the proposed hybrid optimization method. The hybrid optimization method outperforms the preprocessing SA and the quantum annealing machine alone in fully connected random Ising models.

arXiv:2306.06589•Journal of the Physical Society of Japan•Nov 10, 2023•8 citations

Machine learning-assisted high-speed combinatorial optimization with Ising machines for dynamically changing problems

Yohei Hamakawa, Tomoya Kashimata, Masaya Yamasaki +1 more

Quantum or quantum-inspired Ising machines have recently shown promise in solving combinatorial optimization problems in a short time. Real-world and practical applications, such as time division multiple access (TDMA) scheduling for wireless multi-hop networks, financial trading, and emerging in-vehicle systems, require solving those problems sequentially where the size and characteristics change dynamically. However, using Ising machines for practical deployment involves challenges to shorten system-wide latency due to the transfer of large Ising model or the cloud access and to determine the parameters for each problem. Here we show a combinatorial optimization method using embedded Ising machines, which enables solving diverse problems at high speed without runtime parameter tuning. We customize the algorithm and circuit architecture of the simulated bifurcation-based Ising machine to compress the Ising model and accelerate computation and then build a machine learning model to estimate appropriate parameters using extensive training data. In TDMA scheduling for wireless multi-hop networks, our demonstration shows that the sophisticated system can adapt to changes in the problem and has a speed advantage over conventional methods. Quantum-inspired Ising machines can be used to address dynamically changing combinatorial problems. Here, the authors present an embedded approach that compresses models, avoids runtime parameter tuning, and uses ML for rapid adaptation, achieving faster TDMA scheduling in dynamic wireless networks than conventional methods.

arXiv:2503.23966•Nature Communications•Jun 16, 2026•0 citations

Regularized Ising Formulation for Near-Optimal MIMO Detection using Quantum Inspired Solvers

Abhishek Kumar Singh, Kyle Jamieson, Peter L. McMahon +1 more

Optimal MIMO detection is one of the most computationally challenging tasks in wireless systems. We show that the quantum-inspired computing approach based on Coherent Ising Machines (CIMs) is a promising candidate for performing near-optimal MIMO detection. We propose a novel regularized Ising formulation for MIMO detection that mitigates a common error floor issue in the direct approach adopted in the existing literature on MIMO detection using Quantum Annealing. We evaluate our methods using a simplified, quantum-inspired model and show that our methods can achieve a near-optimal performance for several Large MIMO systems, like$16\times 16,20\times 20$, and$24\times 24$MIMO with BPSK modulation.

Globecom•Dec 4, 2022•2 citations

Multi-Objective Routing Optimization Using Coherent Ising Machine in Wireless Multihop Networks

Yuxuan Lin, Chunxue Xu, Chuan Wang

Multi-objective combinatorial optimization in wireless communication networks is a challenging task, particularly for large-scale and diverse topologies. Recent advances in quantum computing offer promising solutions for such problems. Coherent Ising Machines (CIM), a quantum-inspired algorithm, leverages quantum properties of coherent light, enabling faster convergence to the ground state. This paper applies CIM to multiobjective routing optimization in wireless multi-hop networks. We formulate the routing problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, and map it onto an Ising model, allowing CIM to solve it. CIM demonstrates strong scalability across diverse network topologies without requiring topology-specific adjustments, overcoming the limitations of traditional quantum algorithms like Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE). Our results show that CIM provides feasible and near-optimal solutions for networks containing hundreds of nodes and thousands of edges. Additionally, a complexity analysis highlights CIM's increasing efficiency as network size grows.

arXiv:2503.07924•International Conference on Communications•Jun 8, 2025•8 citations

Quantum Computing for Optimization With Ising Machine

Yen-Jui Chang, Chin-Fu Nien, Kuei-Po Huang +3 more

Optimization problems, which involve finding the best solution from a set of possible solutions, are ubiquitous in various fields, from finance to engineering. Traditional algorithms sometimes struggle with these problems, especially when the solution space is vast, or the landscape is filled with numerous local minima. Quantum-inspired computing, which emulates quantum mechanical principles on classical hardware, emerges as a promising paradigm to address these challenges. This paper delves into two notable approaches: coherent Ising machines (CIM) and graphics processing unit (GPU)-accelerated simulated annealing. In essence, both methods offer innovative strategies to navigate the solution landscape, potentially bypassing the pitfalls of local optima and ensuring more efficient convergence to solutions. By harnessing the strengths of these quantum-inspired techniques, we can pave the way for enhanced computational capabilities in tackling complex optimization problems, even without a fault-tolerant quantum computer.

IEEE Nanotechnology Magazine•Mar 28, 2024•6 citations
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.
Recently, new optimization machines based on non-silicon physical systems, such as quantum annealing machines, have been developed, and their commercialization has been started. These machines solve the problems by searching the state of the Ising spins, which minimizes the Ising Hamiltonian. Such a property of minimization of the Ising Hamiltonian can be applied to various combinatorial optimization problems. In this paper, we introduce the coherent Ising machine (CIM), which can solve the problems in a milli-second order, and has higher performance than the quantum annealing machines especially on the problems with dense mutual connections in the corresponding Ising model. We explain how a target problem can be implemented on the CIM, based on the optimization scheme using the mutually connected neural networks. We apply the CIM to traveling salesman problems as an example benchmark, and show experimental results of the real machine of the CIM. We also apply the CIM to several combinatorial optimization problems in wireless communication systems, such as channel assignment problems. The CIM's ultra-fast optimization may enable a real-time optimization of various communication systems even in a dynamic communication environment.
Ising machines have the potential to realize fast and highly accurate solvers for combinatorial optimization problems. They are classified based on their internal algorithms. Examples include simulated-annealing-based Ising machines (non-quantum-type Ising machines) and quantum-annealing-based Ising machines (quantum annealers). Herein we propose a hybrid optimization method, which utilizes the advantages of both types. In this hybrid optimization method, the preprocessing step is performed by solving the non-quantum-annealing Ising machine multiple times. Then sub-Ising models with a reduced size by spin fixing are solved using a quantum annealer. The performance of the hybrid optimization method is evaluated via simulations using Simulated Annealing (SA) as a non-quantum-type Ising machine and D-Wave Advantage as a quantum annealer. Additionally, we investigate the parameter dependence of the proposed hybrid optimization method. The hybrid optimization method outperforms the preprocessing SA and the quantum annealing machine alone in fully connected random Ising models.
Quantum or quantum-inspired Ising machines have recently shown promise in solving combinatorial optimization problems in a short time. Real-world and practical applications, such as time division multiple access (TDMA) scheduling for wireless multi-hop networks, financial trading, and emerging in-vehicle systems, require solving those problems sequentially where the size and characteristics change dynamically. However, using Ising machines for practical deployment involves challenges to shorten system-wide latency due to the transfer of large Ising model or the cloud access and to determine the parameters for each problem. Here we show a combinatorial optimization method using embedded Ising machines, which enables solving diverse problems at high speed without runtime parameter tuning. We customize the algorithm and circuit architecture of the simulated bifurcation-based Ising machine to compress the Ising model and accelerate computation and then build a machine learning model to estimate appropriate parameters using extensive training data. In TDMA scheduling for wireless multi-hop networks, our demonstration shows that the sophisticated system can adapt to changes in the problem and has a speed advantage over conventional methods. Quantum-inspired Ising machines can be used to address dynamically changing combinatorial problems. Here, the authors present an embedded approach that compresses models, avoids runtime parameter tuning, and uses ML for rapid adaptation, achieving faster TDMA scheduling in dynamic wireless networks than conventional methods.
Optimal MIMO detection is one of the most computationally challenging tasks in wireless systems. We show that the quantum-inspired computing approach based on Coherent Ising Machines (CIMs) is a promising candidate for performing near-optimal MIMO detection. We propose a novel regularized Ising formulation for MIMO detection that mitigates a common error floor issue in the direct approach adopted in the existing literature on MIMO detection using Quantum Annealing. We evaluate our methods using a simplified, quantum-inspired model and show that our methods can achieve a near-optimal performance for several Large MIMO systems, like16×16,20×2016\times 16,20\times 2016×16,20×20, and24×2424\times 2424×24MIMO with BPSK modulation.
Multi-objective combinatorial optimization in wireless communication networks is a challenging task, particularly for large-scale and diverse topologies. Recent advances in quantum computing offer promising solutions for such problems. Coherent Ising Machines (CIM), a quantum-inspired algorithm, leverages quantum properties of coherent light, enabling faster convergence to the ground state. This paper applies CIM to multiobjective routing optimization in wireless multi-hop networks. We formulate the routing problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, and map it onto an Ising model, allowing CIM to solve it. CIM demonstrates strong scalability across diverse network topologies without requiring topology-specific adjustments, overcoming the limitations of traditional quantum algorithms like Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE). Our results show that CIM provides feasible and near-optimal solutions for networks containing hundreds of nodes and thousands of edges. Additionally, a complexity analysis highlights CIM's increasing efficiency as network size grows.
Optimization problems, which involve finding the best solution from a set of possible solutions, are ubiquitous in various fields, from finance to engineering. Traditional algorithms sometimes struggle with these problems, especially when the solution space is vast, or the landscape is filled with numerous local minima. Quantum-inspired computing, which emulates quantum mechanical principles on classical hardware, emerges as a promising paradigm to address these challenges. This paper delves into two notable approaches: coherent Ising machines (CIM) and graphics processing unit (GPU)-accelerated simulated annealing. In essence, both methods offer innovative strategies to navigate the solution landscape, potentially bypassing the pitfalls of local optima and ensuring more efficient convergence to solutions. By harnessing the strengths of these quantum-inspired techniques, we can pave the way for enhanced computational capabilities in tackling complex optimization problems, even without a fault-tolerant quantum computer.