IEEE Access · 2023 · 33 citations · 26 references
Natural SciencesComputer ScienceElectrical EngineeringOptimizationQuantum ComputingQuantum MechanicsConstrained OptimizationDiscrete OptimizationNetwork OptimizationQuadratic ProgrammingQuantum AlgorithmsQuantum AnnealingExact Penalty FunctionsNetwork PartitioningObjective Function FormulationObjective Function ValuePartitioningPower Network OptimizationQuadratic OptimizationQuantum Optimization Algorithms
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.
26
Ising formulations of many NP problems
Andrew Lucas · Frontiers in Physics · 2014 · 2.5K citations · Full text
Computing, Computer Science, Physics +15
Some simplified NP-complete graph problems
M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations
A Quantum Approximate Optimization Algorithm
Edward Farhi, Jeffrey Goldstone, Sam Gutmann · arXiv (Cornell University) · 2014 · 1.8K citations · Full text