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

Lecture notes in computer science

Quantum Algorithms: Application and Feasibility

Duong Bui, Kimmo Halunen, Nhan Nguyen, Juha Röning

Published Nov 26, 2024• 0 citations
Publisher
DOI
10.1007/978-3-031-78392-0_10

Related papers

Improved Quantum-Inspired Evolutionary Algorithm and Its Application to 3-SAT Problems

Xiaoyue Feng, Enrico Blanzieri, Yanchun Liang

An improved quantum-inspired evolutionary algorithm is presented in this paper. Quantum angle is adopted to present the quantum bit in the proposed algorithm. A novel quantum rotation gate strategy is adopted to adjust the direction of the quantum gate which is used to update the quantum population. The step size is adaptively adjusted rather than a fixed angle. Furthermore, the particle swarm optimization is added into the improved algorithm to accelerate the convergent speed and develop the local searching ability. To demonstrate the effectiveness and applicability of the proposed approach, several experiments are performed on the 3-SAT problems. The results show that it is feasible and effective to solve the 3-SAT problem using the proposed algorithm.

•Jan 1, 2008•5 citations

Quantum Algorithms and Applications

Melinda Andrews, Joseph Stephen Dulny, Andrew N. Glaudell +6 more

•Sep 1, 2020•0 citations

Quantum Algorithms with Potential for New Applications

Takashi Yamakawa

NTT technical review•Jul 1, 2023•1 citation

Novel Technique for Robust Optimal Algorithmic Cooling

Sadegh Raeisi, Mária Kieferová, Michele Mosca

Heat-bath algorithmic cooling provides algorithmic ways to improve the purity of quantum states. These techniques are complex iterative processes that change from each iteration to the next and this poses a significant challenge to implementing these algorithms. Here, we introduce a new technique that on a fundamental level, shows that it is possible to do algorithmic cooling and even reach the cooling limit without any knowledge of the state and using only a single fixed operation, and on a practical level, presents a more feasible and robust alternative for implementing heat-bath algorithmic cooling. We also show that our new technique converges to the asymptotic state of heat-bath algorithmic cooling and that the cooling algorithm can be efficiently implemented; however, the saturation could require exponentially many iterations and remains impractical. This brings heat-bath algorithmic cooling to the realm of feasibility and makes it a viable option for realistic application in quantum technologies.

arXiv:1902.04439•Physical Review Letters•Jun 7, 2019•15 citations

Quantum genetic algorithm and its application in non-restriction optimization

Shitong Wang

Quantum genetic algorithm is a product which is combined quantum computation with genetic algorithm;the state vector representation is introduced to the genetic algorithm.Comparing to the genetic algorithm,it has good inquring efficiency and convergence.This paper introduces the principle of quantum genetic algorithm,and discusses on the reforms of the algorithm;then it uses the algorithm in the non-restriction optimization.Some practical examples show the algorithm is effective and feasible.

Information technology newsletter•Jan 1, 2005•0 citations

Quantum Algorithms: A Decade in Review

Arsh Khan

•Jan 1, 2026•0 citations
An improved quantum-inspired evolutionary algorithm is presented in this paper. Quantum angle is adopted to present the quantum bit in the proposed algorithm. A novel quantum rotation gate strategy is adopted to adjust the direction of the quantum gate which is used to update the quantum population. The step size is adaptively adjusted rather than a fixed angle. Furthermore, the particle swarm optimization is added into the improved algorithm to accelerate the convergent speed and develop the local searching ability. To demonstrate the effectiveness and applicability of the proposed approach, several experiments are performed on the 3-SAT problems. The results show that it is feasible and effective to solve the 3-SAT problem using the proposed algorithm.
Heat-bath algorithmic cooling provides algorithmic ways to improve the purity of quantum states. These techniques are complex iterative processes that change from each iteration to the next and this poses a significant challenge to implementing these algorithms. Here, we introduce a new technique that on a fundamental level, shows that it is possible to do algorithmic cooling and even reach the cooling limit without any knowledge of the state and using only a single fixed operation, and on a practical level, presents a more feasible and robust alternative for implementing heat-bath algorithmic cooling. We also show that our new technique converges to the asymptotic state of heat-bath algorithmic cooling and that the cooling algorithm can be efficiently implemented; however, the saturation could require exponentially many iterations and remains impractical. This brings heat-bath algorithmic cooling to the realm of feasibility and makes it a viable option for realistic application in quantum technologies.