GENETIC ALGORITHMS AND OPTIMIZATION PROBLEMS IN QUANTUM COMPUTING

DOI10.1142/S0129183110015890zbMath1205.81061OpenAlexW1974288330MaRDI QIDQ3070091

Yorick Hardy, Willi-Hans Steeb

Publication date: 2 February 2011

Published in: International Journal of Modern Physics C (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129183110015890

zbMATH Keywords

tanglethree-tanglehyperdeterminantBell-CHSH inequalitygenetic algorithms and entanglement

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Cayley transform and the Kronecker product of Hermitian matrices ⋮ An eigenvalue problem for a Fermi system and Lie algebras ⋮ Efficient experimental design of high-fidelity three-qubit quantum gates via genetic programming

Cites Work

• Numerical algorithms for use in quantum information.
• Calculation of the quantum entanglement measure of bipartite states, based on relative entropy, using genetic algorithms
• GENETIC ALGORITHMS, FLOATING POINT NUMBERS AND APPLICATIONS
• The Nonlinear Workbook

This page was built for publication: GENETIC ALGORITHMS AND OPTIMIZATION PROBLEMS IN QUANTUM COMPUTING