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

Scientific Reports

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

Published Jul 4, 2023• 22 citations
Publisher

Abstract

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.

DOI
10.1038/s41598-023-37293-9

Related papers

Power Network Optimization: A Quantum Approach

Giuseppe Colucci, Stan van der Linde, Frank Phillipson

Optimization of electricity surplus is a crucial element for transmission power networks since it leads to reducing costs as well as increasing efficiency across the network as a whole. In this paper, we show how to optimize such network costs using a quantum annealing approach. First, we define the Quadratic Unconstrained Binary Optimization (QUBO) problem for network partitioning. To achieve this, we introduce a method to translate inequality constraints with real-valued coefficients into approximate penalty functions. Next, we test the implementation on purely quantum and quantum-classical hybrid architectures. We then solve the problem using the D-Wave hybrid Constrained Quadratic Model (CQM) solver, the D-Wave hybrid Binary Quadratic Model (BQM) solver, as well as classical solvers available on Azure Quantum Cloud. Finally, we find that the value of the objective function obtained with the quantum-classical hybrid solvers is always lower compared to the classical approaches across a range of different problem sizes. This demonstrates that the quantum-classical hybrid methods outperform the classical methods in terms of solution quality.

arXiv:2212.01625•IEEE Access•Jan 1, 2023•45 citations

Optimizing Multi-Path Routing in Large-Scale Quantum Networks Using Quantum Annealing

Parker Jones, Vini Chaudhary

This paper evaluates quantum annealing as a potential method for solving multi-path routing in large-scale quantum communication networks. The routing problem was formulated as a quadratic unconstrained binary optimization (QUBO) problem that minimizes negative throughput while satisfying quantum network constraints. The experimental framework tests four solution approaches on randomly generated networks: (1) the classical quantum fidelity rate maximizing (Q-FiRM) algorithm, (2) classical simulated annealing, (3) D-Wave hybrid solver, and (4) pure quantum annealing on D-Wave Advantage2 hardware. Results show that while quantum annealers produce feasible solutions, the classical Q-FiRM algorithm achieves superior throughput and faster computation times for this problem class. Among QUBO approaches, hybrid solvers demonstrate computational advantages over pure classical simulated annealing while maintaining comparable solution quality. These findings provide practical insight into the current capabilities and limitations of quantum optimization for quantum internet infrastructure design.

IEEE SoutheastCon•Feb 20, 2026•0 citations

New QUBO Transformations to Improve Quantum and Simulated Annealing Performance for Quadratic Knapsack

Nicolás Borrajo, Juan Marcos Ramírez, Farzam Nosrati +3 more

Recent advances in quantum computing have shown great potential for solving combinatorial optimization problems. A notable example is the quadratic knapsack problem, a constrained binary optimization problem. However, current quantum-inspired algorithms require Quadratic Unconstrained Binary Optimization (QUBO) formulations. Transforming constrained optimization into QUBO impacts the algorithms' speed and efficiency. In this study, we evaluate five existing transformation methods and propose four novel approaches. We assess them by using Simulated Annealing (SA), and find that three of our approaches outperform existing methods in terms of execution time as well as quality and quantity of feasible solutions found. Also, we tested these transformations on a quantum annealer, which was unable to solve even small instances, due to limitations in connectivity and error rates. In general, our results highlight the advantages of the new approaches, which reduce the number of variables in the QUBO representation.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 14, 2025•0 citations

Annealing-Based Quantum Computing for Combinatorial Optimal Power Flow

Thomas Morstyn

This paper proposes the use of annealing-based quantum computing for solving combinatorial optimal power flow problems. Quantum annealers provide a physical computing platform which utilises quantum phase transitions to solve specific classes of combinatorial problems. These devices have seen rapid increases in scale and performance, and are now approaching the point where they could be valuable for industrial applications. This paper shows how an optimal power flow problem incorporating linear multiphase network modelling, discrete sources of energy flexibility, renewable generation placement/sizing and network upgrade decisions can be formulated as a quadratic unconstrained binary optimisation problem, which can be solved by quantum annealing. Case studies with these components integrated with the IEEE European Low Voltage Test Feeder are implemented using D-Wave Systems’ 5,760 qubit Advantage quantum processing unit and hybrid quantum-classical solver.

