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

Lookup Table for Quantum Genetic Algorithm Based on Qutrits

N. Majd, Moein Atari

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.2139/ssrn.5000447

Related papers

High-Order Quantum Genetic Algorithm Based on Quantum Entanglement

Han Qi, Shuai Gong, Abdullah Gani +1 more

Quantum genetic algorithms(QGA) typically construct traditional quantum chromosomes as independent quantum bit systems, which has facilitated the enhancement of search speed and precision in genetic algorithms, demonstrating powerful problem-solving capabilities in optimization issues. Although traditional QGA have enriched population diversity, they still tend to fall into local optima, and the evolutionary update operations require rotation directions to be determined by lookup tables, a process involving multiple conditional judgments that affect algorithm efficiency. To address these issues, an improved method has been proposed to further enhance the performance of QGA. In the initial population selection, a population grouping evolution method based on microhabitat coevolution strategy is used to prevent the algorithm from getting trapped in local optima when solving complex function problems. Additionally, quantum entanglement is introduced on top of quantum super-position by implementing quantum entanglement using quantum registers, and higher-order quantum rotation gates are employed that do not involve multiple conditional judgments of lookup tables, thus improving the efficiency of quantum chromosome measurement and evolutionary updates. Finally, traditional QGA and higher-order quantum genetic algorithms were applied to test functions in multiple experiments. The results indicate that, compared to traditional QGA, the higher-order quantum genetic algorithms have achieved an increase in convergence speed, an approximate 14.3% improvement in convergence precision, and possess enhanced global search capabilities.

International Conference on Electronic Engineering and Informatics (EEI)•Jun 28, 2024•2 citations

Novel Quantum Genetic Algorithm and Its Applications

Gexiang Zhang, Na Li, Weidong Jin +1 more

Frontiers of Electrical and Electronic Engineering in China•Jan 1, 2006•67 citations

Quantum Genetic Algorithm on Multilevel Quantum Systems

Valerii M. Tkachuk

We present a new evolutionary algorithm on the basis of quantum computations technology for solving optimization problems. The algorithm is built using many-valued quantum logic concept, which is more prospective from the computing power’s point of view. We compare the suggested algorithm to the traditional quantum genetic algorithm to demonstrate its high effectiveness on the example of test function global optimization problems. The advantages can be observed in the running time, the convergence speed, and the solution precision. The proposed implementation for the algorithm of quantum gate operator has an adaptive nature and does not require a lookup table. The role and the influence mechanism of the quantum disaster operator on the proposed algorithm effectiveness are also analyzed.

Mathematical Problems in Engineering•Jun 24, 2018•6 citations

A quantum genetic algorithm with quantum crossover and mutation operations

Akira SaiToh, Robabeh Rahimi, Mikio Nakahara

arXiv:1202.2026•Quantum Information Processing•Nov 26, 2013•57 citations

Design of Lookup-Table (LUT) Decoder for Protograph-Based Low-Density Parity-Check (LDPC) codes

Chatuporn Duangthong, Watid Phakphisut

The Belief-propagation (BP) algorithm is a powerful decoder for LDPC codes. However, the BP algorithm requires the high complexity of the check node operation. Therefore, in the previous works, a lookup table (LUT)-based decoder has been proposed for LDPC codes. In this work, we propose the LUT design for protograph LDPC codes. Our LUT design can support the parallel edge, variable node with degree-1 and punctured variable node. As a result, the coding losses of 2-, 3- and 4-bit quantization of LUT decoder are 1.6, 0.5 and 0.1 dB compared to BP algorithm.

International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)•Jul 5, 2022•2 citations

A Variant of Quantum Genetic Algorithm and Its Possible Applications

Pawan Kumar Tiwari, Deo Prakash Vidyarthi

Advances in intelligent and soft computing•Jan 1, 2012•5 citations
Quantum genetic algorithms(QGA) typically construct traditional quantum chromosomes as independent quantum bit systems, which has facilitated the enhancement of search speed and precision in genetic algorithms, demonstrating powerful problem-solving capabilities in optimization issues. Although traditional QGA have enriched population diversity, they still tend to fall into local optima, and the evolutionary update operations require rotation directions to be determined by lookup tables, a process involving multiple conditional judgments that affect algorithm efficiency. To address these issues, an improved method has been proposed to further enhance the performance of QGA. In the initial population selection, a population grouping evolution method based on microhabitat coevolution strategy is used to prevent the algorithm from getting trapped in local optima when solving complex function problems. Additionally, quantum entanglement is introduced on top of quantum super-position by implementing quantum entanglement using quantum registers, and higher-order quantum rotation gates are employed that do not involve multiple conditional judgments of lookup tables, thus improving the efficiency of quantum chromosome measurement and evolutionary updates. Finally, traditional QGA and higher-order quantum genetic algorithms were applied to test functions in multiple experiments. The results indicate that, compared to traditional QGA, the higher-order quantum genetic algorithms have achieved an increase in convergence speed, an approximate 14.3% improvement in convergence precision, and possess enhanced global search capabilities.
We present a new evolutionary algorithm on the basis of quantum computations technology for solving optimization problems. The algorithm is built using many-valued quantum logic concept, which is more prospective from the computing power’s point of view. We compare the suggested algorithm to the traditional quantum genetic algorithm to demonstrate its high effectiveness on the example of test function global optimization problems. The advantages can be observed in the running time, the convergence speed, and the solution precision. The proposed implementation for the algorithm of quantum gate operator has an adaptive nature and does not require a lookup table. The role and the influence mechanism of the quantum disaster operator on the proposed algorithm effectiveness are also analyzed.
The Belief-propagation (BP) algorithm is a powerful decoder for LDPC codes. However, the BP algorithm requires the high complexity of the check node operation. Therefore, in the previous works, a lookup table (LUT)-based decoder has been proposed for LDPC codes. In this work, we propose the LUT design for protograph LDPC codes. Our LUT design can support the parallel edge, variable node with degree-1 and punctured variable node. As a result, the coding losses of 2-, 3- and 4-bit quantization of LUT decoder are 1.6, 0.5 and 0.1 dB compared to BP algorithm.