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

IEEE Access

Modeling Energy Communities: A Case Study of Quantum Approximate Optimization on a Superconducting Processor

Mateo Alonso, Rodríguez Martínez, Pablo Díez-Valle, Ana Garbayo, Xela García‐Santiago, Gonzalo Blázquez Gil

Published Jan 1, 2025• 3 citations
Publisher

Abstract

This work explores the use of variational quantum algorithms to optimize energy distribution among users in energy communities, using real data from a community lab. This requires integrating various energy sources, storage solutions, and the ability to respond to variations in demand within energy systems, while maintaining the capacity to adapt to the variability of renewable energy sources. Given the increasing complexity as the problem size grows and the limitations of classical computing methods in addressing it, we study an approach that models the problem using QUBO and solves it applying quantum optimization algorithms. Our analysis includes a comparative study of two variational techniques, QAOA and VQE, and the implementation of the former on Qmio, an actual superconducting quantum processor. Although deploying QAOA on Qmio required specific adaptations to the hardware, we were able to achieve a shift of the probability distribution towards lower-energy solutions without error mitigation techniques, which highlights both QAOA’s potential and the intrinsic challenges of quantum optimization.

DOI
10.1109/access.2025.3578780

Related papers

Assessing Quantum Computing Performance for Energy Optimization in a Prosumer Community

Carlo Mastroianni, Francesco Plastina, Luigi Scarcello +2 more

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.

arXiv:2311.10594•IEEE Transactions on Smart Grid•Jun 14, 2023•41 citations

Modeling Energy Community Operations as a QUBO Problem for Quantum Optimization

Mateo Alonso, Xela García‐Santiago, Guillermo Moreno Rodríguez +1 more

Energy communities are collectives that manage their own production, distribution, and consumption of energy, usually from renewable sources. To increase efficiency and sustainability, the scheduling of the loads on the basis of the user needs, the electricity prices, the availability of local renewable energy and the battery storage capacity must be optimized. Quantum computing, leveraging principles like superposition and entanglement, offers new computational power for complex optimization tasks. This paper lays the basis for exploring the potential of quantum computing in optimizing the operation of energy communities by modeling the problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem.

XoveTIC Conference (XoveTIC)•Nov 1, 2024•0 citations

Energy Distribution Optimization Using Variational Quantum Algorithms

Guillermo Rubiños Rodríguez, Mateo Alonso, Xela García‐Santiago +1 more

Quantum computing is emerging as a key tool for enhancing energy management, particularly in areas like resource allocation and renewable energy distribution. Although fault-tolerant quantum computers are still in development, current Noisy Intermediate-Scale Quantum (NISQ) technology shows promise for solving optimization problems using variational quantum algorithms. In this paper, the energy distribution problem for a community with one battery is solved using the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) in quantum circuit simulators. This proof of concept provides insights into their potential and limitations for real-world energy applications.

XoveTIC Conference (XoveTIC)•Nov 1, 2024•0 citations

A case study of variational quantum algorithms for a job shop scheduling problem

David Amaro, Matthias Rosenkranz, Nathan Fitzpatrick +2 more

Abstract Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approaches. Variational quantum algorithms are optimization heuristics that can be demonstrated with available quantum hardware. In this case study, we apply four variational quantum heuristics running on IBM’s superconducting quantum processors to the job shop scheduling problem. Our problem optimizes a steel manufacturing process. A comparison on 5 qubits shows that the recent filtering variational quantum eigensolver (F-VQE) converges faster and samples the global optimum more frequently than the quantum approximate optimization algorithm (QAOA), the standard variational quantum eigensolver (VQE), and variational quantum imaginary time evolution (VarQITE). Furthermore, F-VQE readily solves problem sizes of up to 23 qubits on hardware without error mitigation post processing.

arXiv:2109.03745•EPJ Quantum Technology•Feb 10, 2022•98 citations

Evaluating the Quantum Approximate Optimization Algorithms for QUBO problems Across Quantum Hardware Platforms: Performance Analysis, Challenges, and Strategies

Teemu Pihkakoski, Aravind Plathanam Babu, Pauli Taipale +2 more

Quantum computers are expected to offer advantages in solving optimization problems challenging for classical computers. Quadratic Unconstrained Binary Optimization (QUBO) problems represent an important class of problems with relevance in finance and logistics. The Quantum Approximate Optimization Algorithm (QAOA) is a prominent candidate for solving QUBO problems on near-term quantum devices. In this paper, we evaluate the performance of both the standard QAOA and the adaptive derivative assembled problem tailored QAOA (ADAPT-QAOA) to solve QUBO problems of varying sizes and hardnesses for financial feature selection problems. Our main observation is that ADAPT-QAOA achieves substantially higher approximation ratios than standard QAOA for harder feature-selection problems (α = 0.6) with statistically significant improvements observed for problem sizes n = 6 and 14. However, the standard QAOA remains competitive for simpler problems. Additionally, we evaluate the practical feasibility and limitations of QAOA through a hardware-aware scaling analysis based on the real-device calibration data for various hardware platforms. We estimate that standard QAOA implementation on superconducting quantum computers provides a shorter time-to-solution compared to trapped-ion devices, while trapped-ion devices yield more favorable error rates. Our findings provide a comprehensive overview of the challenges, trade-offs, and strategies for deploying QAOA-based methods on near-term quantum hardware.

arXiv:2510.12336•Oct 14, 2025•2 citations

