arXiv:quant-ph/0604126 · Physical Review A

Genetic algorithm optimization of entanglement

Jorge Carlos Navarro-Muñoz, Haret Codratian Rosu, Román López-Sandoval

Published Nov 7, 2006• 6 citations

Abstract

We present an application of the genetic algorithmic computational method to the optimization of the concurrence measure of entanglement for the cases of one dimensional chains, as well as square and triangular lattices in a simple tight-binding approach in which the hopping of electrons is much stronger than the phonon dissipation.

DOI: 10.1103/physreva.74.052308

Related papers

Designing lattice structures with maximal nearest-neighbor entanglement

Jorge Carlos Navarro-Muñoz, Román López-Sandoval, Martı́n E. Garcia

In this paper, we study the numerical optimization of nearest-neighbor concurrence of bipartite one- and two-dimensional lattices, as well as non-bipartite two-dimensional lattices. These systems are described in the framework of a tight-binding Hamiltonian while the optimization of concurrence was performed using genetic algorithms. Our results show that the concurrence of the optimized lattice structures is considerably higher than that of non-optimized systems. In the case of one-dimensional chains, the concurrence increases dramatically when the system begins to dimerize, i.e., it undergoes a structural phase transition (Peierls distortion). This result is consistent with the idea that entanglement is maximal or shows a singularity near quantum phase transitions. Moreover, the optimization of concurrence in two-dimensional bipartite and non-bipartite lattices is achieved when the structures break into smaller subsystems, which are arranged in geometrically distinguishable configurations.

arXiv:0811.0339Journal of Physics A Mathematical and TheoreticalJul 15, 20091 citation

Calculation of quantum discord and entanglement measures using the random mutations optimization algorithm

Andrey Yu. Chernyavskiy

The simple and universal global optimization method based on simplified multipopulation genetic algorithm is presented. The method is applied to quantum information problems. It is compared to the genetic algorithm on standard test functions, and also tested on the calculation of quantum discord and minimal entanglement entropy, which is an entanglement measure for pure multipartite states.

arXiv:1304.3703Apr 12, 20133 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 CNov 1, 20104 citations

Quantum Entanglement Genetic Algorithm

Jincheng Zhang

This paper proposes a novel approach to optimization problems by integrating quantum entanglement with the Genetic Algorithm (GA). The core idea is to leverage the inherent parallelism and enhanced information transfer capabilities of quantum entanglement to significantly improve the search performance of the GA. We represent genetic algorithm chromosomes as quantum states and employ quantum entanglement to facilitate rapid information exchange and crossover operations across multiple qubits. This mechanism allows for parallel exploration of the search space, mitigating the limitations of traditional GA's tendency towards local optima. The theoretical framework and the underlying principles are presented, demonstrating the potential for the Quantum Entanglement Genetic Algorithm (QGA) to accelerate the solution of complex optimization problems. The algorithm's effectiveness is discussed through a mathematical formulation, focusing on the key components of the QGA and its advantages over conventional GA. The ultimate goal is to demonstrate a robust and efficient method for tackling challenging optimization tasks.

Sep 7, 20260 citations

Nonconvex optimization strategy for computing convex-roof entanglement

Jimmie Adriazola, Katarzyna Roszak

We develop a numerical methodology for the computation of entanglement measures for mixed quantum states. Using the well-known Schr\"odinger-Hughston-Jozsa-Wootters theorem, the computation of convex-roof entanglement measures is reframed as a search for unitary matrices: a nonconvex optimization problem. To address this nonconvexity, we modify a genetic algorithm, known in the literature as differential evolution, constraining the search space to unitary matrices by using a QR factorization. We then refine results using a quasi-Newton method. We benchmark our method on simple test problems and, as an application, compute entanglement between a system and its environment over time for pure dephasing evolutions. We also study the temperature dependence of Gibbs state entanglement for a class of block-diagonal Hamiltonians to provide a complementary test scenario with a set of entangled states that are qualitatively different. We find that the method works well enough to reliably reproduce entanglement curves, even for comparatively large systems. The modified genetic algorithm is a derivative-free, nonconvex computational method that broadly applies to the computation of convex-roof entanglement measures.

arXiv:2412.10166Physical Review AMar 28, 20250 citations

Based on Genetic Algorithm for Quantum Circuit Optimization

Jincheng Zhang

This paper explores the application of genetic algorithms (GAs) to optimize quantum circuits. The core claim is that GA can effectively improve the efficiency and accuracy of quantum computation by strategically modifying the topology and control parameters of quantum circuits. The proposed mechanism treats a quantum circuit as a genetic individual, leveraging the principles of genetic algorithms – including crossover, mutation, and selection – to iteratively enhance circuit performance. This approach represents a novel method for quantum circuit optimization, offering a potentially robust and adaptable solution compared to traditional optimization techniques. We present a framework for implementing this approach, focusing on the algorithmic steps and considerations for successful application. The exploration will cover the challenges and potential benefits of integrating evolutionary algorithms with the unique characteristics of quantum computation. ---

Sep 5, 20260 citations