Numerical algorithms for use in quantum information.
From MaRDI portal
Publication:1418632
DOI10.1016/S0021-9991(03)00348-6zbMath1034.81009MaRDI QIDQ1418632
Publication date: 14 January 2004
Published in: Journal of Computational Physics (Search for Journal in Brave)
Genetic algorithmsnumerical simulationgenetic algorithmprocedureMinimization\(C^2\otimes C^2\) systemsDNA constructionquantum entanglement measureQuantum gatesQuantum relative entropy
Related Items (3)
Simulation of entanglement generation and variation in quantum computation ⋮ Geometric relations in classical and quantum information theory using the Lambert-Tsallis \(W_q(x)\) function ⋮ GENETIC ALGORITHMS AND OPTIMIZATION PROBLEMS IN QUANTUM COMPUTING
Cites Work
- Calculation of the quantum entanglement measure of bipartite states, based on relative entropy, using genetic algorithms
- Two-spin-\(\frac12\) mixtures and Bell's inequalities.
- Quantum cryptography based on Bell’s theorem
- Quantifying Entanglement
- Composed ensembles of random unitary matrices
- Entanglement of Formation of an Arbitrary State of Two Qubits
- Mixed-state entanglement and quantum error correction
- Unnamed Item
- Unnamed Item
This page was built for publication: Numerical algorithms for use in quantum information.