arXiv subjects

Corey O'Meara

Publications and source records attributed to Corey O'Meara.

29 records · Page 2Linked to original sources

arXiv2024

A Machine Learning Approach to Boost the Vehicle-2-Grid Scheduling

Electric Vehicles (EVs) are emerging as battery energy storage systems (BESSs) of increasing importance for different power grid services. However, the unique characteristics of EVs makes them more difficult to operate than dedicated BESSs. In this work, we apply a data-driven learning approach to leverage EVs as a BESS to provide capacity-related services to the grid. The approach uses machine learning to predict how to charge and discharge EVs while satisfying their operational constraints. As a paradigm application, we use flexible energy commercialization in the wholesale markets, but the approach can be applied to a broader range of capacity-related grid services. We evaluate the proposed approach numerically and show that when the number of EVs is large, we can obtain comparable objective values to CPLEX and approximate dynamic programming, but with shorter run times. These reduced run times are important because they allow us to (re)optimize frequently to adapt to the time-varying system conditions.

math.OC↗

arXiv2024

Bridging the Gap to Next Generation Power System Planning and Operation with Quantum Computation

Innovative solutions and developments are being inspected to tackle rising electrical power demand to be supplied by clean forms of energy. The integration of renewable energy generations, varying nature loads, importance of active role of distribution system and consumer participation in grid operation has changed the landscape of classical power grids. Implementation of smarter applications to plan, monitor, operate the grid safely are deemed paramount for efficient, secure and reliable functioning of grid. Although sophisticated computations to process gigantic volume of data to produce useful information in a time critical manner is the paradigm of future grid operations, it brings along the burden of computational complexity. Advancements in quantum technologies holds promising solution for dealing with demanding computational complexity of power system related applications. In this article, we lay out clear motivations for seeking quantum solutions for solving computational burden challenges associated with power system applications. Next we present an overview of quantum solutions for various power system related applications available in current literature and suggest future topics for research. We further highlight challenges with existing quantum solutions for exploiting full quantum capabilities. Additionally, this paper serves as a bridge for power engineers to the quantum world by outlining essential quantum computation fundamentals for enabling smoother transition to future of power system computations.

quant-ph↗

arXiv2024

Conditions for a quadratic quantum speedup in nonlinear transforms with applications to energy contract pricing

Computing nonlinear functions over multilinear forms is a general problem with applications in risk analysis. For instance in the domain of energy economics, accurate and timely risk management demands for efficient simulation of millions of scenarios, largely benefiting from computational speedups. We develop a novel hybrid quantum-classical algorithm based on polynomial approximation of nonlinear functions, computed through Quantum Hadamard Products, and we rigorously assess the conditions for its end-to-end speedup for different implementation variants against classical algorithms. In our setting, a quadratic quantum speedup, up to polylogarithmic factors, can be proven only when forms are bilinear and approximating polynomials have second degree, if efficient loading unitaries are available for the input data sets. We also enhance the bidirectional encoding, that allows tuning the balance between circuit depth and width, proposing an improved version that can be exploited for the calculation of inner products. Lastly, we exploit the dynamic circuit capabilities, recently introduced on IBM Quantum devices, to reduce the average depth of the Quantum Hadamard Product circuit. A proof of principle is implemented and validated on IBM Quantum systems.

quant-ph↗

arXiv2024

Incentivising Demand Side Response through Discount Scheduling using Hybrid Quantum Optimization

