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

Sampling combinatorial energy landscapes by classical and quantum computation

Eric B. Jones

Published Dec 31, 2019• 0 citations
OpenAlex

Abstract

Combinatorial and, by extension, non-convex optimization problems are among the most difficult to solve computationally due to the inadequacy of local search methods alone to find global optima. The notion of an energy landscape provides a unified language to describe the origin of combinatorial complexity across a wide variety of fields including physics, materials science, and artificial intelligence. This thesis utilizes probabilistic techniques for efficiently sampling energy landscapes that rely on classical high-performance computers and near-term quantum computers. Such sampling techniques not only provide effective heuristics for solving combinatorial optimization problems, but also enable an explanation of physical phenomena that rely on features of the energy landscape other than the global optimum. Six use cases are considered that are of relevance to the design of future clean energy systems: i) a predictive theory of materials polymorphism based on the partitioning of the continuous energy landscape into structurally equivalent regions, ii) a theory of the structure of functional glasses based on thermally averaging structurally inequivalent regions, iii) solution of the minimum dominating set variant of the optimal phasor measurement unit placement problem on the power grid by quantum-annealing over a discrete, combinatorial solution landscape, iv) a reformulation and solution of the Markov decision process formalism underlying optimal control via quantum annealing, v) a prescription for the variational preparation of fractional quantum Hall states on a digital quantum computer that accommodates the size of the Hilbert space on quantum hardware while shifting the burden of variational minimization to classical, global optimization heuristics, and vi) the simulation of quantum cellular automata on a digital quantum computer and establishment thereby as primitives that could help design noise-resilient classically-parameterized unitary circuits such as those used in quantum machine learning. Through these domain examples, the outlook established herein is that efficient methods for exploring combinatorial energy landscapes, combined with resilience-minded near-term quantum algorithm construction and intelligent division of labor between quantum and classical resources, provide a promising path towards solving some of the most challenging problems in renewable energy science.

Related papers

Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics

Steven Abel, Andrei Constantin, Luca A. Nutricati

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.

quant-pharXiv:2605.06857•Contemporary Physics•May 11, 2026•1 citation

Enumeration algorithms for combinatorial problems using Ising machines: When should we stop exploring energy landscapes?

Yuta Mizuno, Ali, Mohammad, Tamiki Komatsuzaki

Combinatorial problems such as combinatorial optimization and constraint satisfaction problems arise in decision-making across various fields of science and technology. In real-world applications, when multiple optimal or constraint-satisfying solutions exist, enumerating all these solutions is often desirable, as it provides flexibility in decision-making. However, combinatorial problems and their enumeration versions pose significant computational challenges due to combinatorial explosion. To address these challenges, we propose enumeration algorithms for combinatorial optimization and constraint satisfaction problems using Ising machines. Ising machines are specialized devices designed to efficiently solve combinatorial problems by exploring the energy landscape of an Ising model. Ising machines typically sample lower-energy solutions with higher probability. Our enumeration algorithms repeatedly perform such sampling to collect all desirable solutions. The crux of the proposed algorithms lies in their stopping criteria for sampling-based energy landscape exploration, which are derived from probability theory. In particular, the proposed algorithms have theoretical guarantees that the failure probability of enumeration is bounded above by a user-specified value, provided that lower-cost solutions are sampled more frequently and equal-cost solutions are sampled with equal probability. Many physics-based Ising machines are expected to (approximately) satisfy these conditions. As a demonstration, we applied our algorithm using simulated annealing to maximum clique enumeration on random graphs. We found that our algorithm enumerates all maximum cliques in large, dense graphs faster than a conventional branch-and-bound algorithm specifically designed for maximum clique enumeration. These findings underscore the effectiveness and potential of our proposed approach.

arXiv:2412.00284•Nov 29, 2024•2 citations

Quantum-Inspired Search Algorithms for Combinatorial Optimization

Jincheng Zhang

This paper explores the application of quantum-inspired concepts to the field of combinatorial optimization. Traditional search algorithms often struggle with the complexity of problems involving numerous possible solutions. We propose a novel approach that leverages the principles of quantum superposition and interference, albeit within a classical computing framework, to enhance the efficiency of search processes. The core of our method involves a hybrid algorithm that combines established classical search techniques with probabilistic sampling strategies informed by quantum mechanics. We aim to demonstrate that by mimicking these quantum phenomena, we can significantly improve the speed and effectiveness of solving complex combinatorial optimization problems. The algorithm's performance is evaluated through theoretical analysis and conceptual design, focusing on the potential for achieving performance gains without requiring actual quantum hardware. The key contribution lies in the strategic application of probabilistic sampling to explore solution spaces in a manner analogous to quantum superposition, followed by interference-like mechanisms to guide the search towards promising regions. This approach represents a new direction in optimization, bridging the gap between classical and quantum computing paradigms.

