On Non-Existence of Absolutely Maximally Entangled Canonical Graph States in Even Local Dimensions

arXiv:2603.18193 · quant-ph · Submitted 2026-03-18 · Read on arXiv

Listen

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: Today's paper: "On Non-Existence of Absolutely Maximally Entangled Canonical Graph States in Even Local Dimensions".

Mira: Absolutely maximally entangled (AME) states are crucial for quantum information theory, and this work demonstrates that certain classes of these states cannot be realized as graph states.

Kai: First, who's behind it and why it matters.

Title and authors: Kai: So, we're diving into this paper now. It looks like they're tackling a fundamental question about how entangled states can be constructed using graph states when the local dimension is even.

Mira: Exactly, Kai; it’s addressing the realization of absolutely maximally entangled (AME) canonical graph states in systems where each qudit has an even number of levels. This work suggests there are some absolute limits to what we can build with this specific type of state.

Lev: From a QEC standpoint, this is significant because AME states are crucial for building certain highly efficient error correction codes, and if these graph states aren't possible in even dimensions, it puts a real constraint on our code design.

Kai: Right, so what exactly did the authors find when they analyzed these constraints? They seem to be looking at the algebraic structure of the stabilizer group.

Mira: They establish a necessary and sufficient condition for a graph state to be AME based on the trace of its stabilizer operators, specifically that for every non-identity stabilizer operator S, Trceil(N/two)S has to be zero.

Lev: That leads them down a path where they assume the opposite—that an AME graph state actually exists but this condition fails for some stabilizers, which forces a contradiction in the algebraic system.

Kai: That's a pretty rigorous setup, Mira; assuming non-existence and then showing that assumption leads to an impossibility is a solid way to prove something about the structure.

Mira: It turns out they find that for N being a multiple of four and the local dimension d being even, no such AME graph states can exist. This is a non-existence result for an infinite family of states where the number of qudits is four times some integer n.

Lev: If this holds true, it means we can’t just pick any graph structure and guarantee maximal entanglement in these specific composite systems; there are inherent structural roadblocks.

Kai: So, what about how this work points toward future improvements or other avenues for research? Are there any suggestions on how researchers should proceed from these findings?

Mira: The paper itself focuses heavily on the proof of non-existence based on determinant analysis, showing that a contradiction arises when assuming the state is AME. They explore specific sums involving determinants, like 4n sum j=2n (-one) j Delta j.

Lev: The method they use to show j isn't a unit in Z d by looking at parity contradictions is quite deep, but for actual hardware implementation, it suggests that we need to be extremely careful about the graph topology and dimension choices.

Kai: I see; so the improvement suggested here is really more theoretical—it’s characterizing the limitations of canonical graph-state constructions rather than providing a direct construction method for these states.

Title and authors: Mira: That's accurate; they characterize what is impossible within that specific formal framework, which helps in understanding the boundaries between different types of quantum entanglement. This opens up questions about how we define AME states when we move away from the strict graph-state formalism.

Lev: For QEC, this tells us that if we design codes based on graph states for these composite systems, we have to avoid those even dimension multiples of four to ensure the state isn't perfectly AME.

Kai: So, looking at the overall situation with this paper on "On Non-Existence of Absolutely Maximally Entangled Canonical Graph States in Even Local Dimensions," what’s our big picture? What does this mean for quantum information theory as a whole?

Mira: It really shows that entanglement isn't always achievable through the simplest, most canonical structures like graph states, especially when you introduce composite local dimensions. This forces us to consider more general stabilizer classes and other state preparations.

Lev: For real hardware, this means if we are trying to engineer a system where every qudit is even-dimensional and we want maximal entanglement across all parties simultaneously, the graph state approach just won't work for those specific configurations.

Kai: So, to wrap up on the implications of "On Non-Existence of Absolutely Maximally Entangled Canonical Graph States in Even Local Dimensions," we’ve seen that AME states with N = 4n qudits and even local dimension d can't be graph states.

Mira: That result fundamentally limits the types of entanglement we can expect to find when using graph states as our primary building blocks in these multipartite systems.

Lev: It means that for error correction, we need to look beyond this specific class of states if we want those maximal entanglement properties in even-dimensional qudit architectures.

Kai: And it's fascinating because the authors are providing a clear algebraic reason why these states fall outside the graph state set, which is helpful for understanding the underlying constraints.

Mira: Indeed, and it sets a benchmark for what is possible within this specific mathematical language, highlighting where our current constructions stop working.

Lev: For practical QEC development, knowing these hard constraints helps us focus our search on other stabilizer families that might actually realize those desirable properties in even dimensions.

Kai: So, we've discussed the paper and its implications regarding AME graph states in even local dimensions. We're going to take a quick break before we look at another piece of quantum theory.