IEEE Transactions on Smart Grid•Aug 22, 2022•89 citations

Network Vulnerability Analysis via Quantum Computing

Andrew P. Kennedy, Thang N. Dinh, My T. Thai

In many complex networking systems, identifying critical nodes whose removal maximally disrupts network connectivity remains an important yet computationally challenging problem for network vulnerability analysis. Finding near-optimal solutions is known to be NP-hard. In this paper, we explore the potential of near-term quantum computing devices to efficiently solve the k-Critical Node Detection (k-CND) problem. We formulate the problem as a quadratic unconstrained binary optimization (QUBO), a mathematical optimization over binary variables amenable to solution on quantum annealers. We present a novel integer linear programming (ILP) formulation and its conversion into QUBOs and provide benchmarking results on D-Wave's quantum annealers. Our theoretical analysis proves that our proposed formulation, ILP2, generates substantially smaller QUBO than the state-of-the-art ILP1 formulation. Experimentally, our efficient QUBO yields a 59.7% decrease in QUBO variables on a graph with 10 vertices and 40 edges, and an 11.7% reduction in qubits on a 15-vertex, 22-edge graph compared to that of QUBO1. We analyze the solution quality and running time across quantum, classical, and hybrid solvers to assess the potential for quantum advantage. Our work showcases the promise and challenges of tackling this important graph problem on near-term quantum hardware.

International Conference on Meta Computing (ICMC)•Jun 20, 2024•0 citations

Quantum annealing for combinatorial optimization: a benchmarking study

Seongmin Kim, Sang-Woo Ahn, In‐Saeng Suh +3 more

Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of qubits and their connectivity, the QA hardware did not show such an advantage over classical methods in past benchmarking studies. Recent advancements in QA with more than 5000 qubits, enhanced qubit connectivity, and the hybrid architecture promise to realize the quantum advantage. Here, we use a quantum annealer with state-of-the-art techniques and benchmark its performance against classical solvers. To compare their performance, we solve over 50 optimization problem instances represented by large and dense Hamiltonian matrices using quantum and classical solvers. The results demonstrate that a state-of-the-art quantum solver has higher accuracy (~0.013%) and a significantly faster problem-solving time (~6561×) than the best classical solver. Our results highlight the advantages of leveraging QA over classical counterparts, particularly in hybrid configurations, for achieving high accuracy and substantially reduced problem solving time in large-scale real-world optimization problems.

