Genetic algorithm optimization of entanglement
Jorge C. Navarro-Munoz, H. C. Rosu, R. Lopez-Sandoval
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
Create a lesson
Related papers
Approximate Synthetic Spectra of Quantum Systems Associated with Compact Lie Groups
Junyang Liu, Hang Wang, Houjin Wang et al.
An example of universal braiding in Links--Gould topological quantum computation
Matthew Harper, Ben-Michael Kohli
Reasoning about Shared-Qubit Concurrency in Quantum Computing
Mingsheng Ying
Information-Geometric Representation of Upper Bounds on Fluctuation Growth in Open Quantum Systems
Newshaw Bahreyni, Paul M. Alsing
Initialization-controlled fault sensitivity and force-balance plateaus in noisy variational quantum optimization
Longhui Shen, Fangzhou Jin, Bin Guo
Quantum identity authentication protocol via perturbed probability amplitudes
Xiangqun Fu, Zheng Han, Hongwei Li et al.