Genetic algorithm optimization of entanglement

Abstract

We present an application of a 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

26 pages with 13 figures, based on Chapter 3 of the Master thesis of the first author defended at IPICyT, San Luis Potosi, Mx, on 22nd of February 2006, similar to the published version [Fig. 5 left out but contains the Appendix figure]

References in corpus (7)

• Entanglement of Formation of an Arbitrary State of Two Qubits
• Persistent entanglement in arrays of interacting particles
• Entangled Rings
• Recipes for spin-based quantum computing
• Fermionic entanglement in itinerant systems
• Quantum Entanglement in Heisenberg Antiferromagnets
• Evolving Quantum Circuits using Genetic Algorithms

Cited by in corpus (3)

• Efficient experimental design of high-fidelity three-qubit quantum gates via genetic programming
• A genetic-algorithm-based method to find the unitary transformations for any de- sired quantum computation and application to a one-bit oracle decision problem
• Designing lattice structures with maximal nearest-neighbor entanglement