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:2311.11621 · Quantum Information Processing

Evaluating the practicality of quantum optimization algorithms for prototypical industrial applications

Matteo Vandelli, Alessandra Lignarolo, Carlo Cavazzoni, Daniele Dragoni

Published Oct 9, 2024• 5 citations
arXivHTMLPDF
DOI
10.1007/s11128-024-04560-1

Related papers

Hybrid Meta-Solving for Practical Quantum Computing

Domenik Eichhorn, Maximilian Schweikart, Nick Poser +3 more

The advent of quantum algorithms has initiated a discourse on the potential for quantum speedups for optimization problems. However, several factors still hinder a practical realization of the potential benefits. These include the lack of advanced, error-free quantum hardware, the absence of accessible software stacks for seamless integration and interaction, and the lack of methods that allow us to leverage the theoretical advantages to real-world use cases. This paper works towards the creation of an accessible hybrid software stack for solving optimization problems, aiming to create a fundamental platform that can utilize quantum technologies to enhance the solving process. We introduce a novel approach that we call Hybrid Meta-Solving, which combines classical and quantum optimization techniques to create customizable and extensible hybrid solvers. We decompose mathematical problems into multiple sub-problems that can be solved by classical or quantum solvers, and propose techniques to semi-automatically build the best solver for a given problem. Implemented in our ProvideQ toolbox prototype, Meta-Solving provides interactive workflows for accessing quantum computing capabilities. Our evaluation demonstrates the applicability of Meta-Solving in industrial use cases. It shows that we can reuse state-of-the-art classical algorithms and extend them with quantum computing techniques. Our approach is designed to be at least as efficient as state-of-the-art classical techniques, while having the potential to outperform them if future advances in the quantum domain are made.

arXiv:2405.09115•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•1 citation

Quantum-Inspired Optimization for Modern Industrial Systems

Amolkumar Jadhav, Sheshikala Martha, Ajinkya Yadav +3 more

International Conference on Computational and Cognitive Systems Science•Jan 1, 2025•0 citations

Overview and perspectives of quantum algorithms for industrial applications

Hiroyuki Tezuka

The Japan Society of Applied Physics•Jul 6, 2021•0 citations

Non-variational quantum random access optimization with alternating operator ansatz

Zichang He, Rudy Raymond, Ruslan Shaydulin +1 more

Solving hard optimization problems is one of the most promising application domains for quantum computers due to the ubiquity of such problems in industry and the availability of broadly applicable theoretical quantum speedups. However, the ability of near-term quantum computers to tackle industrial-scale optimization problems is limited by their size and the overheads of quantum error correction. Quantum Random Access Optimization (QRAO) has been proposed to reduce the space requirements of quantum optimization. However, to date QRAO has only been implemented using variational algorithms, which suffer from the need to train instance-specific variational parameters, making them difficult to scale. We propose and benchmark a non-variational approach to QRAO based on the Quantum Alternating Operator Ansatz (QAOA) for the MaxCut problem. We show that instance-independent "fixed" parameters achieve good performance, removing the need for variational parameter optimization. Additionally, we evaluate different design choices, such as various mixers, initial states, and QRAO-specific implementations of the QAOA cost operator, and identify a strategy that performs well in practice. Our results pave the way for the practical execution of QRAO on early fault-tolerant quantum computers.

arXiv:2502.04277•Scientific Reports•Aug 9, 2025•12 citations

Quantum Optimization Algorithms in Operations Research: Methods, Applications, and Implications

Florian Klug

arXiv:2312.13636•Jan 1, 2024•22 citations

Quantum-enhanced discrete-event simulation and optimization of sequence-dependent job scheduling with setup times

Christopher Sowinski, Yufei Feng, Simon Schlichte +3 more

