⚛️ high-energy theory

Combinatorial aspects of holographic quantum secret sharing

This paper introduces combinatorial holographic quantum secret sharing (CHQSS) to characterize how bulk logical information is encoded and protected in the AdS $_3$ /CFT $_2$ boundary, deriving key metrics like distance and thresholds, analyzing multipartite entanglement wedge phase transitions, and constructing families of perfect threshold and non-threshold schemes.

Original authors: Ning Bao, Keiichiro Furuya, Jacob March

Published 2026-07-20

📖 7 min read🧠 Deep dive

CC BY 4.0

Original authors: Ning Bao, Keiichiro Furuya, Jacob March

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

Imagine the universe as a giant, three-dimensional hologram projected from a two-dimensional surface, like a 3D movie playing on a flat screen. This is the heart of the "holographic principle," a mind-bending idea in physics suggesting that all the information inside a volume of space (the "bulk") is actually encoded on its boundary. Think of it like a secret message written on the surface of a balloon; even though the message is on the skin, it somehow describes everything happening inside the air-filled sphere.

To protect this cosmic information, physicists use a concept called "quantum secret sharing." Imagine you have a super-secret treasure map, but you don't want just anyone to find it. So, you cut the map into pieces and hand them out to a group of friends. The rule is: you need a specific number of friends to put their pieces together to see the whole map. If you lose a few friends (or their pieces get erased), the map is still safe. But if too many are lost, the secret is gone forever. This paper explores how nature does this with the universe's data, specifically looking at how the "shape" of the hologram changes the rules of who gets to see the secret.

The Cosmic Puzzle: Who Gets the Key?

In this new study, the authors, Ning Bao, Keiichiro Furuya, and Jacob March, dive deep into a specific corner of this holographic universe (specifically a model called AdS3/CFT2) to figure out exactly how the "secret sharing" works. They aren't just asking if the information is safe; they are asking how safe it is, and who needs to cooperate to unlock it.

To do this, they invented a new way of looking at the hologram called Combinatorial Holographic Quantum Secret Sharing (CHQSS). Instead of getting bogged down in complex math equations, they turned the hologram into a simple map made of dots and lines (a graph).

The Dots: Each dot represents a chunk of space inside the hologram (the "bulk").
The Lines: These lines connect the dots to the "players" on the boundary (the "shares" of the secret).
The Rules: A dot is "connected" to a group of players if the players' combined view (called an "entanglement wedge") is big enough to see that dot.

The team wanted to measure three specific things for every dot in their map:

Reconstruction Threshold ( $r_b$ ): How many players do you need to team up to see the dot? (The "minimum team size").
Secret Threshold ( $s_b$ ): What is the largest group of players that still cannot see the dot? (The "maximum unauthorized group size").
Distance ( $d_b$ ): How many players can you erase before the dot is completely unrecoverable? (The "robustness score").

The Shape-Shifting Universe

The most exciting discovery is that the rules of this game change depending on the "phase" of the universe. Just like water can be ice, liquid, or steam, the holographic universe has different phases based on how the boundary regions are arranged.

The authors studied a symmetric setup where they had $n$ boundary regions spaced evenly around a circle. They found that as they changed the size of these regions (measured by an angle $\phi$ ), the universe underwent phase transitions.

The "Disconnected" Phase: In some phases, the secret is so well-hidden that you need everyone (all $n$ players) to see it. If you lose even one player, the secret vanishes.
The "Connected" Phase: In other phases, the geometry shifts, and you only need a smaller team (like half the players) to reconstruct the secret.

They calculated the exact points where these switches happen. For example, with 3 boundary regions, there are two distinct transition points. With 5 regions, there are five different transition points. At each point, the "shape" of the connection between the players and the secret changes, altering who can see what.

Pure vs. Mixed: The "Perfect" and the "Fragile"

The paper draws a sharp line between two types of secret sharing schemes, which they call "pure-state" and "mixed-state."

1. The Pure-State Scheme (The Perfect Team):
This happens when the boundary regions cover the entire circle. Here, the rules are incredibly neat and predictable. The authors proved that for any secret in this setup, the "reconstruction threshold" and "secret threshold" always add up perfectly to the total number of players ( $r_b + s_b = n$ ).

Analogy: Imagine a perfect lock where if you need 3 keys to open it, you can afford to lose exactly 2 keys and still be safe. It's a balanced, "additive" system.
The Result: In these pure states, the most protected secrets are located right in the center of the hologram. The further you get from the center, the easier it is to reconstruct the secret (you need fewer players), but the more fragile it becomes (you can lose fewer players).

