pith. sign in

arxiv: quant-ph/0604126 · v2 · submitted 2006-04-18 · 🪐 quant-ph

Genetic algorithm optimization of entanglement

classification 🪐 quant-ph
keywords entanglementgeneticoptimizationalgorithmalgorithmicapplicationapproachcases
0
0 comments X
read the original 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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.