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

İSTANBUL TECHNICAL UNIVERSITY FACULTY OF SCIENCE AND LETTERS GRADUATION PROJECT QUANTUM ALGORITHMS AND GENETIC CODE

Onur Pusuluk

Published Jan 1, 2009• 0 citations
OpenAlex

Related papers

QUANTUM AND GENETIC ALGORITHMS AS A NEW TECHNOLOGY OF EVOLUTIONARY SEARCH

Victor M. Kureichik

Vestnik Yuzhnogo nauchnogo tsentra•Jan 1, 2005•1 citation

PROBABILISTIC QUANTUM CROSSOVER BASED GENETIC ALGORITHM AND ITS APPLICATION

Yang Yu, Hongwei Dai, Hui Li

ICIC express letters. Part B, Applications•Apr 1, 2014•0 citations

Quantum algorithms and the genetic code

Apoorva D. Patel

arXiv:quant-ph/0002037•Pramana•Feb 1, 2001•88 citations

GENETIC ALGORITHMS AND OPTIMIZATION PROBLEMS IN QUANTUM COMPUTING

Yorick Hardy, W.‐H. Steeb

We solve a number of problems in quantum computing by applying genetic algorithms. We use the bitset class of C ++ to represent any data type for genetic algorithms. Thus we have a flexible way to solve any optimization problem. The Bell-CHSH inequality and entanglement measures are studied using genetic algorithms. Entangled states form the backbone for teleportation. The C ++ code is also provided.

International Journal of Modern Physics C•Nov 1, 2010•5 citations

Genetic Code Modelling from the Perspective of Quantum Informatics

Elena Fimmel, Sergey Valentinovich Petoukhov

Advances in intelligent systems and computing•May 3, 2019•1 citation

METAHEURISTIC SEARCH TECHNIQUES: GENETIC ALGORITHMS AND QUANTUM ANNEALING

This part of the course introduces heuristic search methods — optimization techniques typically inspired by naturally occurring phenomena. We will focus on two such methods: genetic algorithms and quantum annealing. These represent opposite ends of the heuristic spectrum: in one, the problem of interest is largely decoupled from the mechanics of the search, while in the other, the problem is directly embedded within it. Although many other heuristic techniques exist, these two examples illustrate key advantages (e.g., broad applicability, potential speed-ups in suitable settings) and drawbacks (e.g., limited explainability) shared by many heuristic methods. In the tutorials, we will consider several discrete problems, such as Taxicab numbers and the Knapsack problem. The former is a well-known curiosity in number theory, while the latter is a classic problem in combinatorial optimization. Both are also morally analogous to certain discrete structures that arise in physics, such as anomaly cancellation conditions and partition function computations.

WORLD SCIENTIFIC (EUROPE) eBooks•Jul 19, 2026•0 citations
This part of the course introduces heuristic search methods — optimization techniques typically inspired by naturally occurring phenomena. We will focus on two such methods: genetic algorithms and quantum annealing. These represent opposite ends of the heuristic spectrum: in one, the problem of interest is largely decoupled from the mechanics of the search, while in the other, the problem is directly embedded within it. Although many other heuristic techniques exist, these two examples illustrate key advantages (e.g., broad applicability, potential speed-ups in suitable settings) and drawbacks (e.g., limited explainability) shared by many heuristic methods. In the tutorials, we will consider several discrete problems, such as Taxicab numbers and the Knapsack problem. The former is a well-known curiosity in number theory, while the latter is a classic problem in combinatorial optimization. Both are also morally analogous to certain discrete structures that arise in physics, such as anomaly cancellation conditions and partition function computations.