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

Estudi dels Algorismes d'Optimització per a Computadores Quàntiques Basades en Qubits Superconductors

Pedrals Mansilla, Carles

Published Oct 30, 2024• 0 citations
OpenAlex

Abstract

Quantum computing represents a significant advancement in computational science, offering the potential to address problems through fundamentally different computational paradigms from classical computers. One of the current prime candidates to potentially demonstrate a quantum advantage on near-term Noisy Intermediate Scale Quantum (NISQ) devices is the Quantum Approximate Optimization Algorithm (QAOA). A highly promising application of this algorithm is to tackle modern NP-hard optimization problems. In this study, the application of the QAOA algorithm is tested on an energy grid problem, aiming at the allocation of renewable energy sources, pivotal to achieving Europe's Net-Zero goal by 2050. The focus is on the Scandinavian power grid and evaluating different strategies for performing parameter optimization of QAOA ansatz circuits under various initialization strategies. This process combines fine-tuning parameters using both quantum and classical methods. Multiple extensions inspired by literature such as the Multiangle Approach, initial parameter distributions, and diverse methodologies are explored and their efficiency is discussed, highlighting Gaussian distribution as a great naive option. A new approach to improve convergence using neural networks is proposed and many techniques are applied to envision an efficient quantum algorithm capable of handling real-time demand of power grid partitioning. Error rates are discussed and the applicability of such technologies in this field is questioned rigorously.

Related papers

Quantum Approximate Optimization Algorithm (QAOA) for Solving NP-Hard Problems

Srikanth Kilaru, Thota Sravya Vardhani, Attluri Udaya Lakshmi +2 more

The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm used to study NP-hard combinatorial optimization problems. In this work, we focused on optimization strategies for QAOA including circuit depth reduction, parameter parallelization, and hybrid classical feedback mechanisms. We will consider the application of QAOA to different types of NP-hard problems such as Max-Cut and Vehicle Routing Problem (VRP) and discuss the advantages and disadvantages of each in terms of approximation quality and cost of computation. The comparative simulation on the various qubit counts and depth layers points out the limits of scalability and the constraints of hardware on the current Noisy Intermediate-Scale Quantum (NISQ) devices. And also an improved divide-and-conquer strategy is presented in which parameter reusability and gradient-informed initialization are combined to boost convergence rates. The results of the experiment show that it is more efficient and scalable while maintaining the competitive approximation performance compared to the baseline QAOA. The experimental validation focuses on representative small-size instances, while the proposed framework provides extensions for scalable implementations. Ultimately, this work is a step towards the realization of efficient, hardware-aware, and scalable optimization strategies, thus opening up the practical deployment of QAOA on the quantum systems of the next few years.

IEEE Nexo-Tech International Conference on Advanced Technologies and Innovations (ICATI)•May 8, 2026•0 citations

Application of Quantum Computing for Power Systems

Yan Li, Ganesh Kumar Venayagamoorthy, Liang Du

Quantum technology is at the forefront of a revolutionary approach to addressing the intricate computational challenges encountered in modern power systems. This innovative methodology holds exceptional promise, particularly in the context of power systems dominated by distributed energy resources (DERs), which play a pivotal role in the advancement of energy sustainability. Grounded in fundamental quantum principles like superposition and entanglement, quantum computing presents a paradigm shift in tackling complex problems within the realm of renewable energy. Its remarkable capabilities translate into accelerated computations that can optimize power flow, manage DERs, and fortify grid stability. Quantum algorithms, with their innate ability to distill actionable insights from large data sets, enable more efficient predictions, improve energy management strategies, and contribute to a reduced environmental impact. One of the key tools in the quantum arsenal for power system optimization is the Quantum Approximate Optimization Algorithm (QAOA). This algorithm offers an efficient means to search for optimization solutions, but its performance is critical to key parameters. Introducing a novel approach, the data-driven QAOA method leverages the normalized graph density as a foundation. It facilitates the transfer of quasi-optimal parameters between graphs, optimizing the efficiency of the algorithm. Despite current limitations in the field of quantum computing, its potential to revolutionize the renewable energy sector remains undeniable. It offers a transformative pathway toward a future characterized by greater energy efficiency, sustainability, and resilience. Quantum computing represents a beacon of hope for the power systems of tomorrow, where efficiency and environmental stewardship converge for a brighter energy landscape.

Wiley eBooks•Feb 26, 2025•9 citations

Quantum Computing for Power Electronics: Quantum Machine Learning Approaches for IoT-Enabled Grid Optimization

