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

IOSR Journal of Computer Engineering

Quantum Algorithms for Optimization

Ansh Bansal

Published Oct 1, 2025• 0 citations
Publisher
DOI
10.9790/0661-2705050726

Related papers

Optimization Using Quantum Algorithms

Kolla Bhanu Prakash

Wiley eBooks•Aug 17, 2026•0 citations

Many Known Quantum Algorithms Are Optimal: Symmetry-Based Proofs

Владик Крейнович, Oscar Galindo, Olga M. Kosheleva

Many quantum algorithms have been proposed which are drastically more efficient that the best of the non-quantum algorithms for solving the same problems. A natural question is: are these quantum algorithms already optimal – in some reasonable sense – or they can be further improved? In this paper, we review recent results showing that many known quantum algorithms are actually optimal. Several of these results are based on appropriate invariances (symmetries). Specifically, we show that the following algorithms are optimal: Grover’s algorithm for fast search in an unsorted array, teleportation algorithm – which is important for parallel quantum computations, and quantum annealing optimization algorithm. This covers many algorithms related to quantum computing. We also mention that algorithms for quantum communication and Deutsch-Josza algorithm – for fast checking whether a bit affect computation results – are optimal. In all these cases, optimality is shown not just for one specific optimality criterion, but for all possible optimality criteria that satisfy the natural invariance requirement.

International Journal of Computing•Dec 31, 2022•1 citation

Application of quantum computing in discrete portfolio optimization

Justus Shunza, Mary Akinyemi, Chika Yinka-Banjo

This study proposes a novel and more efficient quantum algorithm for portfolio optimization using quantum combinatorial optimization (QCO) techniques. A recent construction developed in 2021 has sparked the field of financial portfolio optimization through the Quantum Walk Optimization Algorithm (QWOA). In this study, we investigated the complexity and efficiency of quantum optimization algorithms with a special interest in QWOA. The objective is to minimize investment risk by having a good combination of assets in the portfolio. We also focused on reducing the number of iterations while attaining a high-quality resolution through contraction of the solution space to ease computations. The concept of QWOA was extended by constructing a newly outperforming scheme known as the “Quantum Mix Optimization Algorithm (QMOA).” QMOA algorithm codes were provided for the implementation and simulation of numerical results. In addition, the efficiency of QMOA, which is better than the existing QCO algorithms, was discussed. For instance, the least QWOA number of computations required to execute the initial state equation was p > 2, whereas this value was p ≥ 2 in the proposed QMOA.

Journal of Management Science and Engineering•May 22, 2023•11 citations

Quantum Algorithms for Optimization Problems

Dilnoz Muhamediyeva, Rustam Raximov, Shavkat Urokov

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

Dynamic Quantum Algorithm Optimization (DQAO)

Jincheng Zhang

This paper introduces the Dynamic Quantum Algorithm Optimization (DQAO) framework, a novel approach to quantum algorithm optimization that goes beyond traditional static optimization techniques. DQAO dynamically adapts to the quantum algorithm's internal state and incorporates its inherent properties to significantly enhance algorithm efficiency. The core mechanism revolves around leveraging the quantum algorithm's own quantum properties, specifically its superposition and entanglement, to refine the optimization process. This allows for a more responsive and effective optimization, achieving improved performance compared to conventional methods, particularly in scenarios involving complex quantum circuits. We present a detailed theoretical analysis and preliminary experimental results demonstrating the effectiveness of this approach.

•Sep 6, 2026•0 citations

Quantum Optimization Techniques

Jesse Van Griensven Thé, Roydon Andrew Fraser, José R. Rosas-Bustos

Springer eBooks•Jan 1, 2025•0 citations
Many quantum algorithms have been proposed which are drastically more efficient that the best of the non-quantum algorithms for solving the same problems. A natural question is: are these quantum algorithms already optimal – in some reasonable sense – or they can be further improved? In this paper, we review recent results showing that many known quantum algorithms are actually optimal. Several of these results are based on appropriate invariances (symmetries). Specifically, we show that the following algorithms are optimal: Grover’s algorithm for fast search in an unsorted array, teleportation algorithm – which is important for parallel quantum computations, and quantum annealing optimization algorithm. This covers many algorithms related to quantum computing. We also mention that algorithms for quantum communication and Deutsch-Josza algorithm – for fast checking whether a bit affect computation results – are optimal. In all these cases, optimality is shown not just for one specific optimality criterion, but for all possible optimality criteria that satisfy the natural invariance requirement.
This study proposes a novel and more efficient quantum algorithm for portfolio optimization using quantum combinatorial optimization (QCO) techniques. A recent construction developed in 2021 has sparked the field of financial portfolio optimization through the Quantum Walk Optimization Algorithm (QWOA). In this study, we investigated the complexity and efficiency of quantum optimization algorithms with a special interest in QWOA. The objective is to minimize investment risk by having a good combination of assets in the portfolio. We also focused on reducing the number of iterations while attaining a high-quality resolution through contraction of the solution space to ease computations. The concept of QWOA was extended by constructing a newly outperforming scheme known as the “Quantum Mix Optimization Algorithm (QMOA).” QMOA algorithm codes were provided for the implementation and simulation of numerical results. In addition, the efficiency of QMOA, which is better than the existing QCO algorithms, was discussed. For instance, the least QWOA number of computations required to execute the initial state equation was p > 2, whereas this value was p ≥ 2 in the proposed QMOA.
This paper introduces the Dynamic Quantum Algorithm Optimization (DQAO) framework, a novel approach to quantum algorithm optimization that goes beyond traditional static optimization techniques. DQAO dynamically adapts to the quantum algorithm's internal state and incorporates its inherent properties to significantly enhance algorithm efficiency. The core mechanism revolves around leveraging the quantum algorithm's own quantum properties, specifically its superposition and entanglement, to refine the optimization process. This allows for a more responsive and effective optimization, achieving improved performance compared to conventional methods, particularly in scenarios involving complex quantum circuits. We present a detailed theoretical analysis and preliminary experimental results demonstrating the effectiveness of this approach.