Assessing Quantum Computing Performance for Energy Optimization in a
Prosumer Community
- URL: http://arxiv.org/abs/2311.10594v1
- Date: Fri, 17 Nov 2023 15:48:51 GMT
- Title: Assessing Quantum Computing Performance for Energy Optimization in a
Prosumer Community
- Authors: Carlo Mastroianni, Francesco Plastina, Luigi Scarcello, Jacopo
Settino, Andrea Vinci
- Abstract summary: "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.
- Score: 1.072460284847973
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The efficient management of energy communities relies on the solution of the
"prosumer problem", i.e., the problem of scheduling the household loads on the
basis of the user needs, the electricity prices, and the availability of local
renewable energy, with the aim of reducing costs and energy waste. Quantum
computers can offer a significant breakthrough in treating this problem thanks
to the intrinsic parallel nature of quantum operations. The most promising
approach is to devise variational hybrid algorithms, in which quantum
computation is driven by parameters that are optimized classically, in a cycle
that aims at finding the best solution with a significant speed-up with respect
to classical approaches. This paper provides a reformulation of the prosumer
problem, allowing to address it with a hybrid quantum algorithm, namely,
Quantum Approximate Optimization Algorithm (QAOA), and with a recent variant,
the Recursive QAOA. We report on an extensive set of experiments, on simulators
and real quantum hardware, for different problem sizes. Results are encouraging
in that Recursive QAOA is able, for problems involving up to 10 qubits, to
provide optimal and admissible solutions with good probabilities, while the
computation time is nearly independent of the system size
Related papers
- Harnessing Inferior Solutions For Superior Outcomes: Obtaining Robust Solutions From Quantum Algorithms [0.0]
We adapt quantum algorithms to tackle robust optimization problems.
We present two innovative methods for obtaining robust optimal solutions.
Theses are applied on two use cases within the energy sector.
arXiv Detail & Related papers (2024-04-25T17:32:55Z) - Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems.
In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems.
We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
arXiv Detail & Related papers (2024-04-17T11:00:12Z) - Quantum Optimization for the Future Energy Grid: Summary and Quantum Utility Prospects [0.0]
"Q-GRID" 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.
arXiv Detail & Related papers (2024-03-26T08:52:54Z) - Graph Learning for Parameter Prediction of Quantum Approximate
Optimization Algorithm [14.554010382366302]
Quantum Approximate Optimization (QAOA) stands out for its potential to efficiently solve the Max-Cut problem.
We use Graph Neural Networks (GNN) as a warm-start technique to optimize QAOA, using GNN as a warm-start technique.
Our findings show GNN's potential in improving QAOA performance, opening new avenues for hybrid quantum-classical approaches in quantum computing.
arXiv Detail & Related papers (2024-03-05T20:23:25Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - Quantum Computing Approach for Energy Optimization in a Prosumer
Community [2.5008947886814186]
This paper presents a quantum approach for the formulation and solution of the prosumer problem, i.e., the problem of minimizing the energy cost incurred by a number of users in an energy community.
As the problem is NP-complete, a hybrid quantum/classical algorithm could help to acquire a significant speedup.
arXiv Detail & Related papers (2022-09-09T17:28:09Z) - Reducing the cost of energy estimation in the variational quantum
eigensolver algorithm with robust amplitude estimation [50.591267188664666]
Quantum chemistry and materials is one of the most promising applications of quantum computing.
Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
arXiv Detail & Related papers (2022-03-14T16:51:36Z) - 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) - Quantum mean value approximator for hard integer value problems [19.4417702222583]
We show that an optimization can be improved substantially by using an approximation rather than the exact expectation.
Together with efficient classical sampling algorithms, a quantum algorithm with minimal gate count can thus improve the efficiency of general integer-value problems.
arXiv Detail & Related papers (2021-05-27T13:03:52Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z) - Cross Entropy Hyperparameter Optimization for Constrained Problem
Hamiltonians Applied to QAOA [68.11912614360878]
Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications.
Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem.
In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
arXiv Detail & Related papers (2020-03-11T13:52:41Z)
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.