•Aug 28, 2026•0 citations

Quantum algorithms for combinatorial optimisation

Lennart Binkowski

Combinatorial optimisation constitutes a central class of computational problems with broad relevance across science and industry, combining foundational theoretical interest with significant real-world impact. Many problems of practical importance admit concise mathematical formulations, yet resist efficient classical solution methods due to their NP-hard structure. Quantum computing offers several algorithmic paradigms that promise structural speedups for such problems. Most quantum and hybrid frameworks fall into one of the following three categories: algorithms based on continuous adiabatic evolution, such as quantum annealing; circuit-based variational quantum algorithms; circuit-based approaches based on Grover's algorithm. These three algorithmic families are conceptualised for different kinds and generations of quantum architectures, often studied in isolation from each other and from preexisting sophisticated classical methods. This thesis develops a unified, predominantly circuit-based treatment of quantum algorithms for combinatorial optimisation, with a particular focus on principled design transfers between near-term parametric algorithms and far-term fault-tolerant approaches. Starting from the Boolean circuit model, reversible and quantum circuit formulations are derived that allow for precise size and depth analysis of classical control logic, reversible embeddings, and quantum realisations of Boolean and pseudo-Boolean functions. These constructions form a common backbone for optimisation algorithms based on adiabatic evolution, variational principles, and amplitude amplification. Adiabatic quantum computation is analysed within this circuit framework, leading to explicit convergence conditions and resource bounds for discretised adiabatic evolutions driven by pseudo-Boolean cost functions of bounded degree. Variational quantum algorithms are then revisited with an emphasis on feasibility-preserving operations and mixing families. In this context, a novel class of exhaustive variational quantum algorithms is introduced, characterised by finite parameterisations that provably reach optimal solutions. These constructions naturally induce state-preparation routines that guarantee to generate superpositions of all feasible solutions. Finally, Grover’s algorithm and its generalisations are studied as optimisation methods, highlighting their structural dependence on feasible-state preparation and their conceptual proximity to variational and adiabatic approaches. By establishing explicit design transfer principles between these paradigms, this thesis provides a unified perspective on quantum optimisation algorithms, accompanied by concrete circuit constructions and quantitative resource analyses.

•Jan 1, 2026•0 citations

Kvanttilaskennan hyödyntäminen energiateknisissä optimointiongelmissa: Teoria, menetelmät ja nykytila

Yusuf Aldali

This bachelor’s thesis examines the applicability of quantum computing to the complex optimization problems inherent in energy systems. The transition toward decentralized production and renewable energy sources has increased computational complexity to a degree that challenges the performance of traditional classical optimization methods. In particular, combinatorial challenges—such as unit commitment and power grid management—have been identified as areas where traditional algorithms reach their limits as the number of variables increases exponentially. The thesis introduces the physical and computational foundations of quantum computing, including superposition, entanglement, and quantum parallelism, and analyzes the theoretical advantage they offer relative to classical bit-based computing. The analytical focus is on quantum optimization methods, such as Quadratic Unconstrained Binary Optimization (QUBO), quantum annealing, and variational hybrid algorithms (QAOA). Additionally, the role of quantum simulations in material physics, such as the development of battery materials and catalysts, is examined. Based on the literature review, quantum computing offers promising opportunities to support energy efficiency and the green transition. However, the technological limitations of current hardware (the NISQ era), such as the low number of qubits and sensitivity to noise, still necessitate the extensive use of quantum simulators and classical-quantum hybrid models. This work synthesizes current research in the field and identifies critical research gaps that must be addressed before the full extent of quantum advantage can be realized in practical energy engineering solutions.

•May 4, 2026•0 citations

Hybrid Quantum Classical Integration

Aayushee G

Quantum annealing has emerged as an effective meta-heuristic for solving combinatorial optimization problems by leveraging quantum tunnelling to navigate complex energy landscapes. This paper examines both the theoretical foundations and the practical implementation of quantum annealing for project scheduling and resource-allocation problems formulated as Ising or Quadratic Unconstrained Binary Optimization (QUBO) models. A comprehensive explanation of the quantum annealing process is provided through a stage-by-stage process flowchart. In addition, the study discusses hybrid quantum classical frameworks in which quantum annealing is integrated with Monte Carlo simulations or digital twin environments, supported by illustrations of the optimization energy landscape and the hybrid system architecture. The adaptability of the proposed approach is further demonstrated through analogies with unit load device (ULD) configuration and other related combinatorial optimization problems across multiple application domains. Finally, the paper outlines key implementation considerations and evaluates the current level of technological maturity of quantum annealing for applications in construction planning and logistics optimization. Keywords: quantum annealing implementation; Ising model; QUBO; combinatorial optimization; project scheduling; hybrid quantum-classical; energy landscape; digital twin; Monte Carlo; supply-chain resilience; ULD configuration

