Threshold entanglement sharing: quantum states with absolutely separable marginals

This paper introduces threshold entanglement (TE) states, a class of multipartite quantum states where entanglement across bipartitions ensures all smaller marginals are absolutely separable, demonstrating their existence for four and seven qubits while proving their non-existence for eight qubits through improved semidefinite programming bounds on purity and entanglement.

The Gist

Imagine you have a giant, magical cake (a quantum system) that you want to share with a large group of friends. However, this cake has a very strange rule: the more delicious the whole cake is, the less "flavor" any small slice can have.

In the world of quantum physics, this "flavor" is called entanglement. It's the special "spooky connection" that makes quantum computers so powerful. Usually, if two people share a lot of entanglement, they can't share much with a third person. This is called the Monogamy of Entanglement.

This paper introduces a new, extreme version of this rule called Threshold Entanglement (TE) States.

The Core Idea: The "Majority Rule" Cake

Imagine you have a party with $N$ people.

• The Rule: If you take a group of people that is half the size of the party or smaller, that group must have zero connection to the rest of the party. They are completely "separable" (boring and independent).
• The Catch: The entire group of $N$ people must be incredibly entangled with each other.

It's like a secret society where the whole group knows a massive secret together, but if you try to peek at just a few members (less than half), they look like they know absolutely nothing. The secret is only visible if you have the "majority" of the group.

What Did the Researchers Discover?

The team asked: "Does such a cake actually exist?"

1. It exists for small parties: They proved you can make this "magic cake" with 4 people and 7 people.
   • Analogy: Think of a 4-person puzzle. If you look at any 2 people, their pieces look random and unconnected. But if you look at all 4 together, the picture is perfectly clear and complex.
2. It's impossible for 8 people: They used powerful math (like a super-advanced calculator) to prove that for a party of 8 people, this specific type of cake cannot exist. The math simply doesn't add up; you can't make the whole group so connected that the smaller groups become completely boring.
3. The "Goldilocks" Zone: For parties between 4 and 9 people, they calculated exactly how much "flavor" (entanglement) the cake needs to have to work. They found a narrow window where these states might exist, but for 8 people, the window is closed.

Why Should We Care? (The "Magic" Ingredient)

You might wonder, "Who cares about a theoretical cake?"

The answer is Quantum Computing.

To make a quantum computer that beats a regular supercomputer, you need two things:

1. Entanglement: The connection between particles.
2. "Magic" (Non-stabilizerness): A specific type of quantum weirdness that makes the computer hard to simulate.

The researchers found that these "Threshold Entanglement" cakes are rich in both ingredients.

• They are highly entangled (good for security).
• They are full of "magic" (good for complex calculations).

This suggests that if we can build these states in a lab, they could be the perfect fuel for future quantum computers. They act like a secure vault: the "bad guys" (or small groups of hackers) can't steal the secret because they don't have enough people to unlock it. Only the "majority" can access the power.

The Tools They Used

To solve this, the scientists didn't just guess; they used two main tools:

• The "Shadow" Method: They looked at the "shadows" (mathematical properties) of the quantum states to prove that for 8 people, the shadows don't match up. It's like trying to fit a square peg in a round hole; the math proves it's impossible.
• Optimization: They used computer algorithms to try and "bake" these states. For 4 and 7 people, the computer found a recipe. For 8, the computer kept crashing because no recipe exists.

Summary in a Nutshell

• The Problem: How do we distribute quantum power so that small groups can't access it, but the whole group can?
• The Solution: A new type of quantum state called "Threshold Entanglement."
• The Result: It works for 4 and 7 people, but impossible for 8.
• The Future: These states are packed with the "magic" needed to build the next generation of super-powerful quantum computers that can solve problems we can't touch today.

In short, the paper maps out the "blueprints" for a new kind of quantum security and computing power, telling us exactly how many people (qubits) we need to make it work, and when we need to stop trying because the laws of physics say "no."

Technical Summary

1. Problem Statement

The paper addresses the distribution of entanglement resources in multipartite quantum networks. Specifically, it investigates the existence and properties of quantum states where entanglement is so highly distributed that no subsystem containing half or fewer of the total parties can possess any entanglement, even after arbitrary local unitary transformations.

• Core Concept: The authors introduce Threshold Entanglement (TE) states. These are $n$-qubit pure states $|\psi\rangle$ such that for any subsystem $S$ with size $|S| \leq \lfloor n/2 \rfloor$, the reduced density matrix $\rho_S$ is Absolutely Separable (AS).
• Absolute Separability: A state is AS if it remains separable under any global unitary transformation ($U \rho U^\dagger$). This implies that the subsystems are so mixed that no local rotation can reveal entanglement.
• Motivation: TE states generalize Absolutely Maximally Entangled (AME) states (where marginals are maximally mixed). While AME states are ideal for Quantum Secret Sharing (QSS), they are known to exist only for specific qubit numbers ($n=2,3,5,6$). The authors seek to determine if TE states exist for other system sizes (specifically $n=4, 7, 8, 9$) and characterize their entanglement properties.

2. Methodology

