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 PES Innovative Smart Grid Technologies Europe

Quantum optimization approach based on Qibo framework for DC-OPF

Marc Carrillo-Muñoz, Sergio Martinez-Hermida, Sara Barja-Martínez, Antonio E. Saldaña-González, Mònica Aragüés‐Peñalba

Published Oct 20, 2025• 0 citations
Publisher

Abstract

Quantum computing has the potential to solve complex problems faster and with less energy consumption than classical computing. This paper proposes, for the first time, the application of the open-source quantum simulation library Qibo to DC-OPF problems. The problem is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) and solved through Adiabatic Quantum Computing (AQC). The methodology is applied to a small case study, based on the IEEE 5 bus system. The computational complexity in CPU and GPU execution is compared. Despite being computationally intensive for the small number of qubits, the simulated case study shows successful performance of the Qibo implementation: the global minimum is found with probability 97.98%. This study reinforces the prospective of quantum simulation techniques for optimization problems in power systems.

DOI
10.1109/isgteurope64741.2025.11305603

Related papers

Power flow and optimal power flow using quantum and digital annealers: a computational scalability analysis

Zeynab Kaseb, Matthias Möller, Pedro P. Vergara +1 more

This study further explores reformulating power flow (PF) analysis as a discrete combinatorial optimization problem, proposed in our earlier study using the Adiabatic Quantum Power Flow (AQPF) algorithm, which can be executed on Ising machines, including quantum and quantum-inspired hardware. This approach provides a new representation of the underlying equations, analogous to how neural networks approximate complex functions using simple operations. While the resulting combinatorial optimization problem is NP-hard, it is compatible with emerging quantum hardware designed to address such complexity. We introduce the Adiabatic Quantum Optimal Power Flow (AQOPF) algorithm, which transforms the classical optimal power flow (OPF) equations into quadratic unconstrained binary optimization (QUBO) models. Furthermore, the AQPF and AQOPF algorithms are evaluated on standard test cases ranging from 4- to 1354-bus systems using D-Wave's Advantage\texttrademark\ system (QA), its hybrid quantum-classical solver (HA), and Fujitsu's third-generation Digital Annealer (DAv3) and Quantum-Inspired Integrated Optimization (QIIO) platform. Both full and partitioned formulations are investigated, with particular attention to scalability and robustness in ill-conditioned scenarios. The results demonstrate that the algorithms can reproduce feasible PF and OPF solutions and exhibit promising computational scalability when supported by scalable hardware.

arXiv:2505.15978•May 21, 2025•2 citations

Qibo : a framework for quantum simulation with hardware acceleration

Stavros Efthymiou, Sergi Ramos-Calderer, Carlos Bravo-Prieto +5 more

Abstract We present Qibo , a new open-source software for fast evaluation of quantum circuits and adiabatic evolution which takes full advantage of hardware accelerators. The growing interest in quantum computing and the recent developments of quantum hardware devices motivates the development of new advanced computational tools focused on performance and usage simplicity. In this work we introduce a new quantum simulation framework that enables developers to delegate all complicated aspects of hardware or platform implementation to the library so they can focus on the problem and quantum algorithms at hand. This software is designed from scratch with simulation performance, code simplicity and user friendly interface as target goals. It takes advantage of hardware acceleration such as multi-threading Central Processing Unit (CPU), single Graphics Processing Unit (GPU) and multi-GPU devices.

arXiv:2009.01845•Quantum Science and Technology•Dec 9, 2021•169 citations

Solving Portfolio Optimization Problems using Adiabatic Quantum Computing

Bartlomiej Kolodziejczyk

Abstract This study explores the application of adiabatic quantum computing to portfolio optimization, a critical problem in finance. By formulating the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model, the study integrates constraints such as expected return, transaction cost, and Environmental, Social, and Governance (ESG) scores. Simulations using D-Wave’s quantum annealer demonstrate the feasibility of optimizing portfolios comprising hundreds of assets with reduced computational time compared to classical methods. While current quantum devices face limitations in precision, this work lays the foundation for leveraging quantum technologies in financial optimization.

•Jul 30, 2025•0 citations

A Penalty-Based QUBO Formulation for Quantum Unit Commitment: Mitigating Slack Variable Constraints in QAOA

Aayush Sharma, Rashi Sinha, P. V. Manitha

