Formalizing, Normalizing, and Splitting the Energy Network Re-Dispatch for Quantum Annealing

• URL: http://arxiv.org/abs/2409.09857v1
• Date: Sun, 15 Sep 2024 20:29:40 GMT
• Title: Formalizing, Normalizing, and Splitting the Energy Network Re-Dispatch for Quantum Annealing
• Authors: Loong Kuan Lee, Johannes Knaute, Florian Gerhardt, Patrick Völker, Tomislav Maras, Alexander Dotterweich, Nico Piatkowski,
• Abstract summary: Adiabatic quantum computation (AQC) is a well-established method to approximate the ground state of a quantum system. In this work, we investigate issues in the context of energy network re-dispatch problems. Our results are compared to baselines from an open-source energy network simulation.
• Score: 37.81697222352684
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Adiabatic quantum computation (AQC) is a well-established method to approximate the ground state of a quantum system. Actual AQC devices, known as quantum annealers, have certain limitations regarding the choice of target Hamiltonian. Specifically, the target system must arise from a quadratic unconstrained binary optimization (QUBO) problem. As the name suggests, QUBOs represent unconstrained problems, and the problem must fit within the dimensionality limits of the hardware solver. However, various approaches exist to decompose large QUBOs and encode constraints by penalizing infeasible solutions. Choosing the right penalization and decomposition techniques is problem-specific and cumbersome due to various degrees of freedom. In this work, we investigate these issues in the context of energy network re-dispatch problems. Such problems are paramount for sustainable and cost-effective energy systems and play a crucial role in the transition towards renewable energy sources. Our QUBO instances are derived from open data of the German energy network and our results are compared to baselines from an open-source energy network simulation, thereby fostering reproducibility. Our novel insights regarding the realization of inequality constraints, spatio-temporal state consistency, and problem decomposition highlight the potential of AQC for optimizing complex energy dispatch problems. This provides valuable insights for energy market stakeholders and researchers aiming to improve grid management and reduce carbon emissions.

Related papers

• Early Exploration of a Flexible Framework for Efficient Quantum Linear Solvers in Power Systems [7.346769343315727]
  We introduce a versatile framework, powered by NWQSim, that bridges the gap between power system applications and quantum linear solvers available in Qiskit. Through innovative gate fusion strategies, reduced circuit depth, and GPU acceleration, our simulator significantly enhances resource efficiency.
  arXiv  Detail & Related papers  (2024-02-13T00:08:21Z)
• Reconfigurable Intelligent Surface (RIS)-Assisted Entanglement Distribution in FSO Quantum Networks [62.87033427172205]
  Quantum networks (QNs) relying on free-space optical (FSO) quantum channels can support quantum applications in environments where establishing an optical fiber infrastructure is challenging and costly. A reconfigurable intelligent surface (RIS)-assisted FSO-based QN is proposed as a cost-efficient framework providing a virtual line-of-sight between users for entanglement distribution.
  arXiv  Detail & Related papers  (2024-01-19T17:16:40Z)
• Assessing Quantum Computing Performance for Energy Optimization in a Prosumer Community [1.072460284847973]
  "Prosumer problem" is the problem of scheduling the household loads on the basis of the user needs, the electricity prices, and the availability of local renewable energy. Quantum computers can offer a significant breakthrough in treating this problem thanks to the intrinsic parallel nature of quantum operations. We report on an extensive set of experiments, on simulators and real quantum hardware, for different problem sizes.
  arXiv  Detail & Related papers  (2023-11-17T15:48:51Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• Quantum-Assisted Solution Paths for the Capacitated Vehicle Routing Problem [0.0]
  We discuss the Capacitated Vehicle Problem (CVRP) or its reduced variant, the Travelling Salesperson Problem (TSP) Even with today's most powerful classical algorithms, the CVRP is challenging to solve classically. Quantum computing may offer a way to improve the time to solution.
  arXiv  Detail & Related papers  (2023-04-19T13:03:50Z)
• Towards optimization under uncertainty for fundamental models in energy markets using quantum computers [0.0]
  We suggest a first approach to consider uncertainties in the renewable energy supply, power demand and machine failures. We show how to find cost-saving solutions of the UCP under these uncertainties on quantum computers.
  arXiv  Detail & Related papers  (2023-01-03T14:07:15Z)
• A Quantum Computing Approach for the Unit Commitment Problem [0.0]
  Planning energy production is a challenging task due to its cost-sensitivity, fast-moving energy markets, uncertainties in demand, and technical constraints of power plants. In this article, we model a UCP with minimum running and idle times as a unconstrained quadratic optimization problem to solve it on quantum computing hardware. First experiments confirm the advantages of our formulation in terms of qubit usage and connectivity and most importantly solution quality.
  arXiv  Detail & Related papers  (2022-12-13T11:01:42Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Risk-Aware Energy Scheduling for Edge Computing with Microgrid: A Multi-Agent Deep Reinforcement Learning Approach [82.6692222294594]
  We study a risk-aware energy scheduling problem for a microgrid-powered MEC network. We derive the solution by applying a multi-agent deep reinforcement learning (MADRL)-based advantage actor-critic (A3C) algorithm with shared neural networks.
  arXiv  Detail & Related papers  (2020-02-21T02:14:38Z)
• Einselection from incompatible decoherence channels [62.997667081978825]
  We analyze an open quantum dynamics inspired by CQED experiments with two non-commuting Lindblad operators. We show that Fock states remain the most robust states to decoherence up to a critical coupling.
  arXiv  Detail & Related papers  (2020-01-29T14:15:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.