The authors employ a combination of analytical proofs, numerical optimization, and semidefinite programming (SDP) relaxations to tackle the problem from two complementary angles:

A. Existence and Construction

• Stabilizer vs. Non-Stabilizer: The authors prove that for $n \neq 5, 6$, TE states cannot be stabilizer states (which include AME states). This is because the rank of the reduced density matrix of a stabilizer state is a power of two, whereas AS mixed states of size $\lfloor n/2 \rfloor$ have specific rank constraints that conflict with this for non-AME cases.
• Explicit Construction ($n=4$): They identify a specific four-qubit state (a superposition of bipartite maximally entangled states) that satisfies the TE condition.
• Numerical Search ($n=7$): For seven qubits, where AME states do not exist, they utilize a gradient descent algorithm. The algorithm minimizes a cost function $\Theta(|\psi\rangle)$ based on the eigenvalues of the marginals, ensuring they satisfy the necessary and sufficient condition for absolute separability (derived from the PPT criterion and spectral constraints).

B. Bounds on Purity (Entanglement Limits)

To determine the existence of TE states for larger $n$, the authors define the average marginal purity $p(|\psi\rangle)$ of the $\lfloor n/2 \rfloor$-sized subsystems. For a TE state to exist, this purity must lie within a specific range:
$$p_{LB} \leq p \leq p_{UB}$$

1. Lower Bound ($p_{LB}$): The minimum possible average purity for any pure state.

   • Technique: Uses Quantum Coding Theory. They map the problem to the existence of quantum error-correcting codes with parameters $((n, 1, \lfloor n/2 \rfloor + 1))$.
   • Optimization: They apply Linear Programming (LP) and Semidefinite Programming (SDP) relaxations on quantum weight enumerators and shadow enumerators to find the tightest lower bound.

2. Upper Bound ($p_{UB}$): The maximum possible purity for an Absolutely Separable state.

   • Technique: Uses the SWAP trick and polynomial optimization.
   • Optimization: They formulate the problem as maximizing the purity of a state subject to AS constraints (specifically the condition that the state is separable across any $1|(m-1)$ partition). They use the Lasserre hierarchy (SDP relaxations) to solve this non-convex polynomial optimization problem.

3. Key Results

Existence of TE States

• $n=4$: TE states exist. The authors provide an explicit analytical example and numerical instances.
• $n=5, 6$: TE states exist (these are the known AME states, which are a subset of TE states).
• $n=7$: TE states exist. The authors found numerical instances of non-stabilizer TE states.
• $n=8$: TE states do not exist. The numerical bounds show a contradiction: the lower bound for the purity of any 8-qubit pure state ($\hat{p}_{LB}$) is strictly greater than the upper bound for the purity of an 8-qubit AS state ($\hat{p}_{UB}$).
• $n=9$: The existence is undetermined. The bounds do not currently overlap or contradict, leaving a narrow window ($\approx 0.0119$ width) where TE states might exist.

Quantitative Bounds (Table I)

The paper provides improved bounds for the average marginal purity:

• For $n=8$, $\hat{p}_{LB} \approx 0.0857$ while $\hat{p}_{UB} \approx 0.0833$. Since $p_{LB} > p_{UB}$, no TE state can exist.
• The work improves upon previous bounds for the maximal purity of AS states and the minimal purity of pure state marginals.

Resource Analysis (Entanglement and Magic)

• Entanglement: TE states possess significant entanglement, acting as "approximate AME states."
• Magic (Non-stabilizerness): Since TE states are non-stabilizer (for $n=4, 7$), they possess "magic," a resource required for universal quantum computing.
  • Numerical samples of 4-qubit and 7-qubit TE states show high stabilizer $\alpha$-Rényi entropy ($S_2$).
  • For $n=7$, the average magic of TE states ($\approx 4.98$) is nearly as high as that of Haar-random states ($\approx 5.03$), indicating they are highly resourceful for quantum advantage tasks.

4. Significance and Applications

• Quantum Secret Sharing (QSS): TE states offer a generalized framework for QSS where a "threshold" of users is required to access the global information. Unlike AME states, TE states allow for unbalanced access structures where small subsets have zero access (due to absolute separability), while larger sets have access.
• Quantum Networks: The concept enables the design of networks where entanglement resources are distributed such that small eavesdropping groups cannot extract any information or entanglement, enhancing security.
• Computational Complexity: The paper demonstrates that TE states are not just theoretical curiosities but contain high amounts of "magic," suggesting they could be candidates for protocols offering quantum advantage over classical computers.
• Methodological Advancement: The work provides tighter bounds on the purity of absolutely separable states and the minimal purity of pure state marginals, advancing the fields of quantum coding theory and polynomial optimization in quantum information.

Conclusion

The paper successfully defines and characterizes Threshold Entanglement (TE) states. It proves their existence for $n=4$ and $n=7$, establishes their non-existence for $n=8$ via rigorous SDP bounds, and highlights their potential as highly resourceful states for secure quantum networking and quantum computing. The work bridges the gap between the idealized AME states and practical multipartite entanglement distribution.