2. The Mixed-State Scheme (The Super-Additive Surprise):
This happens when the boundary regions don't cover the whole circle (there's a gap). Here, things get weird. The authors found that in these phases, the rules break the "perfect balance."

The Surprise: Sometimes, you can have a secret that requires a large team to see (high reconstruction threshold), but if you lose just a few players, the secret becomes impossible to recover (low distance).
The "Super-Additive" Effect: In some mixed phases, the secret is encoded in a way that is "super-additive." This means the whole is greater than the sum of its parts. You might need the entire group to see the secret, but if you lose even one person, the connection breaks completely. The authors found that in these phases, the most robust secrets aren't always in the center; sometimes, moving away from the center actually makes the secret more stable in terms of the "additivity" rule, even if it's less robust overall.

The "Distance" and the "Gap"

The authors introduced a concept called distance ( $d_b$ ) to measure how well a secret is protected against erasure. They derived a maximum possible distance for any setup with $n$ players:
$d_{max} = \lceil \frac{n}{2} \rceil$
(Where $\lceil \dots \rceil$ means rounding up to the nearest whole number).

For 3 players, the max distance is 2.
For 5 players, the max distance is 3.

They also discovered a relationship between the distance and the secret threshold. In the "pure" (perfect) cases, the distance is always exactly one step higher than the secret threshold ( $d_b = s_b + 1$ ). But in the "mixed" (imperfect) cases, the distance can be equal to or even smaller than the secret threshold. This "gap" tells physicists exactly how "fragile" the holographic encoding is in different phases.

Why This Matters

This paper doesn't just play with math; it explains why holographic quantum error correction (the method nature uses to keep the universe from glitching) sometimes fails to be "exact." The authors show that in mixed-state scenarios, the "super-additive" nature of the entanglement wedges creates obstructions. It's like trying to build a tower of blocks where the blocks in the middle are glued together in a way that if you pull out one specific block, the whole structure collapses, even if you have plenty of other blocks left.

By mapping out these phases and calculating the exact thresholds, the authors provide a "combinatorial" toolkit. They show us that the universe isn't just a static hologram; it's a dynamic puzzle where the rules of secrecy and protection shift depending on the geometry. Whether you are in a "pure" phase where the rules are fair and balanced, or a "mixed" phase where the rules are tricky and fragile, the math of secret sharing tells the whole story of how the universe protects its deepest secrets.

Technical Summary: Combinatorial Aspects of Holographic Quantum Secret Sharing

Problem Statement
The paper addresses the characterization of holographic encoding quality in the context of $AdS_3/CFT_2$ . While holographic quantum error correction (HQEC) focuses on protecting bulk logical information against boundary erasures, holographic quantum secret sharing (HQSS) specifically investigates how bulk information is encoded into boundary states, quantifying the ease of reconstruction and the degree of secrecy. A key challenge is distinguishing between pure-state schemes (where the entire boundary is accessible) and mixed-state schemes (where only a subset of the boundary is accessible), particularly regarding how holographic phase transitions and entanglement wedge connectivity affect the "redundancy" of the encoding. The authors aim to formalize these concepts using combinatorial structures derived from the geometry of entanglement wedges.

Methodology
The authors introduce a coarse-grained framework based on RT-region graphs (Definition 3.1). In this setup:

Geometric Partitioning: The bulk constant-time slice is partitioned by Ryu-Takayanagi (RT) surfaces corresponding to all subsets of $n$ boundary subregions $[n] = \{A_1, \dots, A_n\}$ .
Graph Construction: Each bulk subregion enclosed by RT surfaces is a vertex. Edges connect vertices if geodesics between them cross an RT surface once.
Access Structures: For a specific bulk subregion $b$ (a vertex), the set of authorized boundary subregions $R_b$ is defined as those whose entanglement wedges contain $b$ . This set satisfies upward monotonicity (entanglement wedge nesting) and the no-cloning theorem (pairwise intersection of minimal authorized sets).
Combinatorial Holographic QSS (CHQSS): The authors define CHQSS schemes based on these access structures, introducing three key parameters:
- Distance ( $d_b$ ): The minimum number of boundary subregions that must be erased such that $b$ can no longer be reconstructed.
- Reconstruction Threshold ( $r_b$ ): The minimum number of boundary subregions required to guarantee reconstruction.
- Secret Threshold ( $s_b$ ): The maximum number of boundary subregions that can be accessed without being able to reconstruct $b$ .

The study focuses on symmetric setups where $n$ boundary subregions are evenly spaced with angular interval $\phi$ . The authors numerically compute phase transitions of multipartite entanglement wedges as $\phi$ varies, identifying distinct transition points where the connectivity of entanglement wedges changes.

Key Contributions and Results

Holographic Phase Transitions:
The paper demonstrates that multipartite entanglement wedges undergo multiple distinct phase transitions in symmetric setups (e.g., for $n=3, 4, 5$ ). Unlike simple connectivity, different combinations of boundary subregions (characterized by spacing patterns like $(1,2,2)$ vs. $(1,1,3)$ ) enter the connected phase at different critical values of $\phi$ . This leads to a rich structure of holographic phases where the reconstructibility of bulk points varies non-monotonically with the number of accessible boundary regions.
Maximum Distance and Redundancy:
The authors derive the maximum possible distance $d_{\max}$ for a bulk subregion in a given holographic phase. For a system with $n$ boundary subregions where all entanglement wedges of size $\lceil \frac{n+1}{2} \rceil$ are connected, the maximum distance is:
$d_{\max} = \left\lfloor \frac{n}{2} \right\rfloor$
This distance represents the robustness of the bulk information against erasures. The distance is maximized at the "center" of the RT-region graph and decreases toward the boundary.
Relations Between Thresholds and Distance:
The paper establishes rigorous relations between the reconstruction threshold $r_b$ , secret threshold $s_b$ , and distance $d_b$ :
- Reconstruction: $r_b = n - d_b + 1$ . This links the ease of reconstruction directly to the code distance.
- Secret Threshold: The relationship between $s_b$ $s_{b}$ and $d_b$ $d_{b}$ depends on the additivity of the entanglement wedges.
  - Additive Case: If $b \subseteq EW(R)$ implies $b \not\subseteq EW(R^c)$ (where $R^c$ is the complement), then $s_b = d_b - 1$ . This holds for all pure-state CHQSS schemes.
  - Superadditive Case: If entanglement wedges are superadditive ( $EW(R_1) \cup EW(R_2) \subsetneq EW(R_1 \cup R_2)$ ), it is possible that $b \not\subseteq EW(R)$ and $b \not\subseteq EW(R^c)$ simultaneously. In this case, $s_b \ge d_b$ . This occurs in mixed-state schemes where the geometric complement $O$ is non-trivial.
Classification of CHQSS Schemes:
The authors construct families of CHQSS schemes and classify them:
- Perfect Threshold vs. Non-Threshold: Some bulk regions (e.g., at the center of the graph in certain phases) exhibit perfect threshold behavior where any set of size $r_b$ can reconstruct the secret. Others exhibit non-threshold behavior where the specific composition of the set matters, not just its cardinality.
- Pure vs. Mixed: Pure-state schemes are always additive ( $r_b + s_b = n$ ). Mixed-state schemes can be additive or superadditive ( $r_b + s_b \ge n+1$ ).
- Trade-offs: The paper observes a trade-off in mixed-state schemes: regions with higher secrecy (larger $s_b$ relative to $d_b$ ) often correspond to superadditive schemes where the bulk information is more fragile to erasures (smaller $d_b$ ).

Significance and Claims
The paper claims to provide a systematic combinatorial framework for analyzing holographic encoding through the lens of quantum secret sharing. By defining distance and thresholds in terms of entanglement wedge connectivity, the authors:

Clarify the distinction between pure-state and mixed-state holographic encoding, showing how mixed states can lead to superadditive schemes that violate the additivity required for exact holographic quantum error correction.
Demonstrate that the "quality" of holographic encoding (robustness vs. secrecy) is intrinsically linked to the holographic phase and the specific location of the bulk subregion within the RT-region graph.
Identify that the obstruction to exact HQEC in mixed states is related to the existence of superadditive CHQSS schemes, where bulk information is encoded in genuine multipartite entanglement that cannot be accessed by simple unions of smaller wedges.

The authors conclude that their combinatorial approach offers a coarse-grained but precise tool to characterize the redundancy and security of holographic codes, bridging the gap between geometric phase transitions and quantum information theoretic properties. They suggest future directions involving the volume of codimension-one surfaces, multipartite entanglement patterns, and the constraints imposed by holographic entropy inequalities on these secret sharing schemes.