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 Access

Exploring Potential Applications of Ising Machines for Power System Operations

Kenta Kirihara, Hidetaka Imai, Eisuke Kuroda, Jun Yamazaki, Akiko Masaki-Kato

Published Jan 1, 2023• 5 citations
Publisher

Abstract

Recent advancements in Ising machines, both via quantum and quantum-inspired annealing, have been showing promising results in solving difficult optimization problems. Due to the potential of these dedicated machines, there is a rising interest in applying Ising machines to power system operation. However, despite Ising machines exhibiting computational advantages over conventional computational resources, modeling capability of Ising machines limit potential applications. Hence, this work explores these potential applications in two steps. First, using known characteristics of Ising machines and theoretical derivation, this work constructs an Ising machine applicability table for optimization problems. Then, using the constructed table, this work assesses the suitability of well-known optimization problems in the power system operation to identify potential applications. Furthermore, to understand the performance in applying Ising machines, a phasor measurement unit placement problem is solved using a quantum inspired Ising machine. The results show potential for solving large-scale problems that are unsolvable by conventional methods. The findings of the work are summarized in an Ising machine usage guideline for power system operations.

DOI
10.1109/access.2023.3289720

Related papers

A Survey on Applications of Quantum Computing for Unit Commitment

Milad Hasanzadeh, Ali Rajabi, Amin Kargarian

Unit Commitment (UC) is a core optimization problem in power system operation and electricity market scheduling. It determines the optimal on/off status and dispatch of generating units while satisfying system, operational, and market constraints. Traditionally, UC has been solved using mixed-integer programming, dynamic programming, or metaheuristic methods, all of which face scalability challenges as systems grow in size and uncertainty. Recent advances in quantum computing, spanning quantum annealing, variational algorithms, and hybrid quantum classical optimization, have opened new opportunities to accelerate UC solution processes by exploiting quantum parallelism and entanglement. This paper presents a comprehensive survey of existing research on the applications of quantum computing for solving the UC problem. The reviewed works are categorized based on the employed quantum paradigms, including annealing-based, variational hybrid, quantum machine learning, and quantum-inspired methods. Key modeling strategies, hardware implementations, and computational trade-offs are discussed, highlighting the current progress, limitations, and potential future directions for large-scale quantum-enabled UC.

quant-pharXiv:2601.01777•Southeast Symposium on Contemporary Engineering Topics (SSCET)•Jan 6, 2026•6 citations

Photonic Ising machines for combinatorial optimization problems

Yuan Gao, Guanyu Chen, Qi Luo +3 more

The demand for efficient solvers of complicated combinatorial optimization problems, especially those classified as NP-complete or NP-hard, has recently led to increased exploration of novel computing architectures. One prominent collective state computing paradigm embodied in the so-called Ising machines has recently attracted considerable research attention due to its ability to optimize complex problems with large numbers of interacting variables. Ising model-inspired solvers, thus named due to mathematical similarities to the well-known model from solid-state physics, represent a promising alternative to traditional von Neumann computer architectures due to their high degree of inherent parallelism. While there are many possible physical realizations of Ising solvers, just as there are many possible implementations of any binary computer, photonic Ising machines (PIMs) use primarily optical components for computation, taking advantage of features like lower power consumption, fast calculation speeds, the leveraging of physical optics to perform the calculations themselves, possessing decent scalability and noise tolerance. Photonic computing in the form of PIMs may offer certain computational advantages that are not easily achieved with non-photonic approaches and is nonetheless an altogether fascinating application of photonics to computing. In this review, we provide an overview of Ising machines generally, introducing why they are useful, what types of problems they can tackle, and how different Ising solvers can be compared and benchmarked. We delineate their various operational mechanisms, advantages, and limitations vis-à-vis non-photonic Ising machines. We describe their scalability, interconnectivity, performance, and physical dimensions. As research in PIMs continues to progress, there is a potential that photonic computing could well emerge as a way to handle large and challenging optimization problems across diverse domains. This review serves as a comprehensive resource for researchers and practitioners interested in understanding capabilities and potential of PIMs in addressing such complex optimization problems.

Applied Physics Reviews•Oct 14, 2024•40 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

Physics-Inspired Optimization in the QUBO Framework: Key Concepts and Approaches

Lien-Po Yu, Chin-Fu Nien

