Genetic Algorithms and Optimization Problems in Quantum Computing

Created by W.Langdon from gp-bibliography.bib Revision:1.4420

@Article{hardy10a,
  author =       "Yorick Hardy and Willi-Hans Steeb",
  title =        "Genetic Algorithms and Optimization Problems in
                 Quantum Computing",
  journal =      "International Journal of Modern Physics C",
  volume =       "21",
  pages =        "1359--1375",
  year =         "2010",
  keywords =     "genetic algorithms, genetic programming, genetic
                 algorithms and entanglement, tangle, three-tangle,
                 hyper-determinant, Bell-CHSH inequality",
  DOI =          "doi:10.1142/S0129183110015890",
  URL =          "http://dx.doi.org/10.1142/S0129183110015890",
  abstract =     "We solve a number of problems in quantum computing by
                 applying genetic algorithms. We use the bitset class of
                 C++ 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.
                 The C++ code is also provided.",
}

Genetic Programming entries for Yorick Hardy Willi-Hans Steeb

Citations