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:1811.06599 · Physical Review A

Hilbert-Schmidt distance and entanglement witnessing

Palash Pandya, Omer Sakarya, Marcin Wieśniak

Published Jul 7, 2020• 25 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.102.012409

Related papers

Algorithm for evaluating distance-based entanglement measures

Yixuan Hu, Ye‐Chao Liu, Jiangwei Shang

Quantifying entanglement in quantum systems is an important yet challenging task due to its NP-hard nature. In this work, we propose an efficient algorithm for evaluating distance-based entanglement measures. Our approach builds on Gilbert's algorithm for convex optimization, providing a reliable upper bound on the entanglement of a given arbitrary state. We demonstrate the effectiveness of our algorithm by applying it to various examples, such as calculating the squared Bures metric of entanglement as well as the relative entropy of entanglement for GHZ states, W states, Horodecki states, and chessboard states. These results demonstrate that our algorithm is a versatile and accurate tool that can quickly provide reliable upper bounds for entanglement measures.

arXiv:2308.02326•Chinese Physics B•May 16, 2023•1 citation

On the geometry of entangled states

Frank Verstraete, Jeroen Dehaene, Bart De Moor

The basic question that is addressed in this paper is finding the closest separable state for a given entangled state, measured with the Hilbert-Schmidt distance. While this problem is in general very difficult, we show that the following strongly related problem can be solved: find the Hilbert-Schmidt distance of an entangled state to the set of all partially transposed states. We prove that this latter distance can be expressed as a function of the negative eigenvalues of the partial transpose of the entangled state, and show how it is related to the distance of a state to the set of positive, partially transposed (PPT) states. We illustrate this by calculating the closest biseparable state to the W state and give a simple and very general proof for the fact that the set of W-type states is not of measure zero. Next we show that all surfaces with states whose partial transposes have constant minimal negative eigenvalue are similar to the boundary of PPT states. We illustrate this with some examples on bipartite qubit states, where contours of constant negativity are plotted on two-dimensional intersections of the complete state space.

arXiv:quant-ph/0107155•Journal of Modern Optics•Jul 1, 2002•69 citations

Distance between Bound Entangled States from Unextendible Product Bases and Separable States

Marcin Wieśniak, Palash Pandya, Omer Sakarya +1 more

We discuss the use of the Gilbert algorithm to tailor entanglement witnesses for unextendible product basis bound entangled states (UPB BE states). The method relies on the fact that an optimal entanglement witness is given by a plane perpendicular to a line between the reference state, entanglement of which is to be witnessed, and its closest separable state (CSS). The Gilbert algorithm finds an approximation of CSS. In this article, we investigate if this approximation can be good enough to yield a valid entanglement witness. We compare witnesses found with Gilbert algorithm and those given by Bandyopadhyay–Ghosh–Roychowdhury (BGR) construction. This comparison allows us to learn about the amount of entanglement and we find a relationship between it and a feature of the construction of UPBBE states, namely the size of their central tile. We show that in most studied cases, witnesses found with the Gilbert algorithm in this work are more optimal than ones obtained by Bandyopadhyay, Ghosh, and Roychowdhury. This result implies the increased tolerance to experimental imperfections in a realization of the state.

arXiv:1912.06569•Quantum Reports•Jan 13, 2020•19 citations

Optimal entanglement witnesses for qubits and qutrits

Reinhold A. Bertlmann, Katharina Durstberger-Rennhofer, Beatrix C. Hiesmayr +1 more

We study the connection between the Hilbert-Schmidt measure of entanglement (that is the minimal distance of an entangled state to the set of separable states) and entanglement witness in terms of a generalized Bell inequality which distinguishes between entangled and separable states. A method for checking the nearest separable state to a given entangled one is presented. We illustrate the general results by considering isotropic states, in particular two-qubit and two-qutrit states---and their generalizations to arbitrary dimensions---where we calculate the optimal entanglement witnesses explicitly.

arXiv:quant-ph/0508043•Physical Review A•Nov 28, 2005•74 citations

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•0 citations

Entanglement Witness and Bell Operator by Hilbert-Schmidt Decomposition

Y. Ben-Aryeh, A. Mann

A new method is developed for obtaining entanglement witnesses (EW) and Bell operators for n-qubit state. Observing that both EW and Bell operators must have nonzero overlap with the given state we suggest constructing them using some of the terms that appear in the Hilbert-Schmidt (HS) decomposition of the state (not necessarily with the same coefficients). We illustrate the method for several 3 and 4 qubits states, and show improvement of the entanglement region compared with known results. Since the Bell operator and the EW may be restricted to few HS terms, separability/nonseparability of the quantum state can be checked by measuring only these terms.

•May 26, 2019•0 citations
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.
Quantifying entanglement in quantum systems is an important yet challenging task due to its NP-hard nature. In this work, we propose an efficient algorithm for evaluating distance-based entanglement measures. Our approach builds on Gilbert's algorithm for convex optimization, providing a reliable upper bound on the entanglement of a given arbitrary state. We demonstrate the effectiveness of our algorithm by applying it to various examples, such as calculating the squared Bures metric of entanglement as well as the relative entropy of entanglement for GHZ states, W states, Horodecki states, and chessboard states. These results demonstrate that our algorithm is a versatile and accurate tool that can quickly provide reliable upper bounds for entanglement measures.
The basic question that is addressed in this paper is finding the closest separable state for a given entangled state, measured with the Hilbert-Schmidt distance. While this problem is in general very difficult, we show that the following strongly related problem can be solved: find the Hilbert-Schmidt distance of an entangled state to the set of all partially transposed states. We prove that this latter distance can be expressed as a function of the negative eigenvalues of the partial transpose of the entangled state, and show how it is related to the distance of a state to the set of positive, partially transposed (PPT) states. We illustrate this by calculating the closest biseparable state to the W state and give a simple and very general proof for the fact that the set of W-type states is not of measure zero. Next we show that all surfaces with states whose partial transposes have constant minimal negative eigenvalue are similar to the boundary of PPT states. We illustrate this with some examples on bipartite qubit states, where contours of constant negativity are plotted on two-dimensional intersections of the complete state space.
We discuss the use of the Gilbert algorithm to tailor entanglement witnesses for unextendible product basis bound entangled states (UPB BE states). The method relies on the fact that an optimal entanglement witness is given by a plane perpendicular to a line between the reference state, entanglement of which is to be witnessed, and its closest separable state (CSS). The Gilbert algorithm finds an approximation of CSS. In this article, we investigate if this approximation can be good enough to yield a valid entanglement witness. We compare witnesses found with Gilbert algorithm and those given by Bandyopadhyay–Ghosh–Roychowdhury (BGR) construction. This comparison allows us to learn about the amount of entanglement and we find a relationship between it and a feature of the construction of UPBBE states, namely the size of their central tile. We show that in most studied cases, witnesses found with the Gilbert algorithm in this work are more optimal than ones obtained by Bandyopadhyay, Ghosh, and Roychowdhury. This result implies the increased tolerance to experimental imperfections in a realization of the state.
We study the connection between the Hilbert-Schmidt measure of entanglement (that is the minimal distance of an entangled state to the set of separable states) and entanglement witness in terms of a generalized Bell inequality which distinguishes between entangled and separable states. A method for checking the nearest separable state to a given entangled one is presented. We illustrate the general results by considering isotropic states, in particular two-qubit and two-qutrit states---and their generalizations to arbitrary dimensions---where we calculate the optimal entanglement witnesses explicitly.
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.
A new method is developed for obtaining entanglement witnesses (EW) and Bell operators for n-qubit state. Observing that both EW and Bell operators must have nonzero overlap with the given state we suggest constructing them using some of the terms that appear in the Hilbert-Schmidt (HS) decomposition of the state (not necessarily with the same coefficients). We illustrate the method for several 3 and 4 qubits states, and show improvement of the entanglement region compared with known results. Since the Bell operator and the EW may be restricted to few HS terms, separability/nonseparability of the quantum state can be checked by measuring only these terms.