Quantum computing promises to have a tremendous advantage over its classical counterpart for solving computationally hard problems, yet remains in a relatively early stage for practical applications owing to the limited capabilities of today’s quantum computers. The approach to the special purposes of quantum computers by exploiting the special-purpose physics-inspired or quantum-inspired computers is emerging as a novel alternative to its quantum counterpart in tackling hard problems in high-performance computing. Inspired by physics, the Ising machine — a type of special-purpose computer that implements or emulates physics or quantum effects of the Ising model to speed up finding solutions to optimization problems — has recently become an active research area in the field of combinatorial optimization. This paper is to address the key enabling software and hardware technology underlying physics-inspired optimization using Ising machines in the unified quadratic unconstrained binary optimization (QUBO) framework for modeling and solving computationally hard combinatorial optimization problems, and with an aim to shed some light on the challenges and opportunities associated with the ever-growing landscape of this novel high-performance computing.

SPIN•Aug 30, 2023•1 citation

Quantum Computing for Power Electronics: Quantum Machine Learning Approaches for IoT-Enabled Grid Optimization

Seepuram Srinivas Kumar, Heena Kausar

The increasing complexity of modern power grids, driven by the integration of renewable energy sources, decentralized energy generation, and dynamic load variations, necessitates advanced computational approaches for efficient grid optimization. Conventional algorithms often struggle with the high-dimensionality and computational intensity of power system optimization problems, prompting the exploration of quantum computing as a transformative alternative. Quantum computing, particularly quantum machine learning (QML) and quantum optimization algorithms, has demonstrated significant potential in accelerating grid stability analysis, energy dispatch, and fault detection. This chapter provides a comprehensive investigation into quantum computing applications for power electronics, focusing on quantum-inspired machine learning models and hybrid quantum-classical frameworks for IoT-enabled smart grids. The potential advantages of quantum algorithms, including the Quantum Approximate Optimization Algorithm (QAOA), Variational Quantum Eigensolver (VQE), and Grover’s search algorithm, are analyzed in the context of grid optimization, fault detection, and cybersecurity. Additionally, a comparative analysis of classical and quantum machine learning techniques highlights key performance differences and the challenges associated with practical quantum implementations. Despite the promising advancements, several challenges, including quantum hardware limitations, noise susceptibility, and scalability issues, must be addressed for real-world deployment. Future directions emphasize the need for noise-resilient quantum algorithms, efficient hybrid architectures, and quantum-inspired classical methods to bridge the gap between existing computational techniques and next-generation quantum solutions for power grid management.

•Mar 17, 2025•1 citation

Quantum Annealing Applications for Power Grid Modernization

Tyler Christeson

Power grid modernization is essential for ensuring the reliability, efficiency, and sustainability of power systems in response to increasing demand, supply uncertainty, and decentralization of resources. This dissertation investigates the application of quantum computing (QC) in solving two challenging power grid problems, including Unit Commitment (UC) and Vehicle-to-Grid (V2G) optimization. Through novel approaches in quantum modeling, this work seeks to advance computational strategies that could support grid modernization efforts as grid complexity grows beyond the capabilities of classical optimization methods. The first part of this research introduces QC and the core mechanics of quantum physics that are vital to understanding quantum computations. Different methods of QC and their histories are discussed, including gate-based models and quantum annealing. Quantum annealing (QA) is the focus of the rest of the chapter, discussing the QA process, the mathematics behind it, and the reformulations required to make an optimization problem quantum-compatible. In the second part, a hybrid quantum-classical model is developed to solve the UC problem, combining QA with classical solvers to balance computational efficiency and solution accuracy. The results are compared to a classical deterministic and metaheuristic solutions, which reveals that while classical models outperform quantum solutions at smaller scales, the hybrid approach offers promising advantages in handling more complex grid configurations. This hybrid model provides a pathway for QC to enhance classical optimization techniques, especially as hardware and embedding algorithms continue to evolve. A novel discretization strategy is introduced that is designed to solve the UC problem more efficiently compatible with quantum annealing (QA) hardware. By representing continuous variables as binary variables using a logarithmic binning technique, this approach aims to reduce the number of binary variables needed for problem reformulation. Results show that this novel discretization significantly decreased computational time and yielded fewer binary variables, although further adjustments are needed to improve solution accuracy and optimality. The final part examines the feasibility of using a quantum model to optimize V2G scheduling. This quantum model, aimed at minimizing EV charging costs over a 24-hour period, achieves a reasonable optimality rate relative to a classical deterministic solution for a studied test system. The study demonstrates QC’s potential for real-world applications, albeit on a limited scale, and highlights the scalability possibilities for broader V2G network management as quantum technology matures. This is followed by a review of existing methods for V2G and mobile energy storage system optimization, with a focus on enhancing grid resilience and a discussion around potential quantum advantages and pathways for future utilization. Collectively, these findings demonstrate that while QC in grid optimization is still in its nascent stages, it holds substantial promise for meeting the computational demands of the future power grid. This research paves the way for continued exploration of quantum-enhanced solutions to support grid modernization in the era of renewable energy integration, electrification, and continually increasing complexity.