Demand Side Response (DSR) is a strategy that enables consumers to actively participate in managing electricity demand. It aims to alleviate strain on the grid during high demand and promote a more balanced and efficient use of (renewable) electricity resources. We implement DSR through discount scheduling, which involves offering discrete price incentives to consumers to adjust their electricity consumption patterns to times when their local energy mix consists of more renewable energy. Since we tailor the discounts to individual customers' consumption, the Discount Scheduling Problem (DSP) becomes a large combinatorial optimization task. Consequently, we adopt a hybrid quantum computing approach, using D-Wave's Leap Hybrid Cloud. We benchmark Leap against Gurobi, a classical Mixed Integer optimizer in terms of solution quality at fixed runtime and fairness in terms of discount allocation. Furthermore, we propose a large-scale decomposition algorithm/heuristic for the DSP, applied with either quantum or classical computers running the subroutines, which significantly reduces the problem size while maintaining solution quality. Using synthetic data generated from real-world data, we observe that the classical decomposition method obtains the best overall \newp{solution quality for problem sizes up to 3200 consumers, however, the hybrid quantum approach provides more evenly distributed discounts across consumers.

quant-ph↗

arXiv2024

Quantum Optimization for the Future Energy Grid: Summary and Quantum Utility Prospects

In this project summary paper, we summarize the key results and use-cases explored in the German Federal Ministry of Education and Research (BMBF) funded project "Q-GRID" which aims to assess potential quantum utility optimization applications in the electrical grid. The project focuses on two layers of optimization problems relevant to decentralized energy generation and transmission as well as novel energy transportation/exchange methods such as Peer-2-Peer energy trading and microgrid formation. For select energy grid optimization problems, we demonstrate exponential classical optimizer runtime scaling even for small problem instances, and present initial findings that variational quantum algorithms such as QAOA and hybrid quantum annealing solvers may provide more favourable runtime scaling to obtain similar solution quality. These initial results suggest that quantum computing may be a key enabling technology in the future energy transition insofar that they may be able to solve business problems which are already challenging at small problem instance sizes.

quant-ph↗

arXiv2023

Energy risk analysis with Dynamic Amplitude Estimation and Piecewise Approximate Quantum Compiling

We generalize the Approximate Quantum Compiling algorithm into a new method for CNOT-depth reduction, which is apt to process wide target quantum circuits. Combining this method with state-of-the-art techniques for error mitigation and circuit compiling, we present a 10-qubit experimental demonstration of Iterative Amplitude Estimation on a quantum computer. The target application is the derivation of the Expected Value of contract portfolios in the energy industry. In parallel, we also introduce a new variant of the Quantum Amplitude Estimation algorithm which we call Dynamic Amplitude Estimation, as it is based on the dynamic circuit capability of quantum devices. The algorithm achieves a reduction in the circuit width in the order of the binary precision compared to the typical implementation of Quantum Amplitude Estimation, while simultaneously decreasing the number of quantum-classical iterations (again in the order of the binary precision) compared to the Iterative Amplitude Estimation. The calculation of the Expected Value, VaR and CVaR of contract portfolios on quantum hardware provides a proof of principle of the new algorithm.

quant-ph↗

arXiv2022

Practical Quantum K-Means Clustering: Performance Analysis and Applications in Energy Grid Classification

In this work, we aim to solve a practical use-case of unsupervised clustering which has applications in predictive maintenance in the energy operations sector using quantum computers. Using only cloud access to quantum computers, we complete a thorough performance analysis of what some current quantum computing systems are capable of for practical applications involving non-trivial mid-to-high dimensional datasets. We first benchmark how well distance estimation can be performed using two different metrics based on the swap-test, using angle and amplitude data embedding. Next, for the clustering performance analysis, we generate sets of synthetic data with varying cluster variance and compare simulation to physical hardware results using the two metrics. From the results of this performance analysis, we propose a general, competitive, and parallelized version of quantum $k$-means clustering to avoid some pitfalls discovered due to noisy hardware and apply the approach to a real energy grid clustering scenario. Using real-world German electricity grid data, we show that the new approach improves the balanced accuracy of the standard quantum $k$-means clustering by $67.8\%$ with respect to the labeling of the classical algorithm.

quant-ph↗

arXiv2022

Towards AutoQML: A Cloud-Based Automated Circuit Architecture Search Framework

The learning process of classical machine learning algorithms is tuned by hyperparameters that need to be customized to best learn and generalize from an input dataset. In recent years, Quantum Machine Learning (QML) has been gaining traction as a possible application of quantum computing which may provide quantum advantage in the future. However, quantum versions of classical machine learning algorithms introduce a plethora of additional parameters and circuit variations that have their own intricacies in being tuned. In this work, we take the first steps towards Automated Quantum Machine Learning (AutoQML). We propose a concrete description of the problem, and then develop a classical-quantum hybrid cloud architecture that allows for parallelized hyperparameter exploration and model training. As an application use-case, we train a quantum Generative Adversarial neural Network (qGAN) to generate energy prices that follow a known historic data distribution. Such a QML model can be used for various applications in the energy economics sector.

quant-ph↗

arXiv2021

Community Detection in Electrical Grids Using Quantum Annealing

With the increase of intermittent renewable generation resources feeding into the electrical grid, Distribution System Operators (DSOs) must find ways to incorporate these new actors and adapt the grid to ensure stability and enable flexibility. Dividing the grid into logical clusters entails several organization and technical benefits, helping overcome these challenges.However, finding the optimal grid partitioning remains a challenging task due to its complexity. At the same time, a new technology has gained traction in the last decades for its promising speed-up potential in solving non-trivial combinatorial optimization problems: quantum computing. This work explores its application in Graph Partitioning using electrical modularity. We benchmarked several quantum annealing and hybrid methods on IEEE well-known test cases. The results obtained for the IEEE 14-bus test case show that quantum annealing DWaveSampler brings equal solutions or, for the optimal number partitions, a 1% improvement. For the more significant test cases, hybrid quantum annealing shows a relative error of less than 0.02% compared to the classical benchmark and for IEEE 118-bus test case shows time performance speed-up. The increment in performance would enable real time planning and operations of electrical grids in real time. This work intends to be the first step to showcase the potentials of quantum computing towards the modernization and adaption of electrical grids to the decentralized future of energy systems.

quant-ph↗

arXiv2021

Hybrid Classical-Quantum Autoencoder for Anomaly Detection

We propose a Hybrid classical-quantum Autoencoder (HAE) model, which is a synergy of a classical autoencoder (AE) and a parametrized quantum circuit (PQC) that is inserted into its bottleneck. The PQC augments the latent space, on which a standard outlier detection method is applied to search for anomalous data points within a classical dataset. Using this model and applying it to both standard benchmarking datasets, and a specific use-case dataset which relates to predictive maintenance of gas power plants, we show that the addition of the PQC leads to a performance enhancement in terms of precision, recall, and F1 score. Furthermore, we probe different PQC Ansätze and analyse which PQC features make them effective for this task.

quant-ph↗

arXiv2012

Self-Dual Maps and Symmetric Bistochastic Matrices

The H-unistochastic matrices are a special class of symmetric bistochastic matrices obtained by taking the square of the absolute value of each entry of a Hermitian unitary matrix. We examine the geometric relationship of the convex hull of the n by n H-unistochastic matrices relative to the larger convex set of n by n symmetric bistochastic matrices. We show that any line segment in the convex set of the n by n symmetric bistochastic matrices which passes through the centroid of this convex set must spend at least two-thirds of its length in the convex hull of the n by n H-unistochastic matrices when n is either three or four and we prove a partial result for higher n. A class of completely positive linear maps called the self-dual doubly stochastic maps is useful for studying this problem. Some results on self-dual doubly stochastic maps are given including a self-dual version of the Laudau-Streater theorem.

math.OA↗