Quantum annealing (QA) leverages quantum tunneling to address NP-hard optimisation problems, offering significant potential to meet power system challenges in the progress of renewable transition towards Net Zero. This paper reviews recent QA research and development towards solving power engineering problems, classifying them into different power system domain of applications. A generalised modelling guide tailored to D-Wave's quantum annealers is also provided. While QA shows promise for faster convergence, the challenges including scalability, noise, and embedding overhead are also discussed. This review aims to provide cross-disciplinary references and guides for power engineering and quantum computing communities.
Quantum annealing (QA) leverages quantum tunneling to address NP-hard optimisation problems, offering significant potential to meet power system challenges in the progress of renewable transition towards Net Zero. This paper reviews recent QA research and development towards solving power engineering problems, classifying them into different power system domain of applications. A generalised modelling guide tailored to D-Wave's quantum annealers is also provided. While QA shows promise for faster convergence, the challenges including scalability, noise, and embedding overhead are also discussed. This review aims to provide cross-disciplinary references and guides for power engineering and quantum computing communities.
Quantum annealing is a computational paradigm in which optimisation problems are mapped onto the energy landscape of an interacting quantum system and explored through its dynamical evolution. By continuously transforming a simple initial Hamiltonian into one whose ground state encodes the solution, the system traverses a complex landscape via a combination of quantum fluctuations, tunnelling processes, and dissipative dynamics. Unlike gate-based quantum computing, quantum annealing is a specialised and near-term approach aimed primarily at discrete optimisation and sampling tasks. While it is not expected to provide polynomial-time solutions to NP-hard problems in the worst case, it offers a physically motivated heuristic for navigating rugged energy landscapes that arise across science and engineering. Modern quantum annealers realise programmable spin systems with thousands of qubits, placing them among the largest controllable quantum devices currently available. As a result, their significance extends beyond optimisation: they also function as experimental platforms for studying non-equilibrium many-body quantum dynamics in regimes that are difficult to access using classical simulation. In this review we present an accessible introduction to the principles of quantum annealing, describe the main hardware platforms and algorithmic techniques, and analyse how tunnelling, spectral gaps, and open-system effects shape computational performance. We survey applications ranging from optimisation and machine learning to quantum simulation and many-body physics, and discuss the central challenges in benchmarking, scaling, and control. These perspectives position quantum annealing as a distinctive framework at the interface of optimisation, stochastic sampling, and programmable quantum dynamics, with a role that is complementary to both classical algorithms and gate-based quantum computing.
Critical decision-making issues in science, engineering, and industry are based on combinatorial optimization; however, its application is inherently limited by the NP-hard nature of the problem. A specialized paradigm of analogue quantum computing, quantum annealing (QA), has been proposed to solve these problems by encoding optimization problems into physical energy landscapes and solving them by quantum tunnelling systematically through exploration of solution space. This is a critical review that summarizes the current applications of quantum annealing to combinatorial optimization and includes a theoretical background, hardware designs, algorithm implementation strategies, encoding and embedding schemes, protocols to benchmark quantum annealing, areas of implementation, and links with the quantum algorithms implementation with gate-based hardware and classical solvers. We develop a unified framework, relating adiabatic quantum dynamics, Ising and QUBO models, stoquastic and non-stoquastic Hamiltonians, and diabatic transitions to modern flux-qubit annealers (Chimera, Pegasus, Zephyr topologies), and emergent architectures (Lechner-Hauke-Zoller systems, Rydberg atom platforms), and hybrids of quantum and classical computation. Through our analysis, we find that overhead in embedding and encoding is the largest determinant of the scalability and performance (this is not just the number of qubits). Minor embeddings also usually have a physical qubit count per logical variable of between 5 and 12 qubits, which limits effective problem capacity by 80-92% and, due to chain-breaking errors, compromises the quality of solutions.
This thesis studies several aspects of the quantum annealing (QA) computing approach. Quantum annealers' primary objective is to solve hard computational optimization problems. Because these optimization problems are in the NP-Hard complexity class, they are of great interest in several fields. One of the leading open questions concerning quantum annealers asks whether they will outperform other classical methods for solving these problems; Some aspects of this question are addressed in this thesis. The first part of the thesis investigates whether quantum annealing provides improved performance for solving a particular family of NP problems, called the Quadratic Knapsack Problem (QKP), using the D-Wave Quantum Annealer. The performance metrics used to assess QKP solving are the solution quality and the total runtime, and are benchmarked against other classical solvers. \n \nFurthermore, we extend our research on quantum annealers to propose two use cases for such systems. One is for Blockchain technology, and the second is in the area of quantum chaos. For the first use case of QA, an application for Blockchain's Proof of Work (PoW) is proposed, based on having hard optimization problems as an alternative to PoW hashing challenge, and using quantum annealers as solvers. For the second use case of QA, we propose simulating quantum chaos on the D-Wave Quantum Annealer to study the transition between the deep quantum realm and the classical limit in a chaotic system, and obtain insights into the “quantumness" of quantum annealers.
Quantum annealing has emerged as a transformative approach in solving combinatorial optimization problems by leveraging the principles of quantum mechanics. A comprehensive survey of quantum annealing is presented, delineating its foundational concepts, state-of-the-art advancements, and diverse applications across domains such as logistics, finance, machine learning, and energy optimization. Notable contributions include the introduction of a systematic benchmarking framework to evaluate quantum annealing against classical optimization techniques across metrics like time-to-target, scalability, and energy efficiency. Additionally, novel hybrid quantum-classical paradigms and hardware advancements are explored, addressing challenges in qubit connectivity, coherence, and noise resilience. Optimization problems are mapped to suitable quantum annealing platforms, offering practical guidelines for leveraging quantum technologies in real-world scenarios. Critical gaps in scalability and integration with machine learning are identified, with future research directions proposed to bridge these challenges. These findings provide a holistic understanding of quantum annealing's potential, offering a foundational resource for advancing quantum computing in optimization.
Power grid modernization is essential for ensuring the reliability, efficiency, and sustainability of power systems in response to increasing demand, supply uncertainty, and decentralization of resources. This dissertation investigates the application of quantum computing (QC) in solving two challenging power grid problems, including Unit Commitment (UC) and Vehicle-to-Grid (V2G) optimization. Through novel approaches in quantum modeling, this work seeks to advance computational strategies that could support grid modernization efforts as grid complexity grows beyond the capabilities of classical optimization methods. The first part of this research introduces QC and the core mechanics of quantum physics that are vital to understanding quantum computations. Different methods of QC and their histories are discussed, including gate-based models and quantum annealing. Quantum annealing (QA) is the focus of the rest of the chapter, discussing the QA process, the mathematics behind it, and the reformulations required to make an optimization problem quantum-compatible. In the second part, a hybrid quantum-classical model is developed to solve the UC problem, combining QA with classical solvers to balance computational efficiency and solution accuracy. The results are compared to a classical deterministic and metaheuristic solutions, which reveals that while classical models outperform quantum solutions at smaller scales, the hybrid approach offers promising advantages in handling more complex grid configurations. This hybrid model provides a pathway for QC to enhance classical optimization techniques, especially as hardware and embedding algorithms continue to evolve. A novel discretization strategy is introduced that is designed to solve the UC problem more efficiently compatible with quantum annealing (QA) hardware. By representing continuous variables as binary variables using a logarithmic binning technique, this approach aims to reduce the number of binary variables needed for problem reformulation. Results show that this novel discretization significantly decreased computational time and yielded fewer binary variables, although further adjustments are needed to improve solution accuracy and optimality. The final part examines the feasibility of using a quantum model to optimize V2G scheduling. This quantum model, aimed at minimizing EV charging costs over a 24-hour period, achieves a reasonable optimality rate relative to a classical deterministic solution for a studied test system. The study demonstrates QC’s potential for real-world applications, albeit on a limited scale, and highlights the scalability possibilities for broader V2G network management as quantum technology matures. This is followed by a review of existing methods for V2G and mobile energy storage system optimization, with a focus on enhancing grid resilience and a discussion around potential quantum advantages and pathways for future utilization. Collectively, these findings demonstrate that while QC in grid optimization is still in its nascent stages, it holds substantial promise for meeting the computational demands of the future power grid. This research paves the way for continued exploration of quantum-enhanced solutions to support grid modernization in the era of renewable energy integration, electrification, and continually increasing complexity.
Optimized power system planning and operation are core to delivering a low-cost and high-reliability transition path to net-zero carbon emissions. The major technological changes associated with net zero, including the rapid adoption of renewables, electrification of transport and heating, and system-wide digitalization, each increase the scope for optimization to create value, but at the cost of greater computational complexity. Although power system optimization problems are now posing challenges for even the largest exa-scale supercomputers, a new avenue for progress has been opened by recent breakthroughs in quantum computing. Quantum computing offers a fundamentally new computational infrastructure with different capabilities and trade-offs and is reaching a level of maturity where, for the first time, a practical advantage over classical computing is available for specific applications. In this review, we identify significant and wide-ranging opportunities for quantum computing to offer value for power system optimization. In addition to reviewing the latest work on quantum computing for simulation-based and combinatorial power system optimization applications, we also review state-of-the-art theoretical work on quantum convex optimization and machine learning and map this to power system optimization applications where quantum computing is underexplored. Based on our review, we analyze challenges for industry implementation and scale-up and propose directions for future research.