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

arXiv:1910.13045 · Computers & Chemical Engineering

Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems

Akshay Ajagekar, Travis S. Humble, Fengqi You

Published Nov 1, 2019• 191 citations
arXivHTMLPDF
DOI
10.1016/j.compchemeng.2019.106630

Related papers

Quantum Algorithms for Discrete Optimization

Sergio Boixo, Rolando D. Somma

•Jan 1, 2015•0 citations

Quantum Annealing Applications for Power Grid Modernization

Tyler Christeson

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.

•Nov 21, 2025•0 citations

Hybrid Classical-Quantum Optimization Techniques for Solving Mixed-Integer Programming Problems in Production Scheduling

Akshay Ajagekar, Kumail Al Hamoud, Fengqi You

Quantum computing (QC) holds great promise to open up a new era of computing and has been receiving significant attention recently. To overcome the performance limitations of near-term QC, utilizing the current quantum computers to complement classical techniques for solving real-world problems is of utmost importance. In this paper, we develop QC-based solution strategies that exploit quantum annealing and classical optimization techniques for solving large-scale scheduling problems in manufacturing systems. The applications of the proposed algorithms are illustrated through two case studies in production scheduling. First, we present a hybrid QC-based solution approach for the job-shop scheduling problem. Second, we propose a hybrid QC-based parametric method for the multi-purpose batch scheduling problem with a fractional objective. The proposed hybrid algorithms can tackle optimization problems formulated as mixed-integer linear and mixed-integer fractional programs, respectively, and provide feasibility guarantees. Performance comparison between state-of-the-art exact and heuristic solvers and the proposed QC-based hybrid solution techniques is presented for both job-shop and batch scheduling problems. Unlike conventional classical solution techniques, the proposed hybrid frameworks harness quantum annealing to supplement established deterministic optimization algorithms and demonstrate performance efficiency over standard off-the-shelf optimization solvers.

IEEE Transactions on Quantum Engineering•Jan 1, 2022•48 citations

A new hybrid classical-quantum algorithm for continuous global optimization problems

Pedro Lara, Renato Portugal, Carlile Lavor

arXiv:1301.4667•Journal of Global Optimization•Sep 30, 2013•6 citations

Solving Multiple Discretization Portfolio Optimization Problem with Quantum-Classical Hybrid Algorithms

Haijing Wei, Yanbo J. Wang, Haoxiang Yang +12 more

Portfolio optimization (PO) plays a central role in finance, encompassing both resource allocation and risk management. While numerous algorithms have been developed for continuous-variable PO, the inclusion of large, indivisible assets such as real estate transforms the task into a combinatorial optimization problem, which is NP-hard for classical computers. This study explores using quantum-classical hybrid algorithms for multi-discretized portfolio optimization, addressing the needs of real-world applications. We propose a flexible theoretical model that can solve PO problems with various types of discrete assets and constraints, which is compatible with both quantum and classical computing paradigms. Then, we use the D-Wave quantum processor and classical solver to determine optimal investment strategies. Experimental results indicate that the hybrid quantum algorithm outperforms both classical computing methods and quantum annealing algorithms in terms of return and risk management. This research enhances quantum computing applications in finance and provides insights into future algorithm design.

Computational Economics•Jul 31, 2025•2 citations

Solving a class of continuous global optimization problems using quantum algorithms

V. Protopopescu, J. Barhen

Physics Letters A•Apr 1, 2002•29 citations
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.
Quantum computing (QC) holds great promise to open up a new era of computing and has been receiving significant attention recently. To overcome the performance limitations of near-term QC, utilizing the current quantum computers to complement classical techniques for solving real-world problems is of utmost importance. In this paper, we develop QC-based solution strategies that exploit quantum annealing and classical optimization techniques for solving large-scale scheduling problems in manufacturing systems. The applications of the proposed algorithms are illustrated through two case studies in production scheduling. First, we present a hybrid QC-based solution approach for the job-shop scheduling problem. Second, we propose a hybrid QC-based parametric method for the multi-purpose batch scheduling problem with a fractional objective. The proposed hybrid algorithms can tackle optimization problems formulated as mixed-integer linear and mixed-integer fractional programs, respectively, and provide feasibility guarantees. Performance comparison between state-of-the-art exact and heuristic solvers and the proposed QC-based hybrid solution techniques is presented for both job-shop and batch scheduling problems. Unlike conventional classical solution techniques, the proposed hybrid frameworks harness quantum annealing to supplement established deterministic optimization algorithms and demonstrate performance efficiency over standard off-the-shelf optimization solvers.
Portfolio optimization (PO) plays a central role in finance, encompassing both resource allocation and risk management. While numerous algorithms have been developed for continuous-variable PO, the inclusion of large, indivisible assets such as real estate transforms the task into a combinatorial optimization problem, which is NP-hard for classical computers. This study explores using quantum-classical hybrid algorithms for multi-discretized portfolio optimization, addressing the needs of real-world applications. We propose a flexible theoretical model that can solve PO problems with various types of discrete assets and constraints, which is compatible with both quantum and classical computing paradigms. Then, we use the D-Wave quantum processor and classical solver to determine optimal investment strategies. Experimental results indicate that the hybrid quantum algorithm outperforms both classical computing methods and quantum annealing algorithms in terms of return and risk management. This research enhances quantum computing applications in finance and provides insights into future algorithm design.