Seepuram Srinivas Kumar, Heena Kausar

The increasing complexity of modern power grids, driven by the integration of renewable energy sources, decentralized energy generation, and dynamic load variations, necessitates advanced computational approaches for efficient grid optimization. Conventional algorithms often struggle with the high-dimensionality and computational intensity of power system optimization problems, prompting the exploration of quantum computing as a transformative alternative. Quantum computing, particularly quantum machine learning (QML) and quantum optimization algorithms, has demonstrated significant potential in accelerating grid stability analysis, energy dispatch, and fault detection. This chapter provides a comprehensive investigation into quantum computing applications for power electronics, focusing on quantum-inspired machine learning models and hybrid quantum-classical frameworks for IoT-enabled smart grids. The potential advantages of quantum algorithms, including the Quantum Approximate Optimization Algorithm (QAOA), Variational Quantum Eigensolver (VQE), and Grover’s search algorithm, are analyzed in the context of grid optimization, fault detection, and cybersecurity. Additionally, a comparative analysis of classical and quantum machine learning techniques highlights key performance differences and the challenges associated with practical quantum implementations. Despite the promising advancements, several challenges, including quantum hardware limitations, noise susceptibility, and scalability issues, must be addressed for real-world deployment. Future directions emphasize the need for noise-resilient quantum algorithms, efficient hybrid architectures, and quantum-inspired classical methods to bridge the gap between existing computational techniques and next-generation quantum solutions for power grid management.

•Mar 17, 2025•1 citation

Quantum Computing For Combinatorial Optimization: Algorithms, Complexity Analysis, And Real-World Applications.

G. Swapna, P. Sunil

Combinatorial optimization problems play a vital role in computer science and engineering, with applications in logistics, network design, finance, and resource allocation. However, many of these problems are NP-hard, making them computationally expensive to solve using classical optimization techniques, especially for large-scale instances. In recent years, quantum computing has emerged as a promising paradigm capable of addressing these limitations by leveraging quantum mechanical principles such as superposition and entanglement. This study investigates the application of quantum computing for solving combinatorial optimization problems, with a focus on algorithm design, complexity analysis, and real-world applicability. The research primarily employs the Quantum Approximate Optimization Algorithm (QAOA) and Grover's search algorithm to solve representative problems such as Max-Cut and the Knapsack problem. The performance of these algorithms is evaluated using key metrics including accuracy, execution time, and approximation ratio, and is compared with classical optimization techniques. The results demonstrate that QAOA is capable of generating near-optimal solutions, achieving accuracy levels of up to 93% for small problem instances. However, the study also highlights the challenges associated with current quantum systems, including noise, limited qubit availability, and increased execution time. Comparative analysis reveals that while classical methods remain more efficient for small-scale problems, quantum algorithms show significant potential for scalability and handling complex optimization tasks. The findings suggest that hybrid quantum-classical approaches offer a practical solution in the current Noisy Intermediate-Scale Quantum (NISQ) era. The study concludes that although quantum computing is still evolving, it holds strong potential for transforming combinatorial optimization in the future.

•Jan 1, 2026•0 citations

Quantum Optimization, Machine Learning, Annealing, and Neural Networks

Pascal Halffmann, Shivam Kumar Sharma

This chapter investigates the application of quantum computing to optimization, a field traditionally dominated by classical methods but increasingly limited by computational demands in tackling complex, large-scale problems. The discussion focuses on quantum optimization techniques, particularly variational quantum algorithms like the Quantum Approximate Optimization Algorithm (QAOA) and the variational quantum eigensolver (VQE), along with quantum annealing (QA), a process inspired by physical annealing that leverages quantum tunnelling and superposition. The chapter also explores the integration of quantum approaches within machine learning frameworks, where quantum algorithms can potentially accelerate model training and enhance capabilities. Additionally, it presents practical applications and challenges associated with these quantum algorithms, covering their effectiveness on noisy intermediate-scale quantum (NISQ) devices and the evolving landscape of quantum hardware. This chapter concludes with insights into quantum optimization's future potential to address optimization and machine learning challenges that are currently intractable for classical methods, marking a significant shift in computational science.

CRC Press eBooks•Jan 14, 2025•7 citations

Quantum Approximate Optimization Algorithm on Different Qubit Systems

Seongmin Kim, In‐Saeng Suh, E. A. Coello Pérez +6 more

