⚛️ quantum physics

Minimum Hilbert-Schmidt distance for Schmidt rank 2 states

The paper proves that for bipartite quantum states with a Schmidt rank of 2, the minimum Hilbert-Schmidt distance to the set of separable states is monotonic under Local Operations and Classical Communication (LOCC), providing both a closed-form expression and analytical/numerical proofs for this property.

Original authors: Palash Pandya

Published 2026-02-10

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Palash Pandya

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Quantum "Distance" Problem: A Simple Guide

Imagine you are trying to measure how "different" two things are. In the world of everyday objects, this is easy. If you have a red apple and a green apple, you can measure the distance between their colors.

In the world of Quantum Physics, scientists do something similar. They want to measure how "different" a quantum state is from a "separable" state. A separable state is like a pair of dancers moving in perfect, predictable harmony—they are independent and easy to understand. An entangled state is like two dancers performing a complex, spooky, synchronized routine where what one does instantly affects the other, no matter how far apart they are.

To measure this "spookiness" (entanglement), scientists often use something called the Hilbert-Schmidt distance. Think of this as a ruler used to measure the gap between the "spooky" dancer and the "predictable" dancer.

The Problem: The Broken Ruler

For a long time, there was a problem with this "ruler." In physics, if you perform a standard operation on a system (like cleaning a lens or filtering a signal), the "distance" between two things shouldn't suddenly get larger. It should either stay the same or get smaller. This is called contractivity.

Scientists discovered that the Hilbert-Schmidt ruler was "broken" in this way: if you applied certain standard processes to your quantum states, the ruler would suddenly show that the states were further apart than they actually were. Because of this "glitch," many scientists stopped using it as a reliable way to measure entanglement.

The Discovery: A Special Case Where the Ruler Works

This paper, written by Palash Pandya, changes the game. He says: "Wait! The ruler might be broken for everything, but it works perfectly for a specific, very important group of states."

He focuses on states with "Schmidt rank 2."

The Analogy: Imagine you have a toolkit. Most of your tools are broken and give weird readings when you use them on heavy machinery. But, you discover that if you are working specifically on high-end sports cars (the Schmidt rank 2 states), your tools work perfectly every single time.

What did the author actually prove?

The Magic Formula: He found a "closed-form expression." In plain English, he created a precise mathematical recipe. Instead of having to run a massive, slow computer simulation to find the distance, you can now just plug your numbers into his formula and get the answer instantly. It’s like moving from "guessing the weight of an object by looking at it" to "using a digital scale."
The "No-Increase" Rule (Monotonicity): He proved that for these specific states, if you perform "LOCC" (which is basically the standard way scientists manipulate quantum information), the entanglement distance never increases. The "broken ruler" is fixed for this specific category. The "spookiness" only stays the same or fades away; it never magically grows out of nowhere.
The "Closest Neighbor" Map: He also figured out how to find the "Closest Separable State." Imagine you are lost in a dark forest (the entangled state) and you want to find the nearest paved road (the separable state). He provided the exact map to find the shortest path to that road.

Why does this matter?

If we want to build Quantum Computers—the super-fast computers of the future—we need to be able to measure entanglement accurately. If our measurements are "glitchy," we can't build reliable machines.

By proving that this specific distance measure is reliable for a major class of quantum states, Pandya has given scientists a more efficient, faster, and more accurate way to check the "health" and "strength" of the quantum connections they are trying to create.

Technical Summary: Minimum Hilbert-Schmidt Distance for Schmidt Rank 2 States

Author: Palash Pandya
Affiliation: Center for Theoretical Physics, Polish Academy of Sciences

1. Problem Statement

The Hilbert-Schmidt (HS) distance between two quantum states is known to be non-contractive under Completely Positive Trace-Preserving (CPTP) maps. Because a valid entanglement measure must not increase under Local Operations and Classical Communication (LOCC), the HS distance itself is generally disqualified as an entanglement measure.