The advent of renewable integration to modernize the electric grid has introduced unprecedented complexities in power system operation. Solving the Unit Commitment (UC) problem requires searching vast combinatorial spaces that usually limit classical deterministic solvers. This paper presents a Hybrid Quantum-Classical Framework for solving the UC problem with a rigid Quadratic Unconstrained Binary Optimization (QUBO) formulation. The results of a classical metaheuristic solver (Simulated Annealing) were benchmarked against a variational quantum algorithm (QAOA) implemented with IBM Qiskit. The framework was tested on the standard IEEE 14-Bus system. To accommodate current quantum hardware limits, the quantum execution was localized to a 3-hour, 215statespace peak-load window. Within this comparative window, the classical solver outperformed on execution time (1.2 s) and cost (Rs. 65,000). However, the QAOA implementation (Rs. 69,000 within 45.5 s) provided a mathematically viable pathway for quantum-native grid dispatch. Furthermore, this paper highlights quantum hardware scaling issues caused by inequality-driven slack variables, developing a strict quadratic penalty approach to eliminate auxiliary variables and formulate an initial framework for future quantum grid utility control.

International Conference on Ambient Intelligence, Knowledge Informatics and Industrial Electronics (AIKIIE)•Aug 1, 2026•0 citations

A quantum computing approach for minimum loss problems in electrical distribution networks

Filipe F. C. Silva, Pedro M. S. Carvalho, Luís A. F. M. Ferreira

This paper presents an application of a novel quadratic unconstrained binary optimization (QUBO) formulation to the minimum loss problem in distribution networks. The proposed QUBO formulation was conceived to be employed in quantum annealing-a quantum computing paradigm useful for solving combinatorial optimization problems. Quantum annealing is expected to provide better and/or faster solutions to optimization problems when compared to the ones provided by classical computers. With the problem at stake, better solutions result in lower energy losses, and faster solutions contribute to the same outcome given the future need for frequent reconfiguration of distribution networks to accommodate highly volatile demand, as anticipated by recent low-carbon solutions. The paper presents the results obtained through a hybrid quantum-classical solver for a standard 33-node test network and compares them with the ones obtained from classical solvers. Our main conclusion is that quantum annealing has potential to show advantage in the near future in terms of solution quality and time-to-solution, as quantum annealers and hybrid solvers continue to improve their performance.

Scientific Reports•Jul 4, 2023•22 citations

Solving the Hamiltonian Cycle Problem using a Quantum Computer

Anuradha Mahasinghe, Richard Hua, Michael J. Dinneen +1 more

We review existing quantum computational methods for solving the Hamiltonian cycle problem in different computational frameworks such as quantum circuits, quantum walks and adiabatic quantum computation. Then we present a QUBO (quadratic unconstrained binary optimization) formulation, which is suitable for the adiabatic quantum computation for a D-Wave architecture. Further, we derive a physical Hamiltonian from the QUBO formulation and discuss its adequateness in the adiabatic framework. Finally, we discuss the complexity of running the Hamiltonian cycle QUBO on a D-Wave quantum computer, and compare it with existing quantum computational methods.

