Numerical algorithms for use in quantum information.
From MaRDI portal
Recommendations
- Calculation of the quantum entanglement measure of bipartite states, based on relative entropy, using genetic algorithms
- scientific article; zbMATH DE number 5320190
- Quantum information theory
- Mathematical foundations of quantum information and computation and its applications to nano- and bio-systems
- Quantum information
Cites work
- scientific article; zbMATH DE number 5320161 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Calculation of the quantum entanglement measure of bipartite states, based on relative entropy, using genetic algorithms
- Composed ensembles of random unitary matrices
- Entanglement of formation of an arbitrary state of two qubits
- Mixed-state entanglement and quantum error correction
- Quantifying Entanglement
- Quantum cryptography based on Bell’s theorem
- Two-spin-\(\frac12\) mixtures and Bell's inequalities.
Cited in
(7)- Numerical Recipes in Quantum Information Theory and Quantum Computing
- Geometric relations in classical and quantum information theory using the Lambert-Tsallis \(W_q(x)\) function
- Genetic algorithms and optimization problems in quantum computing
- Calculation of the quantum entanglement measure of bipartite states, based on relative entropy, using genetic algorithms
- Simulation of entanglement generation and variation in quantum computation
- Long-step path-following algorithm for quantum information theory: some numerical aspects and applications
- Large-Scale Scientific Computing
This page was built for publication: Numerical algorithms for use in quantum information.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1418632)