Solving optimization problems is critical across many research domains, but the high dimensionality of parameter spaces often poses significant challenges. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for accelerating optimization in the Noisy Intermediate-Scale Quantum (NISQ) era by leveraging both classical and quantum computational resources. However, its performance can vary depending on the underlying quantum hardware architecture. In this work, we evaluate the performance of QAOA on different quantum hardware platforms, specifically, superconducting transmon qubits and trapped-ion qubits, targetting real-world optimization problems formulated as fully connected Quadratic Unconstrained Binary Optimization (QUBO) instances. We evaluate both the solution quality and time-to-solution using dense QUBO matrices. Furthermore, we show that large-scale problems, such as a 100-bit QUBO instance, can be effectively tackled by integrating quantum computing with high-performance computing (HPC) resources. This study provides practical insights into the strengths and limitations of different qubit technologies and advances the application of quantum computing in solving real-world optimization problems.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations
Quantum computing represents a significant advancement in computational science, offering the potential to address problems through fundamentally different computational paradigms from classical computers. One of the current prime candidates to potentially demonstrate a quantum advantage on near-term Noisy Intermediate Scale Quantum (NISQ) devices is the Quantum Approximate Optimization Algorithm (QAOA). A highly promising application of this algorithm is to tackle modern NP-hard optimization problems. In this study, the application of the QAOA algorithm is tested on an energy grid problem, aiming at the allocation of renewable energy sources, pivotal to achieving Europe's Net-Zero goal by 2050. The focus is on the Scandinavian power grid and evaluating different strategies for performing parameter optimization of QAOA ansatz circuits under various initialization strategies. This process combines fine-tuning parameters using both quantum and classical methods. Multiple extensions inspired by literature such as the Multiangle Approach, initial parameter distributions, and diverse methodologies are explored and their efficiency is discussed, highlighting Gaussian distribution as a great naive option. A new approach to improve convergence using neural networks is proposed and many techniques are applied to envision an efficient quantum algorithm capable of handling real-time demand of power grid partitioning. Error rates are discussed and the applicability of such technologies in this field is questioned rigorously.
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm used to study NP-hard combinatorial optimization problems. In this work, we focused on optimization strategies for QAOA including circuit depth reduction, parameter parallelization, and hybrid classical feedback mechanisms. We will consider the application of QAOA to different types of NP-hard problems such as Max-Cut and Vehicle Routing Problem (VRP) and discuss the advantages and disadvantages of each in terms of approximation quality and cost of computation. The comparative simulation on the various qubit counts and depth layers points out the limits of scalability and the constraints of hardware on the current Noisy Intermediate-Scale Quantum (NISQ) devices. And also an improved divide-and-conquer strategy is presented in which parameter reusability and gradient-informed initialization are combined to boost convergence rates. The results of the experiment show that it is more efficient and scalable while maintaining the competitive approximation performance compared to the baseline QAOA. The experimental validation focuses on representative small-size instances, while the proposed framework provides extensions for scalable implementations. Ultimately, this work is a step towards the realization of efficient, hardware-aware, and scalable optimization strategies, thus opening up the practical deployment of QAOA on the quantum systems of the next few years.
Quantum technology is at the forefront of a revolutionary approach to addressing the intricate computational challenges encountered in modern power systems. This innovative methodology holds exceptional promise, particularly in the context of power systems dominated by distributed energy resources (DERs), which play a pivotal role in the advancement of energy sustainability. Grounded in fundamental quantum principles like superposition and entanglement, quantum computing presents a paradigm shift in tackling complex problems within the realm of renewable energy. Its remarkable capabilities translate into accelerated computations that can optimize power flow, manage DERs, and fortify grid stability. Quantum algorithms, with their innate ability to distill actionable insights from large data sets, enable more efficient predictions, improve energy management strategies, and contribute to a reduced environmental impact. One of the key tools in the quantum arsenal for power system optimization is the Quantum Approximate Optimization Algorithm (QAOA). This algorithm offers an efficient means to search for optimization solutions, but its performance is critical to key parameters. Introducing a novel approach, the data-driven QAOA method leverages the normalized graph density as a foundation. It facilitates the transfer of quasi-optimal parameters between graphs, optimizing the efficiency of the algorithm. Despite current limitations in the field of quantum computing, its potential to revolutionize the renewable energy sector remains undeniable. It offers a transformative pathway toward a future characterized by greater energy efficiency, sustainability, and resilience. Quantum computing represents a beacon of hope for the power systems of tomorrow, where efficiency and environmental stewardship converge for a brighter energy landscape.
The increasing complexity of modern power grids, driven by the integration of renewable energy sources, decentralized energy generation, and dynamic load variations, necessitates advanced computational approaches for efficient grid optimization. Conventional algorithms often struggle with the high-dimensionality and computational intensity of power system optimization problems, prompting the exploration of quantum computing as a transformative alternative. Quantum computing, particularly quantum machine learning (QML) and quantum optimization algorithms, has demonstrated significant potential in accelerating grid stability analysis, energy dispatch, and fault detection. This chapter provides a comprehensive investigation into quantum computing applications for power electronics, focusing on quantum-inspired machine learning models and hybrid quantum-classical frameworks for IoT-enabled smart grids. The potential advantages of quantum algorithms, including the Quantum Approximate Optimization Algorithm (QAOA), Variational Quantum Eigensolver (VQE), and Grover’s search algorithm, are analyzed in the context of grid optimization, fault detection, and cybersecurity. Additionally, a comparative analysis of classical and quantum machine learning techniques highlights key performance differences and the challenges associated with practical quantum implementations. Despite the promising advancements, several challenges, including quantum hardware limitations, noise susceptibility, and scalability issues, must be addressed for real-world deployment. Future directions emphasize the need for noise-resilient quantum algorithms, efficient hybrid architectures, and quantum-inspired classical methods to bridge the gap between existing computational techniques and next-generation quantum solutions for power grid management.
Combinatorial optimization problems play a vital role in computer science and engineering, with applications in logistics, network design, finance, and resource allocation. However, many of these problems are NP-hard, making them computationally expensive to solve using classical optimization techniques, especially for large-scale instances. In recent years, quantum computing has emerged as a promising paradigm capable of addressing these limitations by leveraging quantum mechanical principles such as superposition and entanglement. This study investigates the application of quantum computing for solving combinatorial optimization problems, with a focus on algorithm design, complexity analysis, and real-world applicability. The research primarily employs the Quantum Approximate Optimization Algorithm (QAOA) and Grover's search algorithm to solve representative problems such as Max-Cut and the Knapsack problem. The performance of these algorithms is evaluated using key metrics including accuracy, execution time, and approximation ratio, and is compared with classical optimization techniques. The results demonstrate that QAOA is capable of generating near-optimal solutions, achieving accuracy levels of up to 93% for small problem instances. However, the study also highlights the challenges associated with current quantum systems, including noise, limited qubit availability, and increased execution time. Comparative analysis reveals that while classical methods remain more efficient for small-scale problems, quantum algorithms show significant potential for scalability and handling complex optimization tasks. The findings suggest that hybrid quantum-classical approaches offer a practical solution in the current Noisy Intermediate-Scale Quantum (NISQ) era. The study concludes that although quantum computing is still evolving, it holds strong potential for transforming combinatorial optimization in the future.
This chapter investigates the application of quantum computing to optimization, a field traditionally dominated by classical methods but increasingly limited by computational demands in tackling complex, large-scale problems. The discussion focuses on quantum optimization techniques, particularly variational quantum algorithms like the Quantum Approximate Optimization Algorithm (QAOA) and the variational quantum eigensolver (VQE), along with quantum annealing (QA), a process inspired by physical annealing that leverages quantum tunnelling and superposition. The chapter also explores the integration of quantum approaches within machine learning frameworks, where quantum algorithms can potentially accelerate model training and enhance capabilities. Additionally, it presents practical applications and challenges associated with these quantum algorithms, covering their effectiveness on noisy intermediate-scale quantum (NISQ) devices and the evolving landscape of quantum hardware. This chapter concludes with insights into quantum optimization's future potential to address optimization and machine learning challenges that are currently intractable for classical methods, marking a significant shift in computational science.
Solving optimization problems is critical across many research domains, but the high dimensionality of parameter spaces often poses significant challenges. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for accelerating optimization in the Noisy Intermediate-Scale Quantum (NISQ) era by leveraging both classical and quantum computational resources. However, its performance can vary depending on the underlying quantum hardware architecture. In this work, we evaluate the performance of QAOA on different quantum hardware platforms, specifically, superconducting transmon qubits and trapped-ion qubits, targetting real-world optimization problems formulated as fully connected Quadratic Unconstrained Binary Optimization (QUBO) instances. We evaluate both the solution quality and time-to-solution using dense QUBO matrices. Furthermore, we show that large-scale problems, such as a 100-bit QUBO instance, can be effectively tackled by integrating quantum computing with high-performance computing (HPC) resources. This study provides practical insights into the strengths and limitations of different qubit technologies and advances the application of quantum computing in solving real-world optimization problems.