Mira: That was a lot of deep algebra, Kai; it really shows how precise the formalism has to be when dealing with these constraints on entanglement purity.

Lev: For me, the main thing is that this result gives us a clear 'no' for certain states, which helps us narrow down where we should put our experimental efforts next.

Kai: We’ll keep exploring these boundaries in our next segment of the show.

The paper's summary: Kai: So, to recap, the core finding of this paper is that you can't actually construct absolutely maximally entangled canonical graph states if you use a number of qudits that is a multiple of four and each individual qudit has an even local dimension.

Mira: Exactly, Kai; it boils down to the fact that the algebraic structure required for maximal entanglement simply doesn't align with the physical constraints imposed by even dimensions in this specific multipartite setup.

Lev: That’s what keeps me up at night from a hardware perspective; if we try to build a code based on these graph states in, say, four qudits of dimension two, it just won't be perfectly AME.

Kai: It really is that structural roadblock Mira mentioned; the math shows that there are specific mathematical conditions—those determinants and the sums—that lead to an unavoidable contradiction if we assume the state is AME.

Mira: And the contradiction arises because those conditions imply something impossible in our finite field arithmetic, essentially proving that no such graph state can satisfy both requirements simultaneously.

Lev: For error correction, this means we have a hard limit on the kinds of stabilizer codes we can use for these specific system sizes; we have to steer away from those configurations entirely if we want maximal entanglement.

Kai: It makes me wonder what this means for the actual experimentalists who are trying to build these systems; they're going to need to rethink their graph topologies or dimension choices if they want that kind of entanglement.

Mira: I think the real impact is theoretical, showing us where the boundary lies between states we can easily describe using graph theory and more general entanglement classes.

Lev: It points toward a future where we need methods to find these non-graph state AME states that still allow for good QEC performance in even dimensions.

Kai: So, while this paper shows what's impossible for canonical graph states, we still have to figure out how to build something entangled and useful in those same even-dimensional qudit systems.

The paper's improvements: Tom: So, the authors suggest that their work opens up avenues for exploring states that aren't strictly confined to canonical graph state definitions when dealing with even local dimensions and multiple qudits of four levels.

Kai: That means if we want to create maximally entangled states in those systems, we can't just rely on the standard graph state generators; we have to look at more general stabilizer classes or maybe mixed states that use controlled operations.

Mira: Precisely, Kai; it pushes us toward a broader theoretical framework where the algebraic structure isn't so rigidly tied to the simple graph topology they started with.

Lev: From a QEC standpoint, this suggests that when designing codes for these composite systems, we should be looking at stabilizer families beyond just those generated by local Pauli operators in this manner.

Kai: It sounds like the implication is that instead of giving up on entanglement entirely in these even-dimensional settings, we just have to change the way we think about what a "graph state" means for these larger systems.

Mira: That's right; it shifts our focus from finding impossible graph states to characterizing the broader landscape of realizable entangled states within those constraints.

Lev: For actual implementation, this might mean developing new encoding schemes or using more complex interaction Hamiltonians that achieve similar levels of entanglement without needing the strict graph state structure.

Kai: So, we move away from a single class of perfect states and start looking at a wider variety of preparations to achieve high-quality entanglement in these larger qudit systems.

Mira: Exactly, and this is where the real theoretical work begins; defining what constitutes an AME state when the standard construction fails is a very rich area for exploration.

Lev: If we can find a way to characterize these new classes of states algebraically, it will be hugely helpful for designing robust error correction codes that actually work in these architectures.

Kai: It sounds like the next step involves exploring those more general stabilizer structures and seeing what kind of entanglement they allow us to achieve practically.

Conclusion: Kai: So, to wrap things up on "On Non-Existence of Absolutely Maximally Entangled Canonical Graph States in Even Local Dimensions," we've established that these specific states simply can't be graph states when the local dimension is even and there are multiples of four qudits.

Mira: Indeed, Kai; the main implication is that we need to broaden our search for maximally entangled states beyond the simplest graph state constructions when dealing with composite systems having even dimensions.

Lev: For error correction, this result gives us a concrete constraint on what we can use as a starting point for codes in these architectures.

Kai: It really does show us where the limitations of canonical methods are, which is important for experimentalists planning their setups.

Mira: And it highlights how crucial it is to be very precise with our algebraic assumptions when we talk about entanglement purity and state characterization.

Lev: I think this directs us toward developing new encoding methods that don't rely on those specific graph state symmetries to achieve high-quality entanglement.

Kai: So, while the canonical path is blocked for these specific configurations, we still have a lot of interesting physics to explore in even-dimensional qudit systems.

Mira: That's right; the real value here is understanding the boundaries of what's mathematically possible before we start trying to build hardware that violates those boundaries.