•Nov 21, 2025•0 citations
Recent advancements in Ising machines, both via quantum and quantum-inspired annealing, have been showing promising results in solving difficult optimization problems. Due to the potential of these dedicated machines, there is a rising interest in applying Ising machines to power system operation. However, despite Ising machines exhibiting computational advantages over conventional computational resources, modeling capability of Ising machines limit potential applications. Hence, this work explores these potential applications in two steps. First, using known characteristics of Ising machines and theoretical derivation, this work constructs an Ising machine applicability table for optimization problems. Then, using the constructed table, this work assesses the suitability of well-known optimization problems in the power system operation to identify potential applications. Furthermore, to understand the performance in applying Ising machines, a phasor measurement unit placement problem is solved using a quantum inspired Ising machine. The results show potential for solving large-scale problems that are unsolvable by conventional methods. The findings of the work are summarized in an Ising machine usage guideline for power system operations.
Unit Commitment (UC) is a core optimization problem in power system operation and electricity market scheduling. It determines the optimal on/off status and dispatch of generating units while satisfying system, operational, and market constraints. Traditionally, UC has been solved using mixed-integer programming, dynamic programming, or metaheuristic methods, all of which face scalability challenges as systems grow in size and uncertainty. Recent advances in quantum computing, spanning quantum annealing, variational algorithms, and hybrid quantum classical optimization, have opened new opportunities to accelerate UC solution processes by exploiting quantum parallelism and entanglement. This paper presents a comprehensive survey of existing research on the applications of quantum computing for solving the UC problem. The reviewed works are categorized based on the employed quantum paradigms, including annealing-based, variational hybrid, quantum machine learning, and quantum-inspired methods. Key modeling strategies, hardware implementations, and computational trade-offs are discussed, highlighting the current progress, limitations, and potential future directions for large-scale quantum-enabled UC.
The demand for efficient solvers of complicated combinatorial optimization problems, especially those classified as NP-complete or NP-hard, has recently led to increased exploration of novel computing architectures. One prominent collective state computing paradigm embodied in the so-called Ising machines has recently attracted considerable research attention due to its ability to optimize complex problems with large numbers of interacting variables. Ising model-inspired solvers, thus named due to mathematical similarities to the well-known model from solid-state physics, represent a promising alternative to traditional von Neumann computer architectures due to their high degree of inherent parallelism. While there are many possible physical realizations of Ising solvers, just as there are many possible implementations of any binary computer, photonic Ising machines (PIMs) use primarily optical components for computation, taking advantage of features like lower power consumption, fast calculation speeds, the leveraging of physical optics to perform the calculations themselves, possessing decent scalability and noise tolerance. Photonic computing in the form of PIMs may offer certain computational advantages that are not easily achieved with non-photonic approaches and is nonetheless an altogether fascinating application of photonics to computing. In this review, we provide an overview of Ising machines generally, introducing why they are useful, what types of problems they can tackle, and how different Ising solvers can be compared and benchmarked. We delineate their various operational mechanisms, advantages, and limitations vis-à-vis non-photonic Ising machines. We describe their scalability, interconnectivity, performance, and physical dimensions. As research in PIMs continues to progress, there is a potential that photonic computing could well emerge as a way to handle large and challenging optimization problems across diverse domains. This review serves as a comprehensive resource for researchers and practitioners interested in understanding capabilities and potential of PIMs in addressing such complex optimization problems.
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.
Quantum computing promises to have a tremendous advantage over its classical counterpart for solving computationally hard problems, yet remains in a relatively early stage for practical applications owing to the limited capabilities of today’s quantum computers. The approach to the special purposes of quantum computers by exploiting the special-purpose physics-inspired or quantum-inspired computers is emerging as a novel alternative to its quantum counterpart in tackling hard problems in high-performance computing. Inspired by physics, the Ising machine — a type of special-purpose computer that implements or emulates physics or quantum effects of the Ising model to speed up finding solutions to optimization problems — has recently become an active research area in the field of combinatorial optimization. This paper is to address the key enabling software and hardware technology underlying physics-inspired optimization using Ising machines in the unified quadratic unconstrained binary optimization (QUBO) framework for modeling and solving computationally hard combinatorial optimization problems, and with an aim to shed some light on the challenges and opportunities associated with the ever-growing landscape of this novel high-performance computing.
The increasing complexity of modern power grids, driven by the integration of renewable energy sources, decentralized energy generation, and dynamic load variations, necessitates advanced computational approaches for efficient grid optimization. Conventional algorithms often struggle with the high-dimensionality and computational intensity of power system optimization problems, prompting the exploration of quantum computing as a transformative alternative. Quantum computing, particularly quantum machine learning (QML) and quantum optimization algorithms, has demonstrated significant potential in accelerating grid stability analysis, energy dispatch, and fault detection. This chapter provides a comprehensive investigation into quantum computing applications for power electronics, focusing on quantum-inspired machine learning models and hybrid quantum-classical frameworks for IoT-enabled smart grids. The potential advantages of quantum algorithms, including the Quantum Approximate Optimization Algorithm (QAOA), Variational Quantum Eigensolver (VQE), and Grover’s search algorithm, are analyzed in the context of grid optimization, fault detection, and cybersecurity. Additionally, a comparative analysis of classical and quantum machine learning techniques highlights key performance differences and the challenges associated with practical quantum implementations. Despite the promising advancements, several challenges, including quantum hardware limitations, noise susceptibility, and scalability issues, must be addressed for real-world deployment. Future directions emphasize the need for noise-resilient quantum algorithms, efficient hybrid architectures, and quantum-inspired classical methods to bridge the gap between existing computational techniques and next-generation quantum solutions for power grid management.
Power grid modernization is essential for ensuring the reliability, efficiency, and sustainability of power systems in response to increasing demand, supply uncertainty, and decentralization of resources. This dissertation investigates the application of quantum computing (QC) in solving two challenging power grid problems, including Unit Commitment (UC) and Vehicle-to-Grid (V2G) optimization. Through novel approaches in quantum modeling, this work seeks to advance computational strategies that could support grid modernization efforts as grid complexity grows beyond the capabilities of classical optimization methods. The first part of this research introduces QC and the core mechanics of quantum physics that are vital to understanding quantum computations. Different methods of QC and their histories are discussed, including gate-based models and quantum annealing. Quantum annealing (QA) is the focus of the rest of the chapter, discussing the QA process, the mathematics behind it, and the reformulations required to make an optimization problem quantum-compatible. In the second part, a hybrid quantum-classical model is developed to solve the UC problem, combining QA with classical solvers to balance computational efficiency and solution accuracy. The results are compared to a classical deterministic and metaheuristic solutions, which reveals that while classical models outperform quantum solutions at smaller scales, the hybrid approach offers promising advantages in handling more complex grid configurations. This hybrid model provides a pathway for QC to enhance classical optimization techniques, especially as hardware and embedding algorithms continue to evolve. A novel discretization strategy is introduced that is designed to solve the UC problem more efficiently compatible with quantum annealing (QA) hardware. By representing continuous variables as binary variables using a logarithmic binning technique, this approach aims to reduce the number of binary variables needed for problem reformulation. Results show that this novel discretization significantly decreased computational time and yielded fewer binary variables, although further adjustments are needed to improve solution accuracy and optimality. The final part examines the feasibility of using a quantum model to optimize V2G scheduling. This quantum model, aimed at minimizing EV charging costs over a 24-hour period, achieves a reasonable optimality rate relative to a classical deterministic solution for a studied test system. The study demonstrates QC’s potential for real-world applications, albeit on a limited scale, and highlights the scalability possibilities for broader V2G network management as quantum technology matures. This is followed by a review of existing methods for V2G and mobile energy storage system optimization, with a focus on enhancing grid resilience and a discussion around potential quantum advantages and pathways for future utilization. Collectively, these findings demonstrate that while QC in grid optimization is still in its nascent stages, it holds substantial promise for meeting the computational demands of the future power grid. This research paves the way for continued exploration of quantum-enhanced solutions to support grid modernization in the era of renewable energy integration, electrification, and continually increasing complexity.