Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Computational Physics

Calculation of the Quantum Entanglement Measure of Bipartite States, Based on Relative Entropy, Using Genetic Algorithms

Rubens Viana Ramos, Rui Fragassi Souza

Published Jan 1, 2002• 18 citations
Publisher
DOI
10.1006/jcph.2001.6957

Related papers

Optimization of entanglement using genetic algorithms

Navarro Muñoz, Jorge Carlos

•Feb 1, 2012•0 citations

Entanglement measure for multipartite pure states and its numerical calculation

Andrey Yu. Chernyavskiy

The quantification and classification of quantum entanglement is a very important and still open question of quantum information theory. In this paper, we describe an entanglement measure for multipartite pure states (the minimum of Shannon's entropy of orthogonal measurements). This measure is additive, monotone under LOCC, and coincides with the reduced von Neumann entropy on bipartite states. A method for numerical calculation of this measure by genetic algorithms is also presented. Moreover, the minimization of entropy technique is extended to fermionic states.

arXiv:0905.0201•May 2, 2009•2 citations

Calculation of quantum discord and entanglement measures using the random mutations optimization algorithm

Andrey Yu. Chernyavskiy

The simple and universal global optimization method based on simplified multipopulation genetic algorithm is presented. The method is applied to quantum information problems. It is compared to the genetic algorithm on standard test functions, and also tested on the calculation of quantum discord and minimal entanglement entropy, which is an entanglement measure for pure multipartite states.

arXiv:1304.3703•Apr 12, 2013•3 citations

Accurate calculation of the geometric measure of entanglement for multipartite quantum states

Peiyuan Teng

arXiv:1609.02076•Quantum Information Processing•Jun 12, 2017•12 citations

Computational Complexity Measures of Multipartite Quantum Entanglement

Tomoyuki Yamakami

arXiv:quant-ph/0308072•Lecture notes in computer science•Jan 1, 2003•0 citations

Quantification of Entanglement by Means of Convergent Iterations

Jaroslav Řeháček, Z. Hradil

The relative entropy of entanglement of a given bipartite quantum state is calculated by means of a convergent iterative algorithm. When this state turns out to be nonseparable, the algorithm also provides the corresponding optimal entanglement-witness measurement.

arXiv:quant-ph/0205071•Physical Review Letters•Mar 26, 2003•19 citations
The quantification and classification of quantum entanglement is a very important and still open question of quantum information theory. In this paper, we describe an entanglement measure for multipartite pure states (the minimum of Shannon's entropy of orthogonal measurements). This measure is additive, monotone under LOCC, and coincides with the reduced von Neumann entropy on bipartite states. A method for numerical calculation of this measure by genetic algorithms is also presented. Moreover, the minimization of entropy technique is extended to fermionic states.