Robust Quantum Extremal Numbers
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.
Kai: I'm Kai.
Mira: And I'm Mira, here with Lev.
Kai: We're looking at the paper: "Robust Quantum Extremal Numbers".
Mira: Here's the gist of the paper. Robust Quantum Extremal Numbers develops a robust extension of an extremal problem related to exactly maximally mixed half-body marginals by defining a marginal maximal-mixing defect and deriving stability plateaus under imperfect marginal mixedness The present work combines these ideas while addressing an optimization problem distinct from approximate kuniformity.
Kai: Defining the Marginal Defect The marginal maximal-mixing defect is defined for a subsystem A of dimension dA = 2A as DA = 2A Tr(ρ 2 A) − 1 This definition is motivated by the Hilbert–Schmidt formulation of approximate k-uniform states introduced by Guo et al., who quantify approximate local maximal mixing through the Hilbert–Schmidt proximity of every relevant marginal to IA/dA and emphasize the relevance of such a relaxation for finite-depth implementations, compilation errors, and physical noise.
Mira: The defect also controls the trace-norm deviation from maximal mixing, where DA ≤ ε implies∥ρA −IA/dA∥1 ≤√ε.
Kai: Local Stability and Forbidden Hypergraphs For pure states on 4m qubits, a local stability inequality is established stating that X i∈T DT i ≥ 1 for T = 2m + 1.
Title and authors: Kai: Let's talk about the paper, "Robust Quantum Extremal Numbers," and who wrote it. The title suggests a focus on robustness in extremal problems involving quantum states, which is something I always find interesting when we're trying to build stable hardware.
Mira: Right. And the authors are Wanchen Zhang, Zicheng Han, and Xiande Zhang at the University of Science and Technology of China. They are clearly deep in the math side of this problem, focusing on these exact extremal problems related to maximally entangled states.
Lev: From an experimental perspective, I’m more interested in what they actually built. Are we talking about theoretical constructs here that are hard to verify, or is there some link back to physical implementations?
Kai: The paper doesn't focus on the hardware itself, but it uses concepts that are relevant because they stem from quantifying approximate local maximal mixing through the Hilbert-Schmidt proximity of every relevant marginal to a specific ideal state.
Mira: That’s what motivates this entire approach. They realized that for real applications, we don't always have perfectly uniform states; we have states that are close to being uniform, and they needed a way to measure that closeness reliably.
Lev: So the core idea is shifting the focus from "perfect" mixing to "close enough" mixing, quantified by this marginal maximal-mixing defect DA.
Kai: Precisely. And they define it as DA equals two times the size of the subsystem times the trace of the square of its reduced density matrix, minus one. That’s how much it deviates from being maximally mixed.
Mira: They connect this to a specific mathematical functional, which they say coincides with the quantum chi-squared divergence from the maximally mixed state, which is just a way to measure that deviation mathematically.
Lev: So we have this quantity DA that tells us how far off a marginal is from being maximally mixed, and they use it as the primary parameter for their stability analysis.
Kai: And by using this defect instead of just purity, they are optimizing an objective function that counts the number of marginals satisfying that threshold, which is distinct from approximate k-uniformity.
Mira: That distinction is key because approximate k-uniformity requires *all* k-body marginals to obey a common error bound simultaneously, while this method lets them be individually constrained by epsilon.
Lev: That’s a huge difference for an engineer. It means we don't have to enforce a single, tight constraint across the whole state; we can manage local consistency on these specific subsets.
Kai: And that leads directly into the stability results they find, showing that local quantum consistency conditions can translate into forbidden hypergraph statements at nonzero error levels.
Mira: So they are using this defect to define a geometric structure in the space of possible states, and then showing that certain states are forbidden within that structure if their defect is too low.
Lev: It seems like they’re finding a combinatorial rigidity even when you allow for some finite error, which is something I can try to map onto error-correcting codes later.
The paper's summary: Kai: To summarize the main thrust of "Robust Quantum Extremal Numbers," the authors are developing this robust extension of an extremal problem that measures how many marginals in a pure state satisfy a specific marginal maximal-mixing defect threshold epsilon.
Mira: They aren't just counting exactly maximally mixed states anymore, which is what previous work did for things like the eight-qubit case, but they are optimizing for the number of states that have this property below some error level.
Lev: So instead of finding one perfect state, they’re trying to find a whole family of states that are all "good enough" according to this new defect metric.
Kai: They introduce the marginal maximal-mixing defect DA as the central concept here, where if DA is less than epsilon, the marginal is considered good. This replaces purity as the main constraint for this counting problem.
Mira: And they use this to derive local stability inequalities for pure states on four times m qubits, showing that a subset of size two m plus one must have a defect of at least one if you're dealing with pure states.
Lev: That local stability is the engine driving the next part, because it allows them to translate these local conditions into forbidden hypergraph statements, which is where the combinatorial rigidity comes from.
Kai: And for eight qubits, this translates into a specific result: when epsilon is less than one over five, they get a stability plateau of fifty-six based on the known exact eight-qubit construction <ref:2608.13907#pg1>.
Mira: That fifty-six is the maximal number of these good marginals they can find under those specific error conditions, and it’s tied to that exact eight-qubit state <ref:2608.13907#pg1>.
Lev: So it’s like a stability plateau where the count doesn't change as long as your error epsilon stays below one over five. That gives us a predictable range for simulation advantages.
Kai: It suggests that quantum extremal number phenomena can possess these nontrivial finite-error stability intervals while still being compatible with state-level approximation criteria.
Mira: Basically, it means even when we allow for some noise, the underlying combinatorial constraints of highly entangled states are still quite rigid in a quantifiable way.
Lev: It’s a rigorous starting point showing that quantum extremal number phenomena can have these finite-error stability intervals while respecting physically motivated state-level approximation criteria.
The paper's improvements: Kai: Now let's talk about the improvements they propose, because this is where the practical potential lies. They suggest a few things that make this framework more powerful than just counting states.
Mira: First, they suggest being able to calculate if a given set of reduced density matrices satisfies that marginal maximal-mixing defect threshold DA less than epsilon, which tells you whether a state is in the family G epsilon psi.
Lev: That would be useful for checking simulated states. If we’re running an experiment and get some measurements, we could use this to determine if those reduced density matrices fall within that good set or not.
Kai: Exactly, and then they suggest a second improvement: quantum Turan graph detection. They can check if the hypergraph of good subsets is free of a complete K(2m) two m plus one hypergraph for specific error thresholds, like the one we saw for eight qubits being fifty-six when epsilon is less than one over five.
Mira: That means we can check for the absence of certain structures in our data that would indicate a violation of the stability plateau Q Dex,epsilon(eight four) equals fifty-six <ref:2608.13907#pg1>.
Lev: So it’s moving from theory to diagnostic tools. We’re using the defect concept to diagnose structural integrity within a quantum system rather than just predicting properties beforehand.
Kai: And they also propose estimating finite-error stability radii for odd systems by computing a sharp local Hk stability radius, which they claim is guaranteed to be positive for all odd systems except for k equals five.
Mira: That’s a very concrete number because it gives us a lower bound on the true stability radii, so we know how much more robust the system is than what we can prove right now.
Lev: If that bound is positive, it means even in those odd cases where they couldn't find an explicit radius, there’s still some guaranteed stability margin based on this method.
Kai: And finally, they mention using the Pauli coefficient formula to directly compute the marginal maximal-mixing defect for any subsystem A just from a given pure state’s Pauli expansion.
Mira: That would be incredibly powerful for experimentalists because it means we don't need to calculate that trace term Tr(rho two A) from scratch; you can compute the defect directly from the measurements we take on the Pauli coefficients <ref:2608.13907#pg1>.
Lev: I think that direct computation is a big win for overhead. If we can calculate this locally and efficiently, it scales better than trying to characterize the whole state first.
Conclusion: Kai: So to wrap up on "Robust Quantum Extremal Numbers," the main implication is that local quantum consistency constraints retain combinatorial rigidity even under finite perturbations.
Mira: The key finding is that this allows us to define a robust quantum extremal number by counting marginals within a defect threshold, which gives us stability plateaus under imperfect marginal mixedness.
Lev: For eight qubits, we have the exact constant value fifty-six for the interval zero over five up to epsilon less than one over five <ref:2608.13907#pg1>. That’s a very specific benchmark derived from this paper that we can use for comparison against hardware performance metrics.
Kai: It’s a rigorous starting point showing that quantum extremal number phenomena can possess nontrivial finite-error stability intervals while remaining compatible with state-level approximation criteria.
Mira: This suggests the underlying combinatorial constraints of highly entangled states are still quite rigid in a quantifiable way, even when we allow for some noise.
Lev: For me, the final word is that this paper provides concrete tools—the defect formulation and the forbidden hypergraph statements—that offer a rigorous starting point for analyzing stability in these quantum systems.
Kai: Yeah, so it gives us a new lens to look at how we can quantify stability based on marginal deviation rather than just pure state purity.
Mira: It’s about moving toward more physically relevant criteria for state-level approximation, which is what the entire framework aims to do.
Wanchen Zhang, ©Zicheng Han, ©Xiande Zhang
Hefei National Laboratory, University of Science and Technology of China
quant-ph
Submitted: 2026-08-14
Updated: 2026-11-15
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 88/100
The gist: Robust Quantum Extremal Numbers develops a robust extension of an extremal problem related to exactly maximally mixed half-body marginals by defining a marginal maximal-mixing defect and deriving…
Key concepts
- Marginal Maximal-Mixing Defect (DA)
- This defect measures the deviation of a subsystem's reduced density matrix from perfect maximal mixing. It is calculated as 2|A|Tr(ρ^2_A) - 1. A small defect value means the state is close to being maximally mixed locally, which is relevant for practical noise in quantum systems.
- Local Stability Inequality
- This inequality proves that for certain system sizes (like $4m$ qubits), the aggregate defect across any specific set of $2m+1$ qubits must be at least 1. This mathematical constraint forces a certain combinatorial structure, ensuring local consistency is maintained even when the state is slightly imperfect.
- Forbidden Hypergraphs
- The stability results translate into constraints on hypergraphs. If the defect $\epsilon$ is small enough, the set of 'good' subsets must avoid containing specific forbidden structures like $K(2m)$ hypergraphs. This connects quantum state properties to graph theory, providing a way to prove combinatorial rigidity under noise.
- Extremal Counts ($Q_{Dex}$)
- These are specific numerical bounds derived from the stability analysis. For example, for an eight-qubit system, the exact count is 56 across a range of small errors ($\epsilon < 1/5$). These counts represent the maximum number of states possible under these strict local consistency rules within a given error tolerance.
Terminology
Summary
Robust Quantum Extremal Numbers develops a robust extension of an extremal problem related to exactly maximally mixed half-body marginals by defining a marginal maximal-mixing defect and deriving stability plateaus under imperfect marginal mixedness The present work combines these ideas while addressing an optimization problem distinct from approximate kuniformity. p. 0 Previous work
introduced the quantum extremal number, which maximizes the number of exactly maximally mixed
half-body marginals, and determined the exact value Qex(8, 4) = 56. The present work develops a
robust extension of this extremal problem.Where the paper says it
Defining the Marginal Defect
The marginal maximal-mixing defect is defined for a subsystem A of dimension dA = 2A as DA = 2A Tr(ρ 2 A) − 1 This definition is motivated by the Hilbert–Schmidt formulation of approximate k-uniform states introduced by Guo et al. p. 1 Main results
For a subsystem A of dimension dA = 2|A|
, define the marginal maximal-mixing defect
DA := dA Tr(ρ
2
A) − 1 = dA
ρA −
IA
dA
2
2
. (1)
This definition is motivated by the Hilbert–Schmidt formulation of approximate k-uniform states introduced by Guo et
al. Main results
For a subsystem A of dimension dA = 2|A|
, define the marginal maximal-mixing defect
DA := dA Tr(ρ
2
A) − 1 = dA
ρA −
IA
dA
2
2
. (1)
This definition is motivated by the Hilbert–Schmidt formulation of approximate k-uniform states introduced by Guo et
al. Main results
For a subsystem A of dimension dA = 2|A|
, define the marginal maximal-mixing defect
DA := dA Tr(ρ
2
A) − 1 = dA
ρA −
IA
dA
2
2
. (1)
This definition is motivated by the Hilbert–Schmidt formulation of approximate k-uniform states introduced by Guo et
al. (1)
This definition is motivated by the Hilbert–Schmidt formulation of approximate k-uniform states introduced by Guo et
al. , who quantify approximate local maximal mixing through the Hilbert–Schmidt proximity of every relevant marginal
to IA/dA and emphasize the relevance of such a relaxation for finite-depth implementations, compilation errors, and
physical noise [16]. (1)
This definition is motivated by the Hilbert–Schmidt formulation of approximate k-uniform states introduced by Guo et
al. , who quantify approximate local maximal mixing through the Hilbert–Schmidt proximity of every relevant marginal
to IA/dA and emphasize the relevance of such a relaxation for finite-depth implementations, compilation errors, and
physical noise [16]. (1)
This definition is motivated by the Hilbert–Schmidt formulation of approximate k-uniform states introduced by Guo et
al. , who quantify approximate local maximal mixing through the Hilbert–Schmidt proximity of every relevant marginal
to IA/dA and emphasize the relevance of such a relaxation for finite-depth implementations, compilation errors, and
physical noise [16]. (1)
This definition is motivated by the Hilbert–Schmidt formulation of approximate k-uniform states introduced by Guo et
al. , who quantify approximate local maximal mixing through the Hilbert–Schmidt proximity of every relevant marginal
to IA/dA and emphasize the relevance of such a relaxation for finite-depth implementations, compilation errors, and
physical noise [16]. The same defect also controls the trace-norm deviation from maximal mixing:
ρA −
IA
dA
1
≤
p
dA
ρA −
IA
dA
2
=
p
DA. (2)
Consequently, DA ≤ ε implies ∥ρA −IA/dA∥1 ≤
√
ε. The same defect also controls the trace-norm deviation from maximal mixing:
ρA −
IA
dA
1
≤
p
dA
ρA −
IA
dA
2
=
p
DA. (2)
Consequently, DA ≤ ε implies ∥ρA −IA/dA∥1 ≤
√
ε. The same defect also controls the trace-norm deviation from maximal mixing:
ρA −
IA
dA
1
≤
p
dA
ρA −
IA
dA
2
=
p
DA. (2)
Consequently, DA ≤ ε implies ∥ρA −IA/dA∥1 ≤
√
ε. The same defect also controls the trace-norm deviation from maximal mixing:
ρA −
IA
dA
1
≤
p
dA
ρA −
IA
dA
2
=
p
DA. (2)
Consequently, DA ≤ ε implies ∥ρA −IA/dA∥1 ≤
√
ε.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Local Stability and Forbidden Hypergraphs
For pure states on 4m qubits, a local stability inequality is established stating that X i∈T DT i ≥ 1 for T = 2m + 1. It follows that whenever ε < 1/(2m + 1), the hypergraph of ε-good 2m-subsets is K(2m)2m+1-free. p. 0 For pure states on 4m qubits, the following local stability inequality is established:
X
i∈T
DT \{i} ≥ 1 (|T| = 2m + 1). It follows that, whenever ε < 1/(2m + 1), the hypergraph of ε-good 2m-subsets is K
(2m)
2m+1-free. It follows that, whenever ε < 1/(2m + 1), the hypergraph of ε-good 2m-subsets is K
(2m)
2m+1-free. Combined with the known exact eight-qubit construction, this yields the stability plateau
Q
D
ex,ε(8, 4) = 56, 0 ≤ ε <
1
5
.Where the paper says it
Where the paper says it
Odd-System Robustness Bounds
For odd systems of 2k + 1 qubits, the forbidden hypergraph Hk is used to derive explicit finite-error stability radii. For nine qubits, this yields Q Dex,ε(9, 4) ≤ 120 for 0 ≤ ε < 1/17. p. 2 If k ≥ 4 is even, Hk remains forbidden for
ε <
k − 2
(k + 2)(k + 1) + 4 ,
while for odd k ≥ 7 it remains forbidden for
ε <
k − 5
(k + 2)(k + 1) + 8 . For nine qubits this yields QD
ex,ε(9, 4) ≤ 120 for ε < 1/17. The full-weight term as(T) does not appear because a full-weight Pauli string is destroyed by deleting any qubit. The general n ≡ 0 (mod 4) result
Theorem 2 (Shadow-rank local bound).Where the paper says it
Where the paper says it
Extremal Counts for Specific Systems
The exact eight-qubit construction yields Q Dex,ε(8, 4) = 56 throughout the certified interval 0 ≤ ε < 1/5. For odd systems n = 2k + 1, the results show that for k ≥ 4 even, G ε(ψ) is Hk-free if ε < k − 2(k + 2)(k + 1) + 4. p. 2 3
(iii) For odd systems n = 2k + 1, the forbidden hypergraph Hk from the exact theory yields explicit finite-error
extensions. If k ≥ 4 is even, Hk remains forbidden for
ε <
k − 2
(k + 2)(k + 1) + 4 ,
while for odd k ≥ 7 it remains forbidden for
ε <
k − 5
(k + 2)(k + 1) + 8 .Where the paper says it
Summary of Findings
The principal conclusion is that local quantum consistency constraints can retain combinatorial rigidity under finite perturbations. For 4m qubits, a shadow inequality and a Schmidt-rank bound force a unit amount of aggregate defect on every (2m + 1)-set. p. 9 It follows from combining
two independent facts:
qubit shadow inequality =⇒ OT + as(T) ≤ 1 + ET ,
and
Schmidt-rank constraint =⇒ DT = ET + OT + as(T) ≥ 3. Together, these force at least one unit of Pauli mass to lie in the non-full even-weight sector. It follows from combining
two independent facts:
qubit shadow inequality =⇒ OT + as(T) ≤ 1 + ET ,
and
Schmidt-rank constraint =⇒ DT = ET + OT + as(T) ≥ 3. Together, these force at least one unit of Pauli mass to lie in the non-full even-weight sector. [17] and the identity
ex4(8, K(4)
5
) = 56 give
Q
D
ex,ε(8, 4) = 56 for 0 ≤ ε <
1
5
. Hence the extremal count remains constant throughout the certified interval 0 ≤ ε < 1/5, yielding a finite-error
stability plateau. [17] and the identity
ex4(8, K(4)
5
) = 56 give
Q
D
ex,ε(8, 4) = 56 for 0 ≤ ε <
1
5
. Hence the extremal count remains constant throughout the certified interval 0 ≤ ε < 1/5, yielding a finite-error
stability plateau. Zhao, Zhou, and Childs derive state-dependent product-formula bounds in which the distance
of local reduced density matrices from the maximally mixed state enters explicitly, and they show that sufficiently
approximate k-uniformity can, under appropriate conditions, recover average-case Trotter-error scaling [18]. Thus the
threshold DA ≤ ε provides a dimension-adjusted local criterion that is compatible both with the approximate-k-uniform
framework and with physically motivated state-dependent quantum-simulation bounds. Zhao, Zhou, and Childs derive state-dependent product-formula bounds in which the distance
of local reduced density matrices from the maximally mixed state enters explicitly, and they show that sufficiently
approximate k-uniformity can, under appropriate conditions, recover average-case Trotter-error scaling [18]. Thus the
threshold DA ≤ ε provides a dimension-adjusted local criterion that is compatible both with the approximate-k-uniform
framework and with physically motivated state-dependent quantum-simulation bounds. Zhao, Zhou, and Childs derive state-dependent product-formula bounds in which the distance
of local reduced density matrices from the maximally mixed state enters explicitly, and they show that sufficiently
approximate k-uniformity can, under appropriate conditions, recover average-case Trotter-error scaling [18]. Thus the
threshold DA ≤ ε provides a dimension-adjusted local criterion that is compatible both with the approximate-k-uniform
framework and with physically motivated state-dependent quantum-simulation bounds. Zhao, Zhou, and Childs derive state-dependent product-formula bounds in which the distance
of local reduced density matrices from the maximally mixed state enters explicitly, and they show that sufficiently
approximate k-uniformity can, under appropriate conditions, recover average-case Trotter-error scaling [18]. Thus the
threshold DA ≤ ε provides a dimension-adjusted local criterion that is compatible both with the approximate-k-uniform
framework and with physically motivated state-dependent quantum-simulation bounds.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Pruning redundant reasoning tokens
The paper introduces a robust quantum extremal number that counts the marginals of a pure state lying within a prescribed marginal maximal-mixing-defect threshold. The principal conclusion is that local quantum consistency constraints can retain combinatorial rigidity under finite perturbations. For 4m qubits, a shadow inequality and a Schmidt-rank bound force a unit amount of aggregate defect on every (2m + 1)-set. At the level of the extremal count, the eight-qubit case yields the exact constant value 56 throughout the certified interval 0 ≤ ε < 1/5.
How the training signal is built
The marginal maximal-mixing defect is defined for a subsystem A of dimension dA = 2A as DA = 2A Tr(ρ 2 A) − 1. This definition is motivated by the Hilbert–Schmidt formulation of approximate k-uniform states introduced by Guo et al., who quantify approximate local maximal mixing through the Hilbert–Schmidt proximity of every relevant marginal to IA/dA and emphasize the relevance of such a relaxation for finite-depth implementations, compilation errors, and physical noise. The defect also controls the trace-norm deviation from maximal mixing, where DA ≤ ε implies∥ρA −IA/dA∥1 ≤√ε.
Where the gains come from
The local stability inequality establishes that for a pure state on 4m qubits and every (2m + 1)-subset T, X i∈T DT i ≥ 1. This implies that whenever ε < 1/(2m + 1), the hypergraph of ε-good 2m-subsets is K(2m)2m+1-free. p. 0 For pure states on 4m qubits, the following local stability inequality is established:
X
i∈T
DT \{i} ≥ 1 (|T| = 2m + 1). It follows that, whenever ε < 1/(2m + 1), the hypergraph of ε-good 2m-subsets is K
(2m)
2m+1-free. For pure states on 4m qubits, the following local stability inequality is established:
X
i∈T
DT \{i} ≥ 1 (|T| = 2m + 1). It follows that, whenever ε < 1/(2m + 1), the hypergraph of ε-good 2m-subsets is K
(2m)
2m+1-free. For pure states on 4m qubits, the following local stability inequality is established:
X
i∈T
DT \{i} ≥ 1 (|T| = 2m + 1). It follows that, whenever ε < 1/(2m + 1), the hypergraph of ε-good 2m-subsets is K
(2m)
2m+1-free. Combined with the known exact eight-qubit construction, this yields the stability plateau
Q
D
ex,ε(8, 4) = 56, 0 ≤ ε <
1
5
. For odd systems of 2k + 1 qubits, the exact forbidden hypergraph Hk is used to derive explicit
finite-error stability radii. Combined with the known exact eight-qubit construction, this yields the stability plateau
Q
D
ex,ε(8, 4) = 56, 0 ≤ ε <
1
5
. For odd systems of 2k + 1 qubits, the exact forbidden hypergraph Hk is used to derive explicit
finite-error stability radii. Combined with the known exact eight-qubit construction, this yields the stability plateau
Q
D
ex,ε(8, 4) = 56, 0 ≤ ε <
1
5
. For odd systems of 2k + 1 qubits, the exact forbidden hypergraph Hk is used to derive explicit
finite-error stability radii.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
The marginal maximal-mixing defect is defined for a subsystem A of dimension dA = 2A as DA = 2A Tr(ρ 2 A) − 1. This definition is motivated by the Hilbert–Schmidt formulation of approximate k-uniform states introduced by Guo et al., who quantify approximate local maximal mixing through the Hilbert–Schmidt proximity of every relevant marginal to IA/dA and emphasize the relevance of such a relaxation for finite-depth implementations, compilation errors, and physical noise. The defect also controls the trace-norm deviation from maximal mixing, where DA ≤ ε implies∥ρA −IA/dA∥1 ≤√ε.
The local stability inequality establishes that for a pure state on 4m qubits and every (2m + 1)-subset T, X i∈T DT i ≥ 1. This implies that whenever ε < 1/(2m + 1), the hypergraph of ε-good 2m-subsets is K(2m)2m+1-free. For eight qubits, this yields Q Dex,ε(8, 4) = 56 for 0 ≤ ε < 1/5 when combined with the known exact eight-qubit construction. The results provide a rigorous starting point by showing that quantum extremal-number phenomena can possess nontrivial finite-error stability intervals while remaining compatible with physically motivated state-level approximation criteria.
The marginal maximal-mixing defect is defined for a subsystem A of dimension dA = 2A as DA = 2A Tr(ρ 2 A) − 1. This definition is motivated by the Hilbert–Schmidt formulation of approximate k-uniform states introduced by Guo et al., who quantify approximate local maximal mixing through the Hilbert–Schmidt proximity of every relevant marginal to IA/dA and emphasize the relevance of such a relaxation for finite-depth implementations, compilation errors, and physical noise. The defect also controls the trace-norm deviation from maximal mixing, where DA ≤ ε implies∥ρA −IA/dA∥1 ≤√ε.
The local stability inequality establishes that for a pure state on 4m qubits and every (2m + 1)-subset T, X i∈T DT i ≥ 1. This implies that whenever ε < 1/(2m + 1), the hypergraph of ε-good 2m-subsets is K(2m)2m+1-free. For eight qubits, this yields Q Dex,ε(8, 4) = 56 for 0 ≤ ε < 1/5 when combined with the known exact eight-qubit construction. The results provide a rigorous starting point by showing that quantum extremal-number phenomena can possess nontrivial finite-error stability intervals while remaining compatible with physically motivated state-level approximation criteria.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Robust quantum extremal number calculation: The improved system can determine if a given set of reduced density matrices satisfies a marginal maximal-mixing defect threshold DA less than epsilon, thereby identifying whether a state is in the family G epsilon psi.
-
Quantum Turan graph detection: The system can check if the hypergraph of good subsets G epsilon psi is free of a complete K(2m) 2m+1 hypergraph for specified error thresholds, such as Q D ex,epsilon(8, 4) = 56 for epsilon less than 1/5.
-
Finite-error stability radius estimation: The system can calculate explicit lower bounds on the true stability radii of odd-qubit systems by computing the sharp local Hk stability radius epsilon star Hk, which is guaranteed to be positive for all k except k=5.
-
State characterization via Pauli representation: The system can use the Pauli coefficient formula to directly compute the marginal maximal-mixing defect DA for any subsystem A from a given pure state's Pauli expansion.
-
Quantum simulation error scaling analysis: The system can use the defect threshold DA less than epsilon as a dimension-adjusted local criterion compatible with state-dependent quantum simulation bounds, allowing it to predict if approximate k-uniformity retains average case Trotter error scaling.
Abstract
Absolutely maximally entangled (AME) states have attracted extensive attention because of their fundamental role and applications in quantum information. When an AME state does not exist, an extremal maximally entangled (EME) state is a pure multipartite state that maximizes the number of subsystems of size n/2 whose reduced states (obtained by tracing out all other parties) are maximally mixed. We study this maximum and extend the problem to a robust setting, in which small deviations from maximal mixing are allowed. We quantify these deviations using the purity of each reduced state and derive bounds by summing the deviations over selected groups of subsystems or over all subsystems of the target size. Local inequalities lead to combinatorial bounds based on forbidden hypergraphs and Turán-type counting, improving robust bounds for several general families of multipartite systems. Global inequalities, combined with combinatorial arguments and linear programming, determine the fourth and fifth known quantum extremal numbers: the maximal counts are 112 for nine qubits and 200 for ten qubits. We further show that these counts remain unchanged in the robust setting for eight-, nine-, and ten-qubit systems when the allowed deviations from maximal mixing are below 1/5, 1/143, and 1/16, respectively. These results provide a unified framework for determining exact and robust bounds on the number of maximally mixed reduced states.
Sources
- Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
- Absolute Maximal Entanglement and Quantum Secret Sharing
- Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
- Bounds on $k$-Uniform Quantum States
- Absolutely maximally entangled states of seven qubits do not exist
- How entangled can two couples get?
- Quantum shadow enumerators
- Approximate k-uniform states: definition, construction and applications
- Extremal Maximal Entanglement
- An Explicit Scott-Type Bound for Absolutely Maximally Entangled States with Arbitrary Defect
- The mixed-dimensional quantum MacWilliams identity: bounds for codes and absolutely maximally entangled states in heterogeneous systems
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements