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

arXiv:quant-ph/0205071 · Physical Review Letters

Quantification of Entanglement by Means of Convergent Iterations

Jaroslav Řeháček, Z. Hradil

Published Mar 26, 2003• 22 citations
arXivHTMLPDF

Abstract

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.
DOI
10.1103/physrevlett.90.127904

Related papers

Iterative algorithm for the detection and quantification of entanglement

Jaroslav Řeháček, Z. Hradil

A set of extremal equations for relative entropy E is derived. Solving these equations by means of repeated convergent iterations is shown . The extremal equations indicate that there is a structure of quantum measurement associated with the extremal solution. The separable measurement obtained in this way specifies the extremal separable state and, significantly, provides the optimal entanglement witness operator revealing the possible entanglement of the input states.

European Quantum Electronics Conference (EQEC)•Nov 15, 2004•0 citations

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

Rubens Viana Ramos, Rui Fragassi Souza

Journal of Computational Physics•Jan 1, 2002•18 citations

An algorithm to explore entanglement in small systems

Robin Reuvers

A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms. Depending on the choice of norm, the optimizing states maximize or minimize entanglement, possibly across several bipartite cuts at the same time and possibly only among states in a specified subspace. Recognizing that convergence but not success is certain, we use the algorithm to explore topics ranging from fermionic reduced density matrices and varieties of pure quantum states to absolutely maximally entangled states and minimal output entropy of channels.

arXiv:1711.07943•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Jun 1, 2018•16 citations

Iterations of nonlinear entanglement witnesses

Tobias Moroder, Otfried Gühne, Norbert Lütkenhaus

We describe a generic way to improve a given linear entanglement witness by a quadratic, nonlinear term. This method can be iterated, leading to a whole sequence of nonlinear witnesses, which become stronger in each step of the iteration. We show how to optimize this iteration with respect to a given state and prove that in the limit of the iteration the nonlinear witness detects all states that can be detected by the positive map corresponding to the original linear witness.

arXiv:0806.0855•Physical Review A•Sep 23, 2008•22 citations

Quantification of entanglement via uncertainties

Alexander A. Klyachko, Barış Öztop, A.S. Shumovsky

We show that entanglement of pure multiparty states can be quantified by means of quantum uncertainties of certain basic observables through the use of a measure that was initially proposed by Klyachko et al. [Appl. Phys. Lett. 88, 124102 (2006)] for bipartite systems.

arXiv:quant-ph/0606119•Physical Review A•Mar 12, 2007•26 citations

Two Theorems on Calculating the Relative Entropy of Entanglement

Shengjun Wu, Wu Qiang, Zhang Yong-De

We present two theorems on calculating the relative entropy of entanglement. Theorem 1 is an extension of Vedral and Plenio's theorem (Phys. Rev. A 57 (1998) 1619) for pure states, which is useful for calculating the relative entropy of entanglement for all pure states as well as for a class of mixed states. Theorem 2 gives the relative entropy of entanglement for any bipartite state whose tripartite purification has two separable reduced bipartite states.

arXiv:quant-ph/0004018•Chinese Physics Letters•Feb 1, 2001•12 citations
A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms. Depending on the choice of norm, the optimizing states maximize or minimize entanglement, possibly across several bipartite cuts at the same time and possibly only among states in a specified subspace. Recognizing that convergence but not success is certain, we use the algorithm to explore topics ranging from fermionic reduced density matrices and varieties of pure quantum states to absolutely maximally entangled states and minimal output entropy of channels.