arXiv:2504.06201•npj Quantum Information•May 16, 2025•70 citations
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.
Optimization of electricity surplus is a crucial element for transmission power networks since it leads to reducing costs as well as increasing efficiency across the network as a whole. In this paper, we show how to optimize such network costs using a quantum annealing approach. First, we define the Quadratic Unconstrained Binary Optimization (QUBO) problem for network partitioning. To achieve this, we introduce a method to translate inequality constraints with real-valued coefficients into approximate penalty functions. Next, we test the implementation on purely quantum and quantum-classical hybrid architectures. We then solve the problem using the D-Wave hybrid Constrained Quadratic Model (CQM) solver, the D-Wave hybrid Binary Quadratic Model (BQM) solver, as well as classical solvers available on Azure Quantum Cloud. Finally, we find that the value of the objective function obtained with the quantum-classical hybrid solvers is always lower compared to the classical approaches across a range of different problem sizes. This demonstrates that the quantum-classical hybrid methods outperform the classical methods in terms of solution quality.
This paper evaluates quantum annealing as a potential method for solving multi-path routing in large-scale quantum communication networks. The routing problem was formulated as a quadratic unconstrained binary optimization (QUBO) problem that minimizes negative throughput while satisfying quantum network constraints. The experimental framework tests four solution approaches on randomly generated networks: (1) the classical quantum fidelity rate maximizing (Q-FiRM) algorithm, (2) classical simulated annealing, (3) D-Wave hybrid solver, and (4) pure quantum annealing on D-Wave Advantage2 hardware. Results show that while quantum annealers produce feasible solutions, the classical Q-FiRM algorithm achieves superior throughput and faster computation times for this problem class. Among QUBO approaches, hybrid solvers demonstrate computational advantages over pure classical simulated annealing while maintaining comparable solution quality. These findings provide practical insight into the current capabilities and limitations of quantum optimization for quantum internet infrastructure design.
Recent advances in quantum computing have shown great potential for solving combinatorial optimization problems. A notable example is the quadratic knapsack problem, a constrained binary optimization problem. However, current quantum-inspired algorithms require Quadratic Unconstrained Binary Optimization (QUBO) formulations. Transforming constrained optimization into QUBO impacts the algorithms' speed and efficiency. In this study, we evaluate five existing transformation methods and propose four novel approaches. We assess them by using Simulated Annealing (SA), and find that three of our approaches outperform existing methods in terms of execution time as well as quality and quantity of feasible solutions found. Also, we tested these transformations on a quantum annealer, which was unable to solve even small instances, due to limitations in connectivity and error rates. In general, our results highlight the advantages of the new approaches, which reduce the number of variables in the QUBO representation.
This paper proposes the use of annealing-based quantum computing for solving combinatorial optimal power flow problems. Quantum annealers provide a physical computing platform which utilises quantum phase transitions to solve specific classes of combinatorial problems. These devices have seen rapid increases in scale and performance, and are now approaching the point where they could be valuable for industrial applications. This paper shows how an optimal power flow problem incorporating linear multiphase network modelling, discrete sources of energy flexibility, renewable generation placement/sizing and network upgrade decisions can be formulated as a quadratic unconstrained binary optimisation problem, which can be solved by quantum annealing. Case studies with these components integrated with the IEEE European Low Voltage Test Feeder are implemented using D-Wave Systems’ 5,760 qubit Advantage quantum processing unit and hybrid quantum-classical solver.
In many complex networking systems, identifying critical nodes whose removal maximally disrupts network connectivity remains an important yet computationally challenging problem for network vulnerability analysis. Finding near-optimal solutions is known to be NP-hard. In this paper, we explore the potential of near-term quantum computing devices to efficiently solve the k-Critical Node Detection (k-CND) problem. We formulate the problem as a quadratic unconstrained binary optimization (QUBO), a mathematical optimization over binary variables amenable to solution on quantum annealers. We present a novel integer linear programming (ILP) formulation and its conversion into QUBOs and provide benchmarking results on D-Wave's quantum annealers. Our theoretical analysis proves that our proposed formulation, ILP2, generates substantially smaller QUBO than the state-of-the-art ILP1 formulation. Experimentally, our efficient QUBO yields a 59.7% decrease in QUBO variables on a graph with 10 vertices and 40 edges, and an 11.7% reduction in qubits on a 15-vertex, 22-edge graph compared to that of QUBO1. We analyze the solution quality and running time across quantum, classical, and hybrid solvers to assess the potential for quantum advantage. Our work showcases the promise and challenges of tackling this important graph problem on near-term quantum hardware.
Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of qubits and their connectivity, the QA hardware did not show such an advantage over classical methods in past benchmarking studies. Recent advancements in QA with more than 5000 qubits, enhanced qubit connectivity, and the hybrid architecture promise to realize the quantum advantage. Here, we use a quantum annealer with state-of-the-art techniques and benchmark its performance against classical solvers. To compare their performance, we solve over 50 optimization problem instances represented by large and dense Hamiltonian matrices using quantum and classical solvers. The results demonstrate that a state-of-the-art quantum solver has higher accuracy (~0.013%) and a significantly faster problem-solving time (~6561×) than the best classical solver. Our results highlight the advantages of leveraging QA over classical counterparts, particularly in hybrid configurations, for achieving high accuracy and substantially reduced problem solving time in large-scale real-world optimization problems.