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/0002036 · Physics Letters A

Entanglement measures and the Hilbert–Schmidt distance

Masanao Ozawa

Published Apr 1, 2000• 210 citations
arXivHTMLPDF
DOI
10.1016/s0375-9601(00)00171-7

Related papers

A new entanglement measure induced by the Hilbert–Schmidt norm

Christopher Witte, Mathias Trucks

arXiv:quant-ph/9811027•Physics Letters A•Jun 1, 1999•113 citations

Concurrence as a Relative Entropy with Hilbert-Schmidt Distance in Bell Decomposable States

Seyed Javad Akhtarshenas, M. A. Jafarizadeh

Hilbert-Schmidt distance reduces to Euclidean distance in Bell decomposable states. Based on this, entanglement of these states are obtained according to the protocol proposed in Ref. [V. Vedral et al, Phys. Rev. Lett. 78, 2275 (1995)] with Hilbert-Schmidt distance. It is shown that this measure is equal to the concurrence and thus can be used to generate entanglement of formation. We also introduce a new measure of distance and show that under the action of restricted LQCC operations, the associated measure of entanglement transforms in the same way as the concurrence transforms .

arXiv:quant-ph/0208001•Jul 31, 2002•0 citations

Hilbert-Schmidt distance and entanglement witnessing

Palash Pandya, Omer Sakarya, Marcin Wieśniak

Gilbert proposed an algorithm for bounding the distance between a given point and a convex set. We apply the Gilbert's algorithm to get an upper bound on the Hilbert-Schmidt distance between a given state and the set of separable states. While Hilbert-Schmidt distance does not form a proper entanglement measure, it can nevertheless be useful for witnessing entanglement. We provide a few methods based on the Gilbert's algorithm that can reliably qualify a given state as strongly entangled or practically separable, while being computationally efficient. The method also outputs successively improved approximations to the closest separable state for the given state. We demonstrate the efficacy of the method with examples.

arXiv:1811.06599•Physical Review A•Jul 7, 2020•29 citations

Measures of Quantum Entanglement

P. K. Aravind

Springer eBooks•Jan 1, 1996•2 citations

Entanglement measures based on observable correlations

Shunlong Luo

Theoretical and Mathematical Physics•Jun 1, 2008•1 citation

Minimum Hilbert-Schmidt distance for Schmidt rank 2 states

Palash Pandya

The Hilbert-Schmidt distance between two states is proven to be non-contractive under CPTP maps, and therefore is not considered as an entanglement measure. However, that alone does not imply that the minimum Hilbert-Schmidt distance from the set of separable states is not contractive as well. To the contrary, not only do we provide a closed-form expression, we also provide analytical and numerical proof that minimum Hilbert-Schmidt distance for a given bipartite quantum state of Schmidt rank 2 is non-increasing under LOCC. The minimisation is taken to be over the set of separable states. We apply the algorithm by Verstraete et al [Journal of Modern Optics, 49(8), 2002] for the derivation of the analytical expression and Nielsen's theorem for the proof of monotonicity of the distance under LOCC.

arXiv:2308.06245•Aug 11, 2023•1 citation
Hilbert-Schmidt distance reduces to Euclidean distance in Bell decomposable states. Based on this, entanglement of these states are obtained according to the protocol proposed in Ref. [V. Vedral et al, Phys. Rev. Lett. 78, 2275 (1995)] with Hilbert-Schmidt distance. It is shown that this measure is equal to the concurrence and thus can be used to generate entanglement of formation. We also introduce a new measure of distance and show that under the action of restricted LQCC operations, the associated measure of entanglement transforms in the same way as the concurrence transforms .
Gilbert proposed an algorithm for bounding the distance between a given point and a convex set. We apply the Gilbert's algorithm to get an upper bound on the Hilbert-Schmidt distance between a given state and the set of separable states. While Hilbert-Schmidt distance does not form a proper entanglement measure, it can nevertheless be useful for witnessing entanglement. We provide a few methods based on the Gilbert's algorithm that can reliably qualify a given state as strongly entangled or practically separable, while being computationally efficient. The method also outputs successively improved approximations to the closest separable state for the given state. We demonstrate the efficacy of the method with examples.
The Hilbert-Schmidt distance between two states is proven to be non-contractive under CPTP maps, and therefore is not considered as an entanglement measure. However, that alone does not imply that the minimum Hilbert-Schmidt distance from the set of separable states is not contractive as well. To the contrary, not only do we provide a closed-form expression, we also provide analytical and numerical proof that minimum Hilbert-Schmidt distance for a given bipartite quantum state of Schmidt rank 2 is non-increasing under LOCC. The minimisation is taken to be over the set of separable states. We apply the algorithm by Verstraete et al [Journal of Modern Optics, 49(8), 2002] for the derivation of the analytical expression and Nielsen's theorem for the proof of monotonicity of the distance under LOCC.