However, a distinction exists between the distance between two arbitrary states and the minimum distance from a state to the set of separable states ( $S$ ). The author investigates whether this minimum distance—defined as $D^2_{HS\text{min}}(\rho) = \min_{\sigma \in S} D^2_{HS}(\rho, \sigma)$ —is monotonic (non-increasing) under LOCC for a specific class of states: pure bipartite states with Schmidt rank 2.

2. Methodology

The paper employs a combination of analytical derivation, algorithmic application, and mathematical proof:

Analytical Derivation: The author utilizes the Verstraete et al. algorithm to find the closest PPT (Positive Partial Transpose) state. Since the HS norm is invariant under partial transposition, the problem is mapped to the partially transposed Hilbert space. For Schmidt rank 2 states, the author identifies that the reference state and the closest separable state share the same eigenvectors.
Optimization under Constraints: For two-qubit pure states, the author solves the minimization problem by considering the eigenvalues of the partially transposed density matrix. A critical challenge addressed is that the standard redistribution of eigenvalues (to satisfy the PPT criterion) can sometimes result in a non-positive semi-definite matrix in the original space. The author identifies the specific interval of Schmidt coefficients where this occurs and applies Lagrange multipliers to enforce positivity.
Monotonicity Proof: To prove the distance is an entanglement monotone, the author invokes Nielsen’s Theorem, which states that a pure state $|\psi\rangle$ can be transformed into $|\phi\rangle$ via LOCC if and only if the squared Schmidt coefficients of $|\psi\rangle$ are majorized by those of $|\phi\rangle$ ( $\lambda_\psi \prec \lambda_\phi$ ). The proof relies on demonstrating that the derived analytical expression for the minimum HS distance is a Schur-concave function of the Schmidt coefficients.

3. Key Contributions

Closed-Form Expression: The paper provides a piecewise analytical expression for the minimum squared Hilbert-Schmidt distance for any pure state of Schmidt rank 2, expressed in terms of its Schmidt coefficients ( $\alpha, \beta$ ).
Proof of Monotonicity: The author provides both analytical and numerical proof that for Schmidt rank 2 pure states, the minimum HS distance is non-increasing under LOCC.
Closest Separable State (CSS) Characterization: The paper provides an analytical method to construct the CSS, which can subsequently be used to derive optimal entanglement witnesses tailored to the specific state.
Generalization: The author demonstrates that while the derivation is performed for two-qubit systems, the result holds for any bipartite system where the Schmidt rank is 2 (e.g., higher-dimensional qudit systems).

4. Results

The Distance Function: For a state $|\psi\rangle = \alpha|00\rangle + \beta|11\rangle$ $∣ ψ ⟩ = α ∣00 ⟩ + β ∣11 ⟩$ (with $\alpha \leq \beta$ $α \leq β$ ), the minimum distance $D^2_{HS\text{min}}$ $D_{H S min}^{2}$ behaves differently depending on the value of $\alpha$ $α$ :
- In a specific range of $\alpha$ (near the maximally entangled state), the distance follows a simple quadratic form: $\frac{4}{3}\alpha^2\beta^2$ .
- In the range where the "positivity constraint" is active (near the separable limit), the distance follows a more complex expression $D(\alpha, \beta)$ derived from the boundary of the positive semi-definite cone.
Numerical Validation: Numerical comparisons using Gilbert’s algorithm and direct constrained minimization show that the analytical expression is highly accurate and matches numerical results within precision limits.
Monotonicity: The derivative of the distance function with respect to the smaller Schmidt coefficient $\alpha$ was proven to be positive ( $\frac{dD}{d\alpha} \geq 0$ ), confirming that as entanglement decreases (via LOCC), the distance to the separable set also decreases.

5. Significance

This work rehabilitates the Hilbert-Schmidt distance as a viable entanglement quantifier for a significant class of states. While the HS distance is not a general entanglement measure due to its non-contractivity under CPTP maps, this paper proves that its distance-to-separability version is a valid monotone under LOCC for Schmidt rank 2 states. This provides researchers with a computationally efficient, geometrically intuitive, and analytically exact tool for quantifying entanglement and constructing optimal witnesses in bipartite systems.