QAOA pseudo-Boltzmann sampling beyond the rapid-mixing regime on superconducting quantum computers

Feliks Kivelä, Pablo Díez-Valle, Juan José García‐Ripoll +1 more

Abstract The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm developed for solving combinatorial optimization problems. It has also been shown to generate pseudo-Boltzmann distributions, with potential applications in various fields of computer science and computational physics. In this work, we build upon previous theoretical results and demonstrate pseudo-Boltzmann sampling with single-layer QAOA on real superconducting quantum computers. We show that the pseudo-Boltzmann distribution and the ability to adjust its effective temperature survive the accumulated errors of a real, noisy superconducting quantum processor. On an IBM processor, we are able to reach temperatures below a classical minimum-temperature boundary that guarantees the rapid mixing of single-site Glauber dynamics. We also run controlled simulations of QAOA with various noise models to characterize how increasing error rates raises the effective temperature of the distribution and limits the lowest accessible temperature.

Quantum Science and Technology•Sep 17, 2026•0 citations
This work explores the use of variational quantum algorithms to optimize energy distribution among users in energy communities, using real data from a community lab. This requires integrating various energy sources, storage solutions, and the ability to respond to variations in demand within energy systems, while maintaining the capacity to adapt to the variability of renewable energy sources. Given the increasing complexity as the problem size grows and the limitations of classical computing methods in addressing it, we study an approach that models the problem using QUBO and solves it applying quantum optimization algorithms. Our analysis includes a comparative study of two variational techniques, QAOA and VQE, and the implementation of the former on Qmio, an actual superconducting quantum processor. Although deploying QAOA on Qmio required specific adaptations to the hardware, we were able to achieve a shift of the probability distribution towards lower-energy solutions without error mitigation techniques, which highlights both QAOA’s potential and the intrinsic challenges of quantum optimization.
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.
Energy communities are collectives that manage their own production, distribution, and consumption of energy, usually from renewable sources. To increase efficiency and sustainability, the scheduling of the loads on the basis of the user needs, the electricity prices, the availability of local renewable energy and the battery storage capacity must be optimized. Quantum computing, leveraging principles like superposition and entanglement, offers new computational power for complex optimization tasks. This paper lays the basis for exploring the potential of quantum computing in optimizing the operation of energy communities by modeling the problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem.
Quantum computing is emerging as a key tool for enhancing energy management, particularly in areas like resource allocation and renewable energy distribution. Although fault-tolerant quantum computers are still in development, current Noisy Intermediate-Scale Quantum (NISQ) technology shows promise for solving optimization problems using variational quantum algorithms. In this paper, the energy distribution problem for a community with one battery is solved using the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) in quantum circuit simulators. This proof of concept provides insights into their potential and limitations for real-world energy applications.
Abstract Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approaches. Variational quantum algorithms are optimization heuristics that can be demonstrated with available quantum hardware. In this case study, we apply four variational quantum heuristics running on IBM’s superconducting quantum processors to the job shop scheduling problem. Our problem optimizes a steel manufacturing process. A comparison on 5 qubits shows that the recent filtering variational quantum eigensolver (F-VQE) converges faster and samples the global optimum more frequently than the quantum approximate optimization algorithm (QAOA), the standard variational quantum eigensolver (VQE), and variational quantum imaginary time evolution (VarQITE). Furthermore, F-VQE readily solves problem sizes of up to 23 qubits on hardware without error mitigation post processing.
Quantum computers are expected to offer advantages in solving optimization problems challenging for classical computers. Quadratic Unconstrained Binary Optimization (QUBO) problems represent an important class of problems with relevance in finance and logistics. The Quantum Approximate Optimization Algorithm (QAOA) is a prominent candidate for solving QUBO problems on near-term quantum devices. In this paper, we evaluate the performance of both the standard QAOA and the adaptive derivative assembled problem tailored QAOA (ADAPT-QAOA) to solve QUBO problems of varying sizes and hardnesses for financial feature selection problems. Our main observation is that ADAPT-QAOA achieves substantially higher approximation ratios than standard QAOA for harder feature-selection problems (α = 0.6) with statistically significant improvements observed for problem sizes n = 6 and 14. However, the standard QAOA remains competitive for simpler problems. Additionally, we evaluate the practical feasibility and limitations of QAOA through a hardware-aware scaling analysis based on the real-device calibration data for various hardware platforms. We estimate that standard QAOA implementation on superconducting quantum computers provides a shorter time-to-solution compared to trapped-ion devices, while trapped-ion devices yield more favorable error rates. Our findings provide a comprehensive overview of the challenges, trade-offs, and strategies for deploying QAOA-based methods on near-term quantum hardware.
Abstract The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm developed for solving combinatorial optimization problems. It has also been shown to generate pseudo-Boltzmann distributions, with potential applications in various fields of computer science and computational physics. In this work, we build upon previous theoretical results and demonstrate pseudo-Boltzmann sampling with single-layer QAOA on real superconducting quantum computers. We show that the pseudo-Boltzmann distribution and the ability to adjust its effective temperature survive the accumulated errors of a real, noisy superconducting quantum processor. On an IBM processor, we are able to reach temperatures below a classical minimum-temperature boundary that guarantees the rapid mixing of single-site Glauber dynamics. We also run controlled simulations of QAOA with various noise models to characterize how increasing error rates raises the effective temperature of the distribution and limits the lowest accessible temperature.