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

International Conference on Communication and Electronics Systems (ICCES)

Quantum Computing Approaches for Complex Optimization Problems

Parnapalli Maruthi, K. Rahul Naik, M. Charan, N. Murali, P. Nagesh, J Pallavi

Published Oct 1, 2026• 0 citations
Publisher
DOI
10.1109/icces70397.2026.11762375

Related papers

Advancements in Quantum Algorithms for Solving Complex Optimization Problems

Emmanuel Adediran, Iyanuoluwa Fatoki, Taiwo Ogunyinka

•Jan 1, 2024•2 citations

Quantum Computing and Optimization: Case Study on Solar Cell Efficiency on NISQ System

Pratik De Sarkar, K. K. Ghosh, Tanmay Sinha Roy

Introduction: Quantum computing (QC) leverages principles of quantum mechanics to address computational problems that are challenging for classical approaches. In complex optimization tasks, particularly those involving high-dimensional design spaces, traditional methods such as density functional theory and classical machine learning often face scalability and computational limitations. Quantum optimization techniques offer a promising alternative to overcome these challenges. The objective of this work is to optimize the transport layer thicknesses of the solar cell. A comparative study of computational complexity is also conducted, taking into account some classical algorithms. Methods: The Quantum Approximate Optimization Algorithm (QAOA) is used for optimization. Some classical optimization algorithms are also used for compare complexities. Results: The quantum optimization performed much better in terms of time and space complexity relative to the classical algorithms. Discussion: These results demonstrate the high efficiency of QAOA for complex PV optimization problems and suggest that it may be an alternative to standard optimization methods. Conclusion: QAOA is a promising technique for optimizing solar cell design and could be applied to other computationally intensive optimization problems, including those encountered in various engineering applications.

Micro and Nanosystems•Sep 16, 2026•0 citations

Quantum computing for solving nonlinear optimization problems

Z. N. Zakaryayev, N. Z. Zakarya

•Jan 1, 2024•0 citations

Quantum Computing Constraint Optimization Algorithm

Jincheng Zhang

This paper introduces a novel quantum computing constraint optimization algorithm designed to address the challenges posed by large-scale constraint optimization problems. Traditional methods often struggle with the computational complexity of these problems, while this algorithm leverages quantum entanglement and quantum algorithms to significantly enhance efficiency and computational power. The core mechanism involves transforming the optimization problem into a quantum algorithm, exploiting quantum properties to improve algorithm performance. This research explores the potential of quantum computing to revolutionize the field of constraint optimization, offering a promising approach to tackling complex real-world problems.

•Sep 3, 2026•0 citations

Quantum Algorithms for Optimization Problems

Dilnoz Muhamediyeva, Rustam Raximov, Shavkat Urokov

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

Spatial Regionalization: A Hybrid Quantum Computing Approach

Yunhan Chang, Amr Magdy, Federico Spedalieri +1 more

Quantum computing has shown significant potential to address complex optimization problems; however, its application remains confined to specific problems at limited scales. Spatial regionalization remains largely unexplored in quantum computing due to its complexity and large number of variables. In this paper, we introduce the first hybrid quantum-classical method to spatial regionalization by decomposing the problem into manageable sub-problems, leveraging the strengths of both classical and quantum computation. This study establishes a foundational framework for effectively integrating quantum computing methods into realistic and complex spatial optimization tasks. Our initial results show a promising quantum performance advantage for a broad range of spatial regionalization problems and their variants.

arXiv:2506.18799•ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS)•Nov 3, 2025•4 citations
Introduction: Quantum computing (QC) leverages principles of quantum mechanics to address computational problems that are challenging for classical approaches. In complex optimization tasks, particularly those involving high-dimensional design spaces, traditional methods such as density functional theory and classical machine learning often face scalability and computational limitations. Quantum optimization techniques offer a promising alternative to overcome these challenges. The objective of this work is to optimize the transport layer thicknesses of the solar cell. A comparative study of computational complexity is also conducted, taking into account some classical algorithms. Methods: The Quantum Approximate Optimization Algorithm (QAOA) is used for optimization. Some classical optimization algorithms are also used for compare complexities. Results: The quantum optimization performed much better in terms of time and space complexity relative to the classical algorithms. Discussion: These results demonstrate the high efficiency of QAOA for complex PV optimization problems and suggest that it may be an alternative to standard optimization methods. Conclusion: QAOA is a promising technique for optimizing solar cell design and could be applied to other computationally intensive optimization problems, including those encountered in various engineering applications.
This paper introduces a novel quantum computing constraint optimization algorithm designed to address the challenges posed by large-scale constraint optimization problems. Traditional methods often struggle with the computational complexity of these problems, while this algorithm leverages quantum entanglement and quantum algorithms to significantly enhance efficiency and computational power. The core mechanism involves transforming the optimization problem into a quantum algorithm, exploiting quantum properties to improve algorithm performance. This research explores the potential of quantum computing to revolutionize the field of constraint optimization, offering a promising approach to tackling complex real-world problems.
Quantum computing has shown significant potential to address complex optimization problems; however, its application remains confined to specific problems at limited scales. Spatial regionalization remains largely unexplored in quantum computing due to its complexity and large number of variables. In this paper, we introduce the first hybrid quantum-classical method to spatial regionalization by decomposing the problem into manageable sub-problems, leveraging the strengths of both classical and quantum computation. This study establishes a foundational framework for effectively integrating quantum computing methods into realistic and complex spatial optimization tasks. Our initial results show a promising quantum performance advantage for a broad range of spatial regionalization problems and their variants.