Lev: It sets a very clear benchmark for researchers looking at stabilizer codes in these composite dimensions, telling them exactly which families of states to avoid if they want perfect AME properties.

Kai: I think this paper is a great tool for guiding the next phase of experimental work by showing us what we need to look out for in terms of state preparation.

Jakub Wójcik, Owidiusz Makuta, Wojciech Bruzda, Remigiusz Augusiak

Center for Theoretical Physics, Polish Academy of Sciences · Center for Quantum-Enabled Computing, Center for Theoretical Physics, Polish Academy of Sciences · ΛΑ Advancing Quantum Algorithms, Universite Leiden · Instituut-Lorentz, Universite Leiden

quant-ph

Submitted: 2026-03-18

Updated: 2026-09-28

Comments: 5 pages

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 80/100

The gist: Absolutely maximally entangled (AME) states are crucial for quantum information theory, and this work demonstrates that certain classes of these states cannot be realized as graph states.

Key concepts

Graph State: A graph state, denoted |G⟩, is a quantum state uniquely tied to a graph G (vertices and edges). It acts on basis states via specific operators (gi), and its properties are defined by the stabilizer group generated by these operators.
Absolutely Maximally Entangled (AME) State: An N-partite state is AME if it achieves a specific level of entanglement, quantified by the trace condition Tr[N/2](ψ⟨ψ|) = 1/d I ⊗ floor(N/2). This condition measures how maximally entangled the state is across all parties.
Stabilizer: The stabilizer S of a graph state |G⟩ is the group generated by the operators gi. A key property for AME states is that every non-identity element in this stabilizer must have a zero trace when measured against N/2, which simplifies the analysis significantly.

Terminology

Entanglement — 19× in this paper · explained in 3 episodes
Stabilizer States — 9× in this paper · explained in 2 episodes
Absolutely Maximally Entangled (AME) State — 4× in this paper · explained in 1 episode
Adjacency Matrix — 2× in this paper · explained in 1 episode
Benchmark — 2× in this paper · explained in 2 episodes
Core — 2× in this paper · explained in 2 episodes
Trace — 2× in this paper · explained in 2 episodes
Multipartite Entanglement — 1× in this paper · explained in 2 episodes
Physical Constraints — 1× in this paper · explained in 7 episodes

Summary

Absolutely maximally entangled (AME) states are crucial for quantum information theory, and this work demonstrates that certain classes of these states cannot be realized as graph states. The core finding establishes a non-existence result for an infinite family of stabilizer AME states when the number of qudits is a multiple of four and the local dimension is even.

The Gist

There are no AME N-partite graph states with 4n parties, for n ∈ N+ and even local dimension d.

Definitions and Formalism

The paper begins by defining the mathematical framework necessary to analyze these states. A graph state, denoted as a state G⟩ ∈ (Cn) ⊗N, is uniquely associated with a graph G (a tuple of vertices V and edges E). The state is defined by its action on the basis states:

gi G⟩ = G⟩ for all i ∈ [N], where gi = X i / N ∏ j=1 Z Γij / j.

The stabilizer S of a graph state G⟩ is the group generated by the operators gi; S = ⟨g1, g2,..., gN ⟩. The projector onto G⟩ is given by:

> G⟩⟨G = 1 / (dN) ∑ S∈S.

An N-partite state is defined as absolutely maximally entangled (AME state) if it satisfies the condition:

Tr⌈N/2⌉(ψ⟨ψ) = 1/d I ⊗⌊N/2⌋.

For a graph state G⟩, this is equivalent to:

[G] is AME state if Tr⌈N/2⌉(G⟩⟨G) = 1/d I ⊗⌊N/2⌋.

Main Result and Proof Strategy

The central theorem establishes the non-existence of these states. The proof relies on Lemma 1, which provides a simplified necessary and sufficient condition for a graph state to be an AME state:

Lemma 1. A graph state G⟩ stabilized by a stabilizer S is AME state iff ∀S ∈ S ∖ I: Tr⌈N/2⌉S = 0.

The proof proceeds by assuming the opposite—that a graph state is AME but Lemma 1 fails—leading to the conclusion that there exists a subset of stabilizers A such that for every S in A, Tr⌈N/2⌉(S) ≠ 0. This implies that for every S in A, S = Tr⌈N/2⌉(S) ⊗ I⌈N/2⌉. The paper then uses Fact 1 to show that this leads to a contradiction, as it implies the existence of a nontrivial solution in the kernel of an associated matrix over the finite ring Z d.

Contradiction via Determinant Analysis

The proof involves analyzing a specific sum involving determinants related to the stabilizer structure. For N = 4n and even local dimension d, there exists a subset B of stabilizer operators where each S in B is expressed as:

