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

Advances in intelligent systems and computing

On Genetic Unitary Matrices and Quantum-Algorithmic Genetics

Sergey Valentinovich Petoukhov, Elena S. Petukhova

Published May 3, 2019• 3 citations
Publisher
DOI
10.1007/978-3-030-12082-5_10

Related papers

Quantum algorithms and the genetic code

Apoorva Patel

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

Genetic alphabets, unitary matrixes and quantum-algorithmic genetics

Sergey Valentinovich Petoukhov, Elena S. Petukhova, Vitaly I. Svirin

Unitary operators are the basis of all calculations in quantum computers and play an important role in quantum mechanics. The presented results show that matrix forms of representation of structured DNA and RNA alphabets can be considered as a set of sparse unitary matrices. These results are useful for the development of models of quantum-algorithmic genetics, from the point of view of which living organisms are quantum-information entities.

IOP Conference Series Materials Science and Engineering•Mar 26, 2019•2 citations

Evolving quantum circuits using genetic algorithm

M. Lukac, Marek A. Perkowski

In this paper we focus on a general approach of using genetic algorithm (GA) to evolve Quantum circuits (QC). We propose a generic GA to evolve arbitrary quantum. circuit specified by a (target) unitary matrix as well as a specific encoding that reduces the time of calculating the resultant unitary matrices of chromosomes. We demonstrate that, in contrast to previous approaches, our encoding allows synthesis of small quantum circuits of arbitrary type, using standard genetic operators.

NASA/DoD Conference on Evolvable Hardware•Jun 25, 2003•77 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•66 citations

Genetic Quantum Algorithms with Binary Observation

Yuri Skobtsov

Studies in systems, decision and control•Jan 1, 2024•1 citation

Construction of Unitary Matrices and Bounding Minimal Quantum Gate Fidelity Using Genetic Algorithms

Connor Gregor

In this thesis a novel representation of a unitary matrix intended to act as a quantum program generated by evolutionary programming shall be presented. The representation consists of a number of $2 \\times 2$ matrices being evolved and combined such that a unitary matrix capable of carrying out a predetermined function on a pure quantum state is generated. In this thesis the algorithm will demonstrate proficiency at performing tasks such as cloning a quantum state or creating order amidst a quantum state in superposition. Furthermore, in the field of quantum information, quantum channels are implemented in order to either perform quantum operations to a quantum state or for one to transmit a quantum state from a sender to a recipient. When this happens, the physical implementation of a quantum channel will often differ from the intended quantum channel that was to be implemented. In cases such as these, the quantum gate fidelity is calculated in order to determine how decoherent the resulting state is from what it should have been. In this thesis a procedure that uses a genetic algorithm to place an upper bound on minimal quantum gate fidelity will be presented.

•Sep 1, 2018•2 citations
In this thesis a novel representation of a unitary matrix intended to act as a quantum program generated by evolutionary programming shall be presented. The representation consists of a number of 2times22 \\times 22times2 matrices being evolved and combined such that a unitary matrix capable of carrying out a predetermined function on a pure quantum state is generated. In this thesis the algorithm will demonstrate proficiency at performing tasks such as cloning a quantum state or creating order amidst a quantum state in superposition. Furthermore, in the field of quantum information, quantum channels are implemented in order to either perform quantum operations to a quantum state or for one to transmit a quantum state from a sender to a recipient. When this happens, the physical implementation of a quantum channel will often differ from the intended quantum channel that was to be implemented. In cases such as these, the quantum gate fidelity is calculated in order to determine how decoherent the resulting state is from what it should have been. In this thesis a procedure that uses a genetic algorithm to place an upper bound on minimal quantum gate fidelity will be presented.