Absolutely Maximally Entangled States for Odd Prime Power Local Dimension

arXiv:2609.11796 · quant-ph · Submitted 2026-09-10 · Read on arXiv

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: "Absolutely Maximally Entangled States for Odd Prime Power Local Dimension".

Mira: Here's the gist of the paper. Absolutely maximally entangled (AME) states represent an extreme form of multipartite entanglement: every reduced system containing at most half of the parties is maximally mixed The resulting even- and odd-party AME states have parameters (N, d) = (2q, q), (N, d) = (2q − 1, q), (2) where q = p e These states connect multipartite entanglement with optimal quantum error correction, quantum secret sharing, parallel teleportation, multiunitary matrices and holographic tensor networks Construction of Stabilizer States The construction relies on a closed-form q × q bordered-circulant matrix Aq over Fq 2 which generates a Hermitian self-dual maximum distance separable (MDS) code

2q, q, q + 1: q 2 This code lies outside the extended Reed–Solomon classes The matrix Aq satisfies AqAq T = −Iq and is superregular, which ensures that every non-empty square submatrix is nonsingular This leads to the pure quantum code

[2q, 0, q + 1: ]q

23, 27: The resulting code saturates the quantum Singleton bound Derivation of AME Marginal Conditions The state recipe is given by Ψ2q⟩ = 1/q X c∈Cq D(c) The distance q + 1 means that every nonidentity term acts on at least q + 1 sites This proves AME(2q, q)

3: Measuring the first party in the computational basis gives each outcome r with probability 1/q and leaves the remaining parties in Ψ(r)2q−1⟩ This yields a normalized reduced state ρ(r)T = IT/qT Thus every outcome yields an AME(2q − 1, q) state Explicit Finite-Field Representatives The explicit construction involves a matrix Aq defined by formulas in Eq.