[S] = (2n−1 ∏ i=1 g αi / i) g αj / j, with j ⩾ 2n and αi ∈ [d−1] for all i ∈ [2n−1]∪I.

The condition for Tr⌈N/2⌉(S) ≠ 0 is equivalent to satisfying a system of equations (Eq. 14):

[∀r∉[2n−1]∪I, 2n−1 ∑ i=1 Γ irαi + Γ jrαj = 0 (mod d).

The paper then considers the sum:

[4n ∑ j=2n (−1) j ∆j.]

By expanding this sum using Laplace expansion (Eq. 16) and substituting it back into the sum (Eq. 15), the authors derive that:

[4n ∑ j=2n (−1) j ∆j = 0 (Eq. 18).

This result is shown to be equivalent to:

[n ∑ j=0 ∆2j+2n = n ∑ j=1 ∆2j+2n−1 (Eq. 19).

Assuming all determinants are units in Z d implies they are odd, leading to a parity contradiction if the right-hand side of Eq. 19 is even. This forces the conclusion that at least one determinant is not a unit, meaning Eq. 14 has a nontrivial solution for some j, thus proving G⟩ is not AME.

Improvements for AI systems

Based on the provided scientific paper, here are specific improvements that could be made to AI systems, categorized by the area of impact:

) 1. Enhanced Quantum State Characterization and Simulation for Qudit Systems:

The paper provides rigorous mathematical tools for analyzing and constructing quantum states (graph states, AME states) in composite local dimensions. An AI system trained on this formalism could perform the following improvements:

Generate novel, high-purity mixed entangled quantum states of qudit systems (e.g., 4 quhexes with optimal purity 1/2) that are non-separable by applying controlled local unitary operations (UCZ).
Simulate the effects of specific stabilizer group structures on entanglement measures, allowing for rapid verification of state properties in complex multipartite quantum circuits.
Develop an AI module capable of identifying whether a given quantum state belongs to the canonical graph state class or a more general stabilizer class, based on its underlying algebraic structure (e.g., checking for the existence of specific stabilizer generators).

) 2. Advanced Quantum Error Correction (QEC) Code Design:

The paper highlights how AME states are fundamental building blocks for quantum error correction codes derived from maximum-distance separable codes. An AI system could be improved by:

Automatically design and optimize stabilizer codes for qudit systems, specifically targeting configurations where the local dimension is a multiple of 4 or where the dimension is congruent to 2 modulo 4 (where pure AME states are forbidden).
Use the derived constraints (Corollary 1) to prune vast search spaces of potential QEC codes, focusing only on those that can be realized in physically meaningful dimensions.

) 3. Constraint-Aware Quantum Algorithm Synthesis:

The paper establishes hard algebraic constraints (e.g., non-existence of certain AME graph states). An AI could leverage this knowledge for:

Synthesizing quantum algorithms where the required initial entangled state must satisfy specific structural properties (e.g., being a mixed state with optimal purity). The AI would use the composite construction method to bypass limitations inherent in canonical graph-state formalisms.
Designing quantum circuits that explicitly utilize the coupling between subsystems (qubit and qutrit components) to ensure non-separability, as demonstrated by the UCZ operation, thereby maximizing entanglement for a given resource budget.

) 4. Theoretical Quantum Information Theory Modeling:

The paper provides a framework for understanding the boundary between stabilizer states and magic states. An AI researcher could:

Develop predictive models to estimate whether a newly discovered multipartite quantum state is likely to be a pure stabilizer state or a magic state, based on its correlation structure and algebraic invariants.
Analyze the impact of composite dimension factorization on the achievable entanglement purity, providing theoretical bounds for mixed states in arbitrary qudit systems.

This improved AI system can perform complex quantum simulations, design novel error-correcting codes with tighter constraints based on non-existence proofs, synthesize optimized mixed entangled states that are physically realizable (via coupling operations), and provide rigorous theoretical bounds for multipartite entanglement.

Abstract

We demonstrate that absolutely maximally entangled (AME) states consisting of N=4n qudits with n in1,2,3,, each of even local dimension d, cannot be realized as canonical graph states over the ring Z d. This result imposes strong constraints on AME states in composite local dimensions and characterizes the limitations of graph-state constructions for highly entangled multipartite quantum systems. Furthermore, for d 2 4 this obstruction, combined with the prime-power decomposition of stabilizer states, excludes all pure stabilizer AME states (including four quhexes), while clarifying the distinction between canonical Z d graph states and stabilizer constructions over prime-power factors. We also discuss a composite construction of mixed k-uniform states. For (N,d)=(4,6), the construction yields a rank-two mixed 2-uniform stabilizer state of purity 1/2, which is optimal among normalized stabilizer projectors.