GENETIC ALGORITHMS AND OPTIMIZATION PROBLEMS IN QUANTUM COMPUTING

Y. Hardy () and W.-H. Steeb ()
Additional contact information
Y. Hardy: International School for Scientific Computing, University of Johannesburg, Auckland Park 2006, South Africa
W.-H. Steeb: International School for Scientific Computing, University of Johannesburg, Auckland Park 2006, South Africa

International Journal of Modern Physics C (IJMPC), 2010, vol. 21, issue 11, 1359-1375

Abstract: We solve a number of problems in quantum computing by applying genetic algorithms. We use the bitset class ofC++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. TheC++code is also provided.

Keywords: Genetic algorithms and entanglement; tangle; three-tangle; hyperdeterminant; Bell-CHSH inequality (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183110015890
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:21:y:2010:i:11:n:s0129183110015890

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183110015890

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().