Source-linked AI summary
Entanglement distillation from Greenberger-Horne-Zeilinger shares
Péter Vrana, Matthias Christandl
TL;DR
The paper studies asymptotic SLOCC conversion of GHZ states shared by subsets of parties, a problem connected to algebraic complexity. It uses a hypergraph framework and relates the distillation rate to bipartite log-rank, with explicit path and cycle examples.
Problem
The asymptotic SLOCC rate for converting GHZ states into three EPR pairs equals the matrix multiplication exponent, whose exact value remains open.
Source: §1 · p. 1Method
The paper represents products of subset-shared GHZ states by hypergraphs and uses line-graph orthogonal representations with local operators to construct transformations.
Source: §2 · p. 4Results
The asymptotic GHZ rate is given by the minimum bipartite log-rank; a cycle yields two GHZ states per copy via SLOCC.
Source: §3 · pp. 6–7Takeaways & Limitations
For products of GHZ states with different numbers of levels, the rate is the minimum cut weight when each edge is weighted by log r.
Source: §3 · p. 7The constructed states are well-defined only up to SLOCC equivalence, which the authors say suffices for their purposes.
Source: §2 · p. 3
Abstract
from arXiv · showhide
We study the problem of converting a product of Greenberger-Horne-Zeilinger (GHZ) states shared by subsets of several parties in an arbitrary way into GHZ states shared by every party. Our result is that if SLOCC transformations are allowed, then the best asymptotic rate is the minimum of bipartite log-ranks of the initial state. This generalizes a result by Strassen on the asymptotic subrank of the matrix multiplication tensor.
1 Introduction
The introduction connects asymptotic SLOCC transformations with algebraic complexity and sets up a hypergraph framework for studying GHZ states shared by subsets of parties. It introduces edge-connectivity as the quantity related to the bipartite-rank lower bound.
1 Introduction
- The asymptotic SLOCC rate for converting GHZ states into three EPR pairs equals the matrix multiplication exponent ω, whose exact value remains open.The stated bounds are 2 ≤ ω ≤ 2.3728639.Source: §1 · p. 1
- SLOCC convertibility means that a product of local linear maps transforms one multipartite state into the other.The definition is insensitive to scalar multiplication, so the paper works with unnormalized states.Source: §1 · pp. 1–2
- Degeneration relaxes SLOCC convertibility through polynomially parameterized local maps, and degeneration implies asymptotic rate at most 1.The paper gives GHZ degenerating to W as an example where one-shot SLOCC conversion is impossible.Source: §1 · p. 2
- The proof’s local operators weight terms by ε raised to the squared offset of their index sum from g.The construction sets N = 2^n up to relabelling and chooses g as a function of N.Source: §1 · p. 2
- The construction yields a GHZ state when each local basis element appears at most once, because any two indices determine the third uniquely.The proof says this condition is ensured by choosing g = N so the number of terms grows quadratically.Source: §1 · p. 2
- Products of GHZ states shared by subsets of k parties can be encoded by hypergraphs, with the matrix multiplication state corresponding to K3.Multiple edges are allowed in this encoding.Source: §1 · p. 3
- The theorem uses hypergraph edge-connectivity; its right-hand-side lower bound follows from the minimum bipartite log-rank being λ(H).Across any bipartition, the rank of a GHZ state is 2.Source: §1 · p. 3
2 Proof of main result
The proof encodes products of GHZ states with a hypergraph and uses index constraints to construct a GHZ state. Its bound is optimized by a general-position orthogonal representation of the line graph in dimension |E|−λ(H).
2 Proof of main result
- The proof writes the state as a sum indexed by edges, with each edge index appearing only at its incident vertices.A hypergraph is represented by vertices, edges, and an incidence relation; its edge set can be decomposed into single-edge hypergraphs.Source: §2 · pp. 3–4
- Local epsilon-dependent diagonal operations make the leading terms satisfy a system of linear equalities among the indices.The proof forms the equalities c1i1 + c2i2 + ··· + clil = g and squares the residual by taking its inner product with itself.Source: §2 · p. 4
- The construction requires vectors for nonincident edges to be orthogonal, and general position ensures the indices at one vertex determine all remaining indices.This requires dimension at least |E|−min_j |E_j|; a sufficient condition is that any d vectors are linearly independent.Source: §2 · p. 4
- Choosing a right-hand side g with at least ⌈(2C)−d n^(l−d)⌉ solutions supplies the index tuples used in the construction.The proof obtains such a g by averaging over a uniformly chosen G in a specified integer cube.Source: §2 · p. 5
- A general-position orthogonal representation exists in dimension |E|−λ(H), the dimension that gives the best bound.The line graph has such a representation over the integers; the proof first constructs one over the rationals and scales it.Source: §2 · p. 5
3 Discussion
The discussion illustrates how hypergraph connectivity governs GHZ distillation, extends the result to EPR-pair targets and unequal-level GHZ states, and notes a communication-complexity application.
3 Discussion
- A cycle yields two GHZ states per copy asymptotically via SLOCC, while the path yields one; whether the cycle rate is achievable by LOCC with vanishing error is unknown.The path transformation can be performed exactly on a single copy via LOCC by teleportation.Source: §3 · p. 6
- For a complete l-uniform hypergraph, a minimum cut is obtained by removing every edge incident with a distinguished vertex.The passage introduces this hypergraph as having each l-element subset as an edge, with no other edges.Source: §3 · p. 6
- Results for cycle graphs and the l = 2 special case have applications to nondeterministic multiparty quantum communication complexity, including new protocols and bounds [9].Source: §3 · p. 7
- For EPR-pair distillation between A and B, a minimum cut of t edges gives asymptotic rate 1/t, with an LOCC counterpart known as localizable entanglement.Menger’s theorem supplies t edge-disjoint paths; applying Theorem 1 to each path yields the EPR pairs.Source: §3 · p. 7
- The result extends to products of GHZ-type states with different numbers of levels, where the rate is the minimum bipartite log-rank, equivalently a minimum cut weight with edge weights log r for r-level GHZ states.The minimum cut weight replaces λ(H) in the theorem.Source: §3 · p. 7