⚛️ quantum physics

Robust Quantum Extremal Numbers

This paper introduces a robust extension of quantum extremal numbers by defining a marginal maximal-mixing defect and establishing local stability inequalities that prove the stability of exact quantum extremal counts, such as $Q_{\mathrm{ex},\varepsilon}^{D}(8,4)=56$ , under small perturbations of marginal mixedness.

Original authors: Wanchen Zhang, Zicheng Han, Xiande Zhang

Published 2026-08-17

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Wanchen Zhang, Zicheng Han, Xiande Zhang

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 you are trying to build the ultimate LEGO tower, but with a twist: every single small section of the tower must look perfectly random and messy, even though the whole tower is built from a single, perfectly ordered blueprint. In the world of quantum physics, this is the dream of creating "Absolutely Maximally Entangled" (AME) states. These are special arrangements of tiny particles called qubits where, if you look at any half of the system, it appears completely chaotic and uncorrelated, like static on an old TV screen. This "perfect mess" is actually a superpower; it's the secret sauce for ultra-secure communication, unbreakable codes, and simulating complex chemical reactions that classical computers can't handle.

However, nature is a bit of a perfectionist and a bit of a cheater. For certain numbers of particles, building this perfect tower is mathematically impossible. You simply cannot make every single half of the system look perfectly random at the same time. So, scientists had to ask a new question: If we can't have perfection, how close can we get? And more importantly, if we accept a tiny bit of "imperfection" (a little bit of order in the mess), how many parts of the system can we still keep looking random? This is the frontier where the new paper by Wanchen Zhang, Zicheng Han, and Xiande Zhang steps in. They aren't just asking if a perfect tower exists; they are asking how many "almost perfect" sections we can guarantee to find, even when the building blocks are slightly wobbly.