Australasian Computer Science Week Multiconference (ACSW)•Jan 14, 2019•28 citations
Quantum computing has the potential to solve complex problems faster and with less energy consumption than classical computing. This paper proposes, for the first time, the application of the open-source quantum simulation library Qibo to DC-OPF problems. The problem is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) and solved through Adiabatic Quantum Computing (AQC). The methodology is applied to a small case study, based on the IEEE 5 bus system. The computational complexity in CPU and GPU execution is compared. Despite being computationally intensive for the small number of qubits, the simulated case study shows successful performance of the Qibo implementation: the global minimum is found with probability 97.98%. This study reinforces the prospective of quantum simulation techniques for optimization problems in power systems.
This study further explores reformulating power flow (PF) analysis as a discrete combinatorial optimization problem, proposed in our earlier study using the Adiabatic Quantum Power Flow (AQPF) algorithm, which can be executed on Ising machines, including quantum and quantum-inspired hardware. This approach provides a new representation of the underlying equations, analogous to how neural networks approximate complex functions using simple operations. While the resulting combinatorial optimization problem is NP-hard, it is compatible with emerging quantum hardware designed to address such complexity. We introduce the Adiabatic Quantum Optimal Power Flow (AQOPF) algorithm, which transforms the classical optimal power flow (OPF) equations into quadratic unconstrained binary optimization (QUBO) models. Furthermore, the AQPF and AQOPF algorithms are evaluated on standard test cases ranging from 4- to 1354-bus systems using D-Wave's Advantage\texttrademark\ system (QA), its hybrid quantum-classical solver (HA), and Fujitsu's third-generation Digital Annealer (DAv3) and Quantum-Inspired Integrated Optimization (QIIO) platform. Both full and partitioned formulations are investigated, with particular attention to scalability and robustness in ill-conditioned scenarios. The results demonstrate that the algorithms can reproduce feasible PF and OPF solutions and exhibit promising computational scalability when supported by scalable hardware.
Abstract We present Qibo , a new open-source software for fast evaluation of quantum circuits and adiabatic evolution which takes full advantage of hardware accelerators. The growing interest in quantum computing and the recent developments of quantum hardware devices motivates the development of new advanced computational tools focused on performance and usage simplicity. In this work we introduce a new quantum simulation framework that enables developers to delegate all complicated aspects of hardware or platform implementation to the library so they can focus on the problem and quantum algorithms at hand. This software is designed from scratch with simulation performance, code simplicity and user friendly interface as target goals. It takes advantage of hardware acceleration such as multi-threading Central Processing Unit (CPU), single Graphics Processing Unit (GPU) and multi-GPU devices.
Abstract This study explores the application of adiabatic quantum computing to portfolio optimization, a critical problem in finance. By formulating the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model, the study integrates constraints such as expected return, transaction cost, and Environmental, Social, and Governance (ESG) scores. Simulations using D-Wave’s quantum annealer demonstrate the feasibility of optimizing portfolios comprising hundreds of assets with reduced computational time compared to classical methods. While current quantum devices face limitations in precision, this work lays the foundation for leveraging quantum technologies in financial optimization.
The advent of renewable integration to modernize the electric grid has introduced unprecedented complexities in power system operation. Solving the Unit Commitment (UC) problem requires searching vast combinatorial spaces that usually limit classical deterministic solvers. This paper presents a Hybrid Quantum-Classical Framework for solving the UC problem with a rigid Quadratic Unconstrained Binary Optimization (QUBO) formulation. The results of a classical metaheuristic solver (Simulated Annealing) were benchmarked against a variational quantum algorithm (QAOA) implemented with IBM Qiskit. The framework was tested on the standard IEEE 14-Bus system. To accommodate current quantum hardware limits, the quantum execution was localized to a 3-hour, 215statespace peak-load window. Within this comparative window, the classical solver outperformed on execution time (1.2 s) and cost (Rs. 65,000). However, the QAOA implementation (Rs. 69,000 within 45.5 s) provided a mathematically viable pathway for quantum-native grid dispatch. Furthermore, this paper highlights quantum hardware scaling issues caused by inequality-driven slack variables, developing a strict quadratic penalty approach to eliminate auxiliary variables and formulate an initial framework for future quantum grid utility control.
This paper presents an application of a novel quadratic unconstrained binary optimization (QUBO) formulation to the minimum loss problem in distribution networks. The proposed QUBO formulation was conceived to be employed in quantum annealing-a quantum computing paradigm useful for solving combinatorial optimization problems. Quantum annealing is expected to provide better and/or faster solutions to optimization problems when compared to the ones provided by classical computers. With the problem at stake, better solutions result in lower energy losses, and faster solutions contribute to the same outcome given the future need for frequent reconfiguration of distribution networks to accommodate highly volatile demand, as anticipated by recent low-carbon solutions. The paper presents the results obtained through a hybrid quantum-classical solver for a standard 33-node test network and compares them with the ones obtained from classical solvers. Our main conclusion is that quantum annealing has potential to show advantage in the near future in terms of solution quality and time-to-solution, as quantum annealers and hybrid solvers continue to improve their performance.
We review existing quantum computational methods for solving the Hamiltonian cycle problem in different computational frameworks such as quantum circuits, quantum walks and adiabatic quantum computation. Then we present a QUBO (quadratic unconstrained binary optimization) formulation, which is suitable for the adiabatic quantum computation for a D-Wave architecture. Further, we derive a physical Hamiltonian from the QUBO formulation and discuss its adequateness in the adiabatic framework. Finally, we discuss the complexity of running the Hamiltonian cycle QUBO on a D-Wave quantum computer, and compare it with existing quantum computational methods.