Process simulation tools, such as discrete-event simulation (DES), offer domain experts low-barrier environments for designing and evaluating industrial processes, avoiding the expense and complexity of physical prototypes. While classical optimization approaches are routinely embedded in DES workflows, quantum-enhanced optimization remains largely unexplored. With the emergence of advanced quantum computing hardware, integrating it into industrial optimization has become realistic and the potential to unlock faster, more cost-effective solutions for complex scheduling, routing, and resource allocation compared to classical methods. To broaden its adoption among domain experts without a background in quantum theory, we must offer intuitive, application-oriented software tools. Yet the ecosystem of such frameworks is vast, and guidance is lacking as to which platform or library best suits a given domain expert´s needs. In this work, we bridge the gap between DES and quantum optimization by first conducting a literature review of existing quantum application-oriented optimization frameworks. From these findings, we derive recommendations, answering which tools and platforms engineers or researchers can choose to formulate and test their DES optimization problems across multiple quantum backends. Building on our survey, we introduce a theoretical framework that integrates quantum-optimization algorithms directly into the DES optimization cycle. We then apply this framework to the benchmark sequence-dependent job-scheduling problem with setup times (SDJST), which, to the best of our knowledge, constitutes one of the first quantum-enabled simulation-optimization studies for this problem. We further validate that classical optimization approaches outperform for smaller problem sizes, whereas the quantum approach becomes increasingly promising as the problem size grows.

Procedia CIRP•Jan 1, 2026•1 citation
The advent of quantum algorithms has initiated a discourse on the potential for quantum speedups for optimization problems. However, several factors still hinder a practical realization of the potential benefits. These include the lack of advanced, error-free quantum hardware, the absence of accessible software stacks for seamless integration and interaction, and the lack of methods that allow us to leverage the theoretical advantages to real-world use cases. This paper works towards the creation of an accessible hybrid software stack for solving optimization problems, aiming to create a fundamental platform that can utilize quantum technologies to enhance the solving process. We introduce a novel approach that we call Hybrid Meta-Solving, which combines classical and quantum optimization techniques to create customizable and extensible hybrid solvers. We decompose mathematical problems into multiple sub-problems that can be solved by classical or quantum solvers, and propose techniques to semi-automatically build the best solver for a given problem. Implemented in our ProvideQ toolbox prototype, Meta-Solving provides interactive workflows for accessing quantum computing capabilities. Our evaluation demonstrates the applicability of Meta-Solving in industrial use cases. It shows that we can reuse state-of-the-art classical algorithms and extend them with quantum computing techniques. Our approach is designed to be at least as efficient as state-of-the-art classical techniques, while having the potential to outperform them if future advances in the quantum domain are made.
Solving hard optimization problems is one of the most promising application domains for quantum computers due to the ubiquity of such problems in industry and the availability of broadly applicable theoretical quantum speedups. However, the ability of near-term quantum computers to tackle industrial-scale optimization problems is limited by their size and the overheads of quantum error correction. Quantum Random Access Optimization (QRAO) has been proposed to reduce the space requirements of quantum optimization. However, to date QRAO has only been implemented using variational algorithms, which suffer from the need to train instance-specific variational parameters, making them difficult to scale. We propose and benchmark a non-variational approach to QRAO based on the Quantum Alternating Operator Ansatz (QAOA) for the MaxCut problem. We show that instance-independent "fixed" parameters achieve good performance, removing the need for variational parameter optimization. Additionally, we evaluate different design choices, such as various mixers, initial states, and QRAO-specific implementations of the QAOA cost operator, and identify a strategy that performs well in practice. Our results pave the way for the practical execution of QRAO on early fault-tolerant quantum computers.
Process simulation tools, such as discrete-event simulation (DES), offer domain experts low-barrier environments for designing and evaluating industrial processes, avoiding the expense and complexity of physical prototypes. While classical optimization approaches are routinely embedded in DES workflows, quantum-enhanced optimization remains largely unexplored. With the emergence of advanced quantum computing hardware, integrating it into industrial optimization has become realistic and the potential to unlock faster, more cost-effective solutions for complex scheduling, routing, and resource allocation compared to classical methods. To broaden its adoption among domain experts without a background in quantum theory, we must offer intuitive, application-oriented software tools. Yet the ecosystem of such frameworks is vast, and guidance is lacking as to which platform or library best suits a given domain expert´s needs. In this work, we bridge the gap between DES and quantum optimization by first conducting a literature review of existing quantum application-oriented optimization frameworks. From these findings, we derive recommendations, answering which tools and platforms engineers or researchers can choose to formulate and test their DES optimization problems across multiple quantum backends. Building on our survey, we introduce a theoretical framework that integrates quantum-optimization algorithms directly into the DES optimization cycle. We then apply this framework to the benchmark sequence-dependent job-scheduling problem with setup times (SDJST), which, to the best of our knowledge, constitutes one of the first quantum-enabled simulation-optimization studies for this problem. We further validate that classical optimization approaches outperform for smaller problem sizes, whereas the quantum approach becomes increasingly promising as the problem size grows.