The authors introduce a new way to measure this "wobble," which they call the "marginal maximal-mixing defect." Think of it like a "messiness score." If a section of your quantum tower is perfectly random, the score is zero. If it's slightly too ordered, the score goes up. The paper's main goal is to find the maximum number of sections that can stay below a certain "messiness threshold" (let's call it $\varepsilon$ ) for a given number of qubits. They call this the "robust quantum extremal number."

Here is what they discovered, and it's surprisingly solid. For a system of eight qubits (which is a very important size in quantum computing), they proved that even if you allow a tiny bit of imperfection—specifically, a messiness score less than $1/5$ —you can still guarantee that exactly 56 different four-qubit sections will look maximally mixed. This is a big deal because, in the world of perfect math, we already knew that for eight qubits, the maximum number of perfectly mixed sections was 56. The authors showed that this number doesn't drop just because we allow a little bit of error; it stays stubbornly at 56 for a whole range of small errors. It's like finding a "stability plateau": you can wiggle the system a bit, and the answer doesn't change.

They also tackled systems with an odd number of qubits, like nine. Here, the rules are trickier. They found that for nine qubits, if the messiness score is kept below $1/17$ , the number of "good" four-qubit sections cannot exceed 120. They didn't prove that 120 is the exact number you can always achieve, but they proved you can never go higher than that if you want to stay within that error limit. This turns a rigid mathematical rule into a flexible, robust guideline that accounts for the real-world noise found in actual quantum machines.

The paper also draws a line in the sand for what is impossible. They showed that you cannot have a system where every possible section is "good" if the error is too low; the math forces at least one section to be "bad" (too ordered). For example, in an eight-qubit system, if you try to claim that all sections are good with an error threshold lower than $1/5$ , the laws of quantum mechanics say, "Nope, that's not allowed." They used a clever mathematical tool called a "shadow inequality" (which is like checking the shadows cast by the particles to see if they match the shape of the whole) to prove that these "bad" sections must exist.

One interesting exception they found is the case of seven qubits. While they know mathematically that a perfect arrangement is impossible, their current tools couldn't give a specific number for how much error is needed to make the "good" sections appear. It's like knowing a door is locked but not having the key to open it yet. Similarly, for eleven qubits, the usual mathematical tricks they used didn't work, suggesting that this specific size might need a completely different approach to understand.

In short, this paper takes the rigid, all-or-nothing rules of quantum entanglement and makes them more practical. It tells us that even if our quantum computers aren't perfect, we can still rely on a specific, large number of parts behaving exactly as we need them to, as long as the errors stay within a certain small range. It transforms a theoretical limit into a robust, usable guarantee, giving engineers and scientists a clearer map of where the "safe zones" are in the chaotic landscape of quantum states.

Technical Summary: Robust Quantum Extremal Numbers

Problem Statement
The paper addresses the limitations of Absolutely Maximally Entangled (AME) states, which require every reduction of at most half the parties to be maximally mixed. For qubit systems, AME states are known not to exist for $n=4, 7$ , and $n \ge 8$ . Previous work introduced the quantum extremal number $Q_{ex}(n, k)$ , which counts the maximum number of exactly maximally mixed $k$ -body marginals in an $n$ -qubit pure state, linking this to hypergraph Turán theory. However, this exact framework is rigid and does not account for physical imperfections such as noise or compilation errors.

This work develops a robust extension of the quantum extremal number problem. Instead of requiring exact maximal mixedness, the objective is to maximize the number of $k$ -body marginals that satisfy a specific error threshold, while placing no constraints on the remaining marginals. This differs from "approximate $k$ -uniformity," which requires all $k$ -body marginals to obey a common error bound.

Methodology and Definitions
The authors introduce the marginal maximal-mixing defect $D_A$ for a subsystem $A$ of dimension $d_A = 2^{|A|}$ :
$D_A := d_A \text{Tr}(\rho_A^2) - 1 = d_A \left\| \rho_A - \frac{I_A}{d_A} \right\|_2^2$
This quantity measures the deviation of a marginal $\rho_A$ from the maximally mixed state. It is dimensionless and equivalent to the total squared non-identity Pauli weight supported within $A$ . The robust quantum extremal number, $Q^D_{ex, \varepsilon}(n, k)$ , is defined as the maximum number of $k$ -subsets $A$ such that $D_A \le \varepsilon$ for a given pure $n$ -qubit state.

The methodology combines:

Pauli Representation: Expressing defects in terms of Pauli coefficients ( $r_\alpha$ ) and weight enumerators ( $a_j$ ).
Shadow Inequalities: Utilizing the zeroth Rains shadow inequality (via the state-inversion map) to derive constraints on Pauli weight distributions.
Schmidt Rank Bounds: Applying rank constraints on reduced density matrices derived from the global purity of the state.
Combinatorial Exclusion: Translating local quantum constraints into forbidden hypergraph structures (Turán theory) to bound the number of "good" subsets.

Key Contributions and Results

1. Even-Qubit Systems ( $n = 4m$ )
For pure states on $4m$ qubits, the authors establish a local stability inequality. For any subset $T$ of size $2m+1$ :
$\sum_{i \in T} D_{T \setminus \{i\}} \ge 1$
This implies that the hypergraph of $\varepsilon$ -good $2m$ -subsets is $K^{(2m)}_{2m+1}$ -free (contains no complete hypergraph of size $2m+1$ ) whenever $\varepsilon < 1/(2m+1)$ .

Eight-Qubit Case ( $n=8, k=4$ ): Combining the inequality with the known exact construction from previous work, the authors prove a stability plateau:
$Q^D_{ex, \varepsilon}(8, 4) = 56 \quad \text{for} \quad 0 \le \varepsilon < \frac{1}{5}$
This demonstrates that the extremal count remains constant and equal to the exact value over a finite error interval.

2. Odd-Qubit Systems ( $n = 2k+1$ )
For odd systems, the forbidden structure is not a complete hypergraph but a specific hypergraph $H_k$ associated with a $(k+2)$ -subset $A$ . The edges of $H_k(A)$ are $k$ -subsets $B$ where $|B \cap A| = k$ or $|B \cap A| = 1$ .

Exact Forbidden Pattern: For $k \ge 3$ and $k \neq 5$ , the exact zero-error hypergraph $G_0(\psi)$ is $H_k$ -free.
Finite-Error Stability Radii: The authors derive explicit lower bounds on the stability radius $\varepsilon$ $ε$ for which $G_\varepsilon(\psi)$ $G_{ε} (ψ)$ remains $H_k$ $H_{k}$ -free:
- If $k \ge 4$ is even: $\varepsilon < \frac{k-2}{(k+2)(k+1) + 4}$
- If $k \ge 7$ is odd: $\varepsilon < \frac{k-5}{(k+2)(k+1) + 8}$
Nine-Qubit Case ( $n=9, k=4$ ): Applying the even- $k$ bound yields $\varepsilon < 1/17$ . Combined with a covering bound for the Turán number, this gives:
$Q^D_{ex, \varepsilon}(9, 4) \le 120 \quad \text{for} \quad 0 \le \varepsilon < \frac{1}{17}$

3. Limitations and Exceptions
The paper explicitly notes limitations:

Seven Qubits ( $k=3$ ): While compactness arguments guarantee a positive stability radius, the scalar estimates used in the paper do not yield an explicit positive lower bound.
Eleven Qubits ( $k=5$ ): The operator identity used to prove the forbidden pattern degenerates ( $V|\psi\rangle = 0$ ), meaning the current method does not establish that $H_5$ is forbidden. A different forbidden pattern or stronger constraints are required.
Optimality: The authors do not claim the derived radii are sharp; they are explicit lower bounds on the true stability radii.

Significance
The paper establishes that quantum extremal numbers possess nontrivial finite-error stability intervals. It demonstrates that local quantum consistency conditions (specifically, marginal maximal-mixing defects) retain combinatorial rigidity under finite perturbations. By converting exact quantum Turán obstructions into quantitative robustness statements, the work bridges the gap between exact combinatorial constraints and physically realistic scenarios involving imperfect marginal mixedness. This provides a rigorous framework for identifying regimes where imperfectly uniform marginals still retain the structural advantages associated with highly entangled states, relevant for quantum error correction and quantum simulation.

Technical Summary: Robust Quantum Extremal Numbers

More like this