International Journal of Creative and Open Research in Engineering and Management•Aug 22, 2026•0 citations
Combinatorial and, by extension, non-convex optimization problems are among the most difficult to solve computationally due to the inadequacy of local search methods alone to find global optima. The notion of an energy landscape provides a unified language to describe the origin of combinatorial complexity across a wide variety of fields including physics, materials science, and artificial intelligence. This thesis utilizes probabilistic techniques for efficiently sampling energy landscapes that rely on classical high-performance computers and near-term quantum computers. Such sampling techniques not only provide effective heuristics for solving combinatorial optimization problems, but also enable an explanation of physical phenomena that rely on features of the energy landscape other than the global optimum. Six use cases are considered that are of relevance to the design of future clean energy systems: i) a predictive theory of materials polymorphism based on the partitioning of the continuous energy landscape into structurally equivalent regions, ii) a theory of the structure of functional glasses based on thermally averaging structurally inequivalent regions, iii) solution of the minimum dominating set variant of the optimal phasor measurement unit placement problem on the power grid by quantum-annealing over a discrete, combinatorial solution landscape, iv) a reformulation and solution of the Markov decision process formalism underlying optimal control via quantum annealing, v) a prescription for the variational preparation of fractional quantum Hall states on a digital quantum computer that accommodates the size of the Hilbert space on quantum hardware while shifting the burden of variational minimization to classical, global optimization heuristics, and vi) the simulation of quantum cellular automata on a digital quantum computer and establishment thereby as primitives that could help design noise-resilient classically-parameterized unitary circuits such as those used in quantum machine learning. Through these domain examples, the outlook established herein is that efficient methods for exploring combinatorial energy landscapes, combined with resilience-minded near-term quantum algorithm construction and intelligent division of labor between quantum and classical resources, provide a promising path towards solving some of the most challenging problems in renewable energy science.
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.
Combinatorial problems such as combinatorial optimization and constraint satisfaction problems arise in decision-making across various fields of science and technology. In real-world applications, when multiple optimal or constraint-satisfying solutions exist, enumerating all these solutions is often desirable, as it provides flexibility in decision-making. However, combinatorial problems and their enumeration versions pose significant computational challenges due to combinatorial explosion. To address these challenges, we propose enumeration algorithms for combinatorial optimization and constraint satisfaction problems using Ising machines. Ising machines are specialized devices designed to efficiently solve combinatorial problems by exploring the energy landscape of an Ising model. Ising machines typically sample lower-energy solutions with higher probability. Our enumeration algorithms repeatedly perform such sampling to collect all desirable solutions. The crux of the proposed algorithms lies in their stopping criteria for sampling-based energy landscape exploration, which are derived from probability theory. In particular, the proposed algorithms have theoretical guarantees that the failure probability of enumeration is bounded above by a user-specified value, provided that lower-cost solutions are sampled more frequently and equal-cost solutions are sampled with equal probability. Many physics-based Ising machines are expected to (approximately) satisfy these conditions. As a demonstration, we applied our algorithm using simulated annealing to maximum clique enumeration on random graphs. We found that our algorithm enumerates all maximum cliques in large, dense graphs faster than a conventional branch-and-bound algorithm specifically designed for maximum clique enumeration. These findings underscore the effectiveness and potential of our proposed approach.
This paper explores the application of quantum-inspired concepts to the field of combinatorial optimization. Traditional search algorithms often struggle with the complexity of problems involving numerous possible solutions. We propose a novel approach that leverages the principles of quantum superposition and interference, albeit within a classical computing framework, to enhance the efficiency of search processes. The core of our method involves a hybrid algorithm that combines established classical search techniques with probabilistic sampling strategies informed by quantum mechanics. We aim to demonstrate that by mimicking these quantum phenomena, we can significantly improve the speed and effectiveness of solving complex combinatorial optimization problems. The algorithm's performance is evaluated through theoretical analysis and conceptual design, focusing on the potential for achieving performance gains without requiring actual quantum hardware. The key contribution lies in the strategic application of probabilistic sampling to explore solution spaces in a manner analogous to quantum superposition, followed by interference-like mechanisms to guide the search towards promising regions. This approach represents a new direction in optimization, bridging the gap between classical and quantum computing paradigms.
Combinatorial optimisation constitutes a central class of computational problems with broad relevance across science and industry, combining foundational theoretical interest with significant real-world impact. Many problems of practical importance admit concise mathematical formulations, yet resist efficient classical solution methods due to their NP-hard structure. Quantum computing offers several algorithmic paradigms that promise structural speedups for such problems. Most quantum and hybrid frameworks fall into one of the following three categories: algorithms based on continuous adiabatic evolution, such as quantum annealing; circuit-based variational quantum algorithms; circuit-based approaches based on Grover's algorithm. These three algorithmic families are conceptualised for different kinds and generations of quantum architectures, often studied in isolation from each other and from preexisting sophisticated classical methods. This thesis develops a unified, predominantly circuit-based treatment of quantum algorithms for combinatorial optimisation, with a particular focus on principled design transfers between near-term parametric algorithms and far-term fault-tolerant approaches. Starting from the Boolean circuit model, reversible and quantum circuit formulations are derived that allow for precise size and depth analysis of classical control logic, reversible embeddings, and quantum realisations of Boolean and pseudo-Boolean functions. These constructions form a common backbone for optimisation algorithms based on adiabatic evolution, variational principles, and amplitude amplification. Adiabatic quantum computation is analysed within this circuit framework, leading to explicit convergence conditions and resource bounds for discretised adiabatic evolutions driven by pseudo-Boolean cost functions of bounded degree. Variational quantum algorithms are then revisited with an emphasis on feasibility-preserving operations and mixing families. In this context, a novel class of exhaustive variational quantum algorithms is introduced, characterised by finite parameterisations that provably reach optimal solutions. These constructions naturally induce state-preparation routines that guarantee to generate superpositions of all feasible solutions. Finally, Grover’s algorithm and its generalisations are studied as optimisation methods, highlighting their structural dependence on feasible-state preparation and their conceptual proximity to variational and adiabatic approaches. By establishing explicit design transfer principles between these paradigms, this thesis provides a unified perspective on quantum optimisation algorithms, accompanied by concrete circuit constructions and quantitative resource analyses.
This bachelor’s thesis examines the applicability of quantum computing to the complex optimization problems inherent in energy systems. The transition toward decentralized production and renewable energy sources has increased computational complexity to a degree that challenges the performance of traditional classical optimization methods. In particular, combinatorial challenges—such as unit commitment and power grid management—have been identified as areas where traditional algorithms reach their limits as the number of variables increases exponentially. The thesis introduces the physical and computational foundations of quantum computing, including superposition, entanglement, and quantum parallelism, and analyzes the theoretical advantage they offer relative to classical bit-based computing. The analytical focus is on quantum optimization methods, such as Quadratic Unconstrained Binary Optimization (QUBO), quantum annealing, and variational hybrid algorithms (QAOA). Additionally, the role of quantum simulations in material physics, such as the development of battery materials and catalysts, is examined. Based on the literature review, quantum computing offers promising opportunities to support energy efficiency and the green transition. However, the technological limitations of current hardware (the NISQ era), such as the low number of qubits and sensitivity to noise, still necessitate the extensive use of quantum simulators and classical-quantum hybrid models. This work synthesizes current research in the field and identifies critical research gaps that must be addressed before the full extent of quantum advantage can be realized in practical energy engineering solutions.
Quantum annealing has emerged as an effective meta-heuristic for solving combinatorial optimization problems by leveraging quantum tunnelling to navigate complex energy landscapes. This paper examines both the theoretical foundations and the practical implementation of quantum annealing for project scheduling and resource-allocation problems formulated as Ising or Quadratic Unconstrained Binary Optimization (QUBO) models. A comprehensive explanation of the quantum annealing process is provided through a stage-by-stage process flowchart. In addition, the study discusses hybrid quantum classical frameworks in which quantum annealing is integrated with Monte Carlo simulations or digital twin environments, supported by illustrations of the optimization energy landscape and the hybrid system architecture. The adaptability of the proposed approach is further demonstrated through analogies with unit load device (ULD) configuration and other related combinatorial optimization problems across multiple application domains. Finally, the paper outlines key implementation considerations and evaluates the current level of technological maturity of quantum annealing for applications in construction planning and logistics optimization. Keywords: quantum annealing implementation; Ising model; QUBO; combinatorial optimization; project scheduling; hybrid quantum-classical; energy landscape; digital twin; Monte Carlo; supply-chain resilience; ULD configuration