Kai: (S8) which are parameterized by a primitive element g and other field elements Table S8 provides explicit finite-field representatives for various odd prime powers q The matrix M34,17 is identified with the universal matrix A17 at q = 17 Exact arithmetic verified every square minor of the displayed primitive-element matrices through q = 13 and, for q = 17, every minor of order at most 8 General Families and Multiunitary Properties Additional families exist through explicit rescalings of selected submatrices, yielding AME(q + 3, q) states The rescaled amplitudes of an AME(2q, q) state form a matrix Uq of order q/q with pth-root phases These states give an infinite family of complex Hadamard matrices of Butson type that are q-unitary after normalization The universal family gives q-unitary complex Hadamard matrices of order q/q for every odd prime power q Descent Constructions The paper presents several descent constructions to generate additional families, including the Split (Thm.

Mira: S6), Circle (Thm.

Kai: S7), and Circle descent (Thm.

Paper summary: Kai: To wrap up, we're talking about the paper "Absolutely Maximally Entangled States for Odd Prime Power Local Dimension." The core idea is that they’ve managed to construct these AME states, which are super entangled, for every odd prime power q.

Mira: The authors are showing that by using a closed-form bordered-circulant matrix over the finite field Fq two they can generate a stabilizer code that saturates the quantum Singleton bound

<ref:2609.11796#pg3>: .

Lev: What this means in simple terms is that you can systematically build highly robust quantum states whose error correction capability scales perfectly with the dimension q of your local system

<ref:2609.11796#pg3>: . It moves the discussion from just finding *a* state to having a mathematical recipe for generating an infinite family of them.

Kai: The authors connect this construction to perfect tensors and optimal quantum error-correcting codes, which is what makes these states so relevant for practical applications

<ref:2609.11796#pg1>: .

Mira: And they also show that these states are linked to complex Hadamard matrices of Butson type, which provides a deep link between the entanglement structure and those matrix properties

<ref:2609.11796#pg3>: .

Lev: The limitation they mention is the complexity of implementing those specific unitary operations efficiently on real hardware when you move beyond the small prime powers they've explicitly constructed

<ref:2609.11796#pg3>: . That’s where the practical reality hits them

<ref:2609.11796#pg2>: .

Kai: So, while the math is beautiful and general, the next step for experimentalists is figuring out how to translate that specific algebraic structure into something you can actually cool down and measure on a chip

<ref:2609.11796#pg4>: .

Conclusion: Kai: So we're wrapping up this look at these new states called Absolutely Maximally Entangled States for Odd Prime Power Local Dimension, right?

Mira: Yeah, so basically, they’ve figured out a mathematical recipe to make these super entangled states for every odd prime power q.

Kai: That means if you have a system with a certain size or dimension, you can build this specific type of entanglement that has very strong error correction properties.

Mira: Exactly. The authors are showing how this construction connects multipartite entanglement directly to the best possible methods for quantum error correction and secret sharing.

Kai: It's interesting because they used a bordered-circulant matrix over a finite field, which is a pretty concrete way to build these states mathematically.

Mira: And that matrix construction leads them to these specific bounds for the code they generate, which are really tight—they actually hit the quantum Singleton bound for this particular setup.

Kai: So what does this mean practically? It suggests that the structure of the local dimension of your system dictates exactly how robust your entanglement can be.

Mira: It changes how we think about designing quantum information processors because it gives us a predictable way to generate these states based on the size of our system.

Kai: And since they have these general families and complex Hadamard matrices, it hints at a wider area for using this idea in other types of quantum systems too.

Mira: The limitation they mention is that while the math is solid for these specific odd prime powers, translating that into a physical state you can actually cool down and measure on hardware presents some real engineering hurdles.

Kai: That's the next big question then, how do we bridge this gap between the elegant mathematics and a working quantum chip?

Mykhailo Hontarenko, Karol ź Życzkowski

Institute of Theoretical Physics, Faculty of Physics, Astronomy and Applied Computer Science, Jagiellonian University · Center for Theoretical Physics, Polish Academy of Sciences

quant-ph

Submitted: 2026-09-10

Updated: 2026-11-13

Comments: 26 pages, 3 figures; Supplemental Material included. v2: title changed; construction extended to all N=2,...,2q for every odd prime power q

Project page: https://huberfe.github.io/ame

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 88/100

The gist: Absolutely maximally entangled (AME) states represent an extreme form of multipartite entanglement: every reduced system containing at most half of the parties is maximally mixed The resulting even-…

Key concepts

Absolutely Maximally Entangled (AME) States
These are extreme forms of multipartite entanglement where every subsystem containing at most half of the total parties is maximally mixed. They represent a high degree of interconnectedness among all involved quantum systems.
Bordered-Circulant Matrix Aq
This specific $q imes q$ matrix over a finite field $ ext{F}_q^2$ is used to generate a Hermitian self-dual maximum distance separable (MDS) code. This code structure ensures that every non-empty square submatrix is nonsingular, which is crucial for the subsequent state construction.
Quantum Singleton Bound
The construction results in a pure quantum code $[[2q, 0, q+1]]_q$. This specific distance saturates the quantum Singleton bound, meaning it achieves the maximum possible error-correcting capability allowed by that bound for its parameters.

Terminology

Summary

Absolutely maximally entangled (AME) states represent an extreme form of multipartite entanglement: every reduced system containing at most half of the parties is maximally mixed The resulting even- and odd-party AME states have parameters (N, d) = (2q, q), (N, d) = (2q − 1, q), (2) where q = p e These states connect multipartite entanglement with optimal quantum error correction, quantum secret sharing, parallel teleportation, multiunitary matrices and holographic tensor networks

Construction of Stabilizer States

The construction relies on a closed-form q × q bordered-circulant matrix Aq over Fq 2 which generates a Hermitian self-dual maximum distance separable (MDS) code [2q, q, q + 1]q 2 This code lies outside the extended Reed–Solomon classes The matrix Aq satisfies AqAq T = −Iq and is superregular, which ensures that every non-empty square submatrix is nonsingular This leads to the pure quantum code [[2q, 0, q + 1]]q [23, 27] The resulting code saturates the quantum Singleton bound

Derivation of AME Marginal Conditions

The state recipe is given by Ψ2q⟩ = 1/q X c∈Cq D(c) The distance q + 1 means that every nonidentity term acts on at least q + 1 sites This proves AME(2q, q) [3] Measuring the first party in the computational basis gives each outcome r with probability 1/q and leaves the remaining parties in Ψ(r)2q−1⟩ This yields a normalized reduced state ρ(r)T = IT/qT Thus every outcome yields an AME(2q − 1, q) state

Explicit Finite-Field Representatives

The explicit construction involves a matrix Aq defined by formulas in Eq. (S8) which are parameterized by a primitive element g and other field elements Table S8 provides explicit finite-field representatives for various odd prime powers q The matrix M34,17 is identified with the universal matrix A17 at q = 17 Exact arithmetic verified every square minor of the displayed primitive-element matrices through q = 13 and, for q = 17, every minor of order at most 8

General Families and Multiunitary Properties

Additional families exist through explicit rescalings of selected submatrices, yielding AME(q + 3, q) states The rescaled amplitudes of an AME(2q, q) state form a matrix Uq of order q/q with pth-root phases These states give an infinite family of complex Hadamard matrices of Butson type that are q-unitary after normalization The universal family gives q-unitary complex Hadamard matrices of order q/q for every odd prime power q

Descent Constructions

The paper presents several descent constructions to generate additional families, including the Split (Thm. S6), Circle (Thm. p. 6 S7), and Circle descent (Thm. p. 6

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

  1. Enhanced classification of multipartite entanglement states based on absolute maximal entanglement (AME) conditions by providing a complete existence table for odd prime power dimensions q, including even and odd party numbers (N). This allows AI systems to precisely determine which AME(N, d) states are known or unsettled.

  2. Construction of optimal quantum error-correcting codes with minimum distance d = q + 1 over Fq 2 using Hermitian self-dual maximum distance separable (MDS) codes derived from bordered-circulant matrices. This enables AI to design and verify codes that saturate the quantum Singleton bound for any odd prime power q, connecting coding theory with entanglement.

  3. Generation of complex Hadamard matrices of order q/q using rescaled amplitudes from AME(2q, q) states, which are shown to be q-unitary under balanced reshaping. This capability allows AI to generate highly structured unitary matrices with specific properties relevant for quantum computation and holographic tensor networks.

  4. Implementation of a systematic method for constructing parent AME states, including explicit bordered-circulant matrices and their one-party projections, allowing the AI to generate these complex mathematical structures directly from finite field parameters.

  5. Development of a tool to verify superregularity and Hermitian orthogonality for any proposed matrix Aq over Fq 2 by checking the determinant criteria and utilizing partial-fraction representations, ensuring that generated states satisfy necessary conditions for being AME.

Sources

Related papers