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

Advancements in Quantum Algorithms for Solving Complex Optimization Problems

Emmanuel Adediran, Iyanuoluwa Fatoki, Taiwo Ogunyinka

Published Jan 1, 2024• 2 citations
Publisher
DOI
10.2139/ssrn.5015789

Related papers

Advancements in Quantum Algorithms for Optimization Problems

Dr. Amina Shah

Quantum computing has emerged as a transformative technology, particularly for solving optimization problems, which are notoriously difficult for classical computers. Quantum algorithms, leveraging quantum parallelism and entanglement, promise significant speedups for a wide range of optimization tasks, from combinatorial optimization to machine learning. This paper reviews recent advancements in quantum algorithms for optimization problems, highlighting key algorithms such as Grover’s search algorithm, the Quantum Approximate Optimization Algorithm (QAOA), and the Quantum Alternating Operator Ansatz (QAOA). We also explore the challenges and potential of quantum computing in addressing real-world optimization problems, such as in logistics, finance, and machine learning. The paper discusses the current state of quantum hardware, as well as theoretical and practical limitations in implementing these quantum algorithms. Finally, we propose future research directions to overcome existing challenges and enhance the application of quantum algorithms in solving complex optimization problems

Computer Science Bulletin•Dec 31, 2025•0 citations

Quantum Computing Approaches for Complex Optimization Problems

Parnapalli Maruthi, K. Rahul Naik, M. Charan +3 more

International Conference on Communication and Electronics Systems (ICCES)•Oct 1, 2026•0 citations

Quantum Algorithms for Optimization Problems

Dilnoz Muhamediyeva, Rustam Raximov, Shavkat Urokov

Lecture notes in computer science•Jul 29, 2025•1 citation

Solving the Independent Domination Problem by the Quantum Approximate Optimization Algorithm

Haoqian Pan, Changhong Lü

In the wake of quantum computing advancements and quantum algorithmic progress, quantum algorithms are increasingly being employed to address a myriad of combinatorial optimization problems. Among these, the Independent Domination Problem (IDP), a derivative of the Domination Problem, has practical implications in various real-world scenarios. Despite this, existing classical algorithms for the IDP are plagued by high computational complexity, and quantum algorithms have yet to tackle this challenge. This paper introduces a Quantum Approximate Optimization Algorithm (QAOA)-based approach to address the IDP. Utilizing IBM's qasm_simulator, we have demonstrated the efficacy of the QAOA in solving the IDP under specific parameter settings, with a computational complexity that surpasses that of classical methods. Our findings offer a novel avenue for the resolution of the IDP.

arXiv:2410.17227•Entropy•Dec 5, 2024•6 citations

Quantum Algorithms for Optimization

Ansh Bansal

IOSR Journal of Computer Engineering•Oct 1, 2025•0 citations

Workforce Task Execution Scheduling Using Gate-Based Quantum Computers

Mitsuharu Takeori, Noriaki Shimada, Dimitris Alevras +4 more

Recent advancements in quantum computing technology have heralded a new era of computational capabilities, outpacing classical simulations in solving complex problems. This remarkable progress has sparked a burgeoning interest in quantum algorithms across various sectors, with optimization emerging as a particularly vibrant field of study. A focal point of this field is the development and refinement of optimization algorithms that are suitable for current and emerging capability of quantum computers. These advancements are crucial as they offer practical ways to apply quantum computing to real-world challenges. Among these applications, personnel and task execution scheduling is a compelling use case for quantum computing as applied to solve complex optimization problems critical to business and industrial operations. In this paper, we explore the utilization of quantum computers to address this class of optimization problems. Employing a range of advanced techniques, including a novel method that improves efficiency, our method demonstrates the capability of quantum computing to provide effective solutions for intricate optimization problems. We particularly focus on the application of IBM's 127 -qubit quantum devices to manage scheduling tasks in workforce management, involving 500 to 874 binary decision variables and over 1000 constraints. This exploration serves not only as a proof of concept for the practical applications of quantum computing but also as a testament to its evolving role in solving business-critical optimization challenges.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•1 citation
Quantum computing has emerged as a transformative technology, particularly for solving optimization problems, which are notoriously difficult for classical computers. Quantum algorithms, leveraging quantum parallelism and entanglement, promise significant speedups for a wide range of optimization tasks, from combinatorial optimization to machine learning. This paper reviews recent advancements in quantum algorithms for optimization problems, highlighting key algorithms such as Grover’s search algorithm, the Quantum Approximate Optimization Algorithm (QAOA), and the Quantum Alternating Operator Ansatz (QAOA). We also explore the challenges and potential of quantum computing in addressing real-world optimization problems, such as in logistics, finance, and machine learning. The paper discusses the current state of quantum hardware, as well as theoretical and practical limitations in implementing these quantum algorithms. Finally, we propose future research directions to overcome existing challenges and enhance the application of quantum algorithms in solving complex optimization problems
In the wake of quantum computing advancements and quantum algorithmic progress, quantum algorithms are increasingly being employed to address a myriad of combinatorial optimization problems. Among these, the Independent Domination Problem (IDP), a derivative of the Domination Problem, has practical implications in various real-world scenarios. Despite this, existing classical algorithms for the IDP are plagued by high computational complexity, and quantum algorithms have yet to tackle this challenge. This paper introduces a Quantum Approximate Optimization Algorithm (QAOA)-based approach to address the IDP. Utilizing IBM's qasm_simulator, we have demonstrated the efficacy of the QAOA in solving the IDP under specific parameter settings, with a computational complexity that surpasses that of classical methods. Our findings offer a novel avenue for the resolution of the IDP.
Recent advancements in quantum computing technology have heralded a new era of computational capabilities, outpacing classical simulations in solving complex problems. This remarkable progress has sparked a burgeoning interest in quantum algorithms across various sectors, with optimization emerging as a particularly vibrant field of study. A focal point of this field is the development and refinement of optimization algorithms that are suitable for current and emerging capability of quantum computers. These advancements are crucial as they offer practical ways to apply quantum computing to real-world challenges. Among these applications, personnel and task execution scheduling is a compelling use case for quantum computing as applied to solve complex optimization problems critical to business and industrial operations. In this paper, we explore the utilization of quantum computers to address this class of optimization problems. Employing a range of advanced techniques, including a novel method that improves efficiency, our method demonstrates the capability of quantum computing to provide effective solutions for intricate optimization problems. We particularly focus on the application of IBM's 127 -qubit quantum devices to manage scheduling tasks in workforce management, involving 500 to 874 binary decision variables and over 1000 constraints. This exploration serves not only as a proof of concept for the practical applications of quantum computing but also as a testament to its evolving role in solving business-critical optimization challenges.