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 (1)

• Recipes for spin-based quantum computing