--- title: Absolutely Maximally Entangled States url: https://www.emergentmind.com/topics/absolutely-maximally-entangled-states type: topic --- # Absolutely Maximally Entangled States Absolutely maximally entangled (AME) states are multipartite pure quantum states that exhibit maximal entanglement across every possible bipartition: for any subset of up to half the parties, the reduced density matrix is exactly maximally mixed. This property renders AME states as the most extremal representatives of multipartite entanglement, with profound connections to quantum error correction, secret sharing, teleportation, and holographic codes. The mathematical structure of AME states reveals deep relationships with algebraic combinatorics, coding theory, and matrix/tensor analysis. ## 1. Formal Definition and Structural Properties Let $|\Psi\rangle \in (\mathbb{C}^d)^{\otimes n}$ be a pure state on $n$ systems of local dimension $d$. For any subset $A \subset \{1, \dots, n\}$ with $|A| \leq \lfloor n/2 \rfloor$, let $\rho_A = \operatorname{Tr}_{\bar{A}}(|\Psi\rangle\langle\Psi|)$. The state is called **absolutely maximally entangled** (AME$(n,d)$) if \[ \rho_A = \frac{1}{d^{|A|}} \mathbb{I}_{d^{|A|}} \] for all such $A$. Equivalently, the von Neumann entropy of every reduced state for $|A| \leq \lfloor n/2 \rfloor$ is $|A| \log d$ [1306.2536][1506.08857][2003.13639]. AME is thus the extremal case of $k$-uniformity with $k = \lfloor n/2 \rfloor$. Key structural features include: - **Genuine multipartite entanglement**: No bipartition is separable; all bipartitions demonstrate maximal Schmidt rank and entropy. - **Perfect tensor property**: The defining tensor is an isometry under any flattening that maps up to $k$ indices to output and the rest to input (perfect tensors) [1910.07427]. - **Complete symmetry among parties**: All marginal spectra on equal-size subsystems are identical. ## 2. Existence, Minimal Support, and Classification The existence of AME$(n,d)$ states is highly parameter-dependent. - **Qubits ($d=2$)**: AME$(n,2)$ states exist if and only if $n \in \{2,3,5,6\}$ [2506.21282][1608.06228][2411.12208]. For $n=4$ or $n \geq 7$, no qubit AME states exist [1608.06228][2506.21282]. - **Qudits ($d>2$)**: By increasing $d$ (especially to prime powers), further AME states are possible; e.g., AME$(4,3)$ exists, with support on 9 basis states [1306.2879][1506.08857]. A necessary condition for minimal-support AME$(n,d)$ states is $d \geq \frac{n}{2}+1$ [1807.00218]; if $d$ is a prime power, Reed-Solomon codes provide constructions with $n=d+1$ [1807.00218]. - **Minimal support**: A minimal-support AME has exactly $d^{\lfloor n/2\rfloor}$ nonzero coefficients in the computational basis, realized using MDS codes and mutually orthogonal Latin hypercubes [1807.00218][1506.08857][1306.2879]. Classification by equivalence under local unitaries (LU) and SLOCC (stochastic local operations and classical communication) reveals sharp dichotomies: - For $n=3$ and $d=2$, GHZ is unique up to LU; for $n=4, d=3$, there is again a single LU class [2212.06737][2411.04096]. - For larger $d$ and $n\geq5$, typically infinitely many LU-inequivalent AME states exist, parameterized by continuous families of phases associated with irredundant orthogonal arrays [2411.04096][2212.06737][2003.13639]. - For $n\geq6$ and minimal-support AME states, there are necessarily infinitely many LU and SLOCC classes [2003.13639]. ## 3. Construction Methods ### Combinatorial and Coding Constructions Many AME states correspond directly to combinatorial objects: - **Classical MDS codes**: The codewords yield the basis states of the AME via $\ket{\mathrm{AME}} = \frac{1}{\sqrt{d^k}} \sum_{x \in \mathbb{F}_d^k} |Gx\rangle$, where $G$ is the generator matrix [1306.2536][1306.2879][1807.00218]. - **Orthogonal arrays (OA) and irredundant OA**: The existence of an irredundant OA with suitable parameters (rows $r > Nd - (N-1)$) guarantees infinitely many LU-inequivalent AME$(N,d)$ states [2411.04096]. ### Graph and Stabilizer States - **Graph-state formalism**: For prime $d$, stabilizer (graph) states correspond to adjacency matrices satisfying a linear-independence criterion in every $\lfloor n/2\rfloor$-subset, efficiently allowing the identification of AME states [1306.2879]. - **Multi-unitary/multi-isometry tensors**: AME$(2k,d)$ states correspond to $k$-unitary (multi-unitary) tensors; for odd or heterogeneous systems, the requirement generalizes to multi-isometry tensors [1506.08857][2001.08821], unifying approaches for homogeneous and heterogeneous dimensions. ### Circuit and Tensor-Network Approaches - **Quantum circuits**: Efficient gate decompositions are known for several small AME$(n,d)$, minimizing circuit depth and entangling gate count; graph-state and code-based AME circuit implementations are prominent [1904.07955][2504.05394]. For high $d$, non-stabilizer AME states with explicit multi-unitary diagonal gates have been constructed for $d=4,6,8$ [2504.05394]. - **Tensor network decompositions**: AME$(6,D)$ and AME$(8,D)$ for $D \geq 5,7$ can be constructed from a minimal network of perfect 4-leg tensors (perfect tensors), dramatically reducing gate counts compared to full graph-state approaches [2308.07042]. ### Heterogeneous and Irreducible AME States - **Heterogeneous local dimensions**: In $\mathbb{C}^{l}\otimes\mathbb{C}^{m}\otimes\mathbb{C}^{n}$ with $3 \leq l < m < n \leq m+l-1$, existence is governed by the feasibility of a "magic solution array" (MSA): a nonnegative matrix satisfying three combinatorial constraints, giving rise to AME states in heterogeneous systems [2001.08821]. - **Irreducibility criteria**: If a tripartite AME has one prime local dimension and the remaining two are coprime, the AME is irreducible; for multipartite systems, at least three primes among the local dimensions enforce irreducibility [2001.08821]. ## 4. Applications and Connections ### Quantum Error Correction - **Quantum MDS codes**: There is a one-to-one correspondence between AME$(n,d)$ and pure [[n,0,d/2+1]] quantum MDS codes, with AME(5,2) being the 5-qubit perfect code and AME(6,2) its code concatenation [1910.07427][1306.2536][1506.08857]. - **Code concatenation**: Entanglement swapping among AME states recapitulates code concatenation, as in the construction of holographic error-correcting codes (e.g., pentagon code) [1910.07427]. ### Quantum Secret Sharing - **Threshold and ramp schemes**: Even-party AME$(2m,d)$ states implement threshold $(m,2m-1)$ QSS schemes, while ramp QSS protocols generalize this using $(m,L,2m-L)$ access structures with the same AME resource [1306.2536][1306.2879]. - **Equivalence**: Every even-party AME state corresponds to a unique pure-state threshold QSS, and vice versa [1306.2536][1204.2289]. ### Multi-User Teleportation and Parallel Communication - **Open-destination teleportation**: An AME$(n,d)$ enables the perfect teleportation of up to $\lfloor n/2\rfloor$ unknown $d$-level states to any subset of parties, with the flexibility of choosing senders and recipients after state distribution [1204.2289][1910.07427]. - **Parallel transfer**: Both joint and local operations are possible, providing maximal transfer rates compatible with the quantum marginal properties of AME states. ### Holography and Perfect Tensors - **Holographic codes**: AME states, particularly perfect tensors, are central to toy models of AdS/CFT and holography, saturating corrected Ryu–Takayanagi entropy bounds and ensuring maximal boundary entanglement in tensor-network representations [1910.07427][1506.08857]. - **Generalized swapping**: Concatenation of perfect tensors realizes bulk-to-boundary mappings with precise control of entanglement structure. ### Quantum Steering and Nonlocality - **Assisted entanglement distillation and steering**: Heterogeneous AME states constructed via multi-isometry matrices enable one-sided device-independent steering protocols, with projective measurements on one system collapsing the remainder into maximally entangled states [2001.08821]. ## 5. Invariants, Classification Results, and Open Problems ### LU/SLOCC Equivalence and Parameter Counting - **LU classes**: For small $n, d$, especially $n=3$ or $d=2,3$, AME states are unique up to LU. For higher $d$ and $n$ ($n \geq 5$), the existence of irredundant OAs implies that there are usually infinitely many LU-inequivalent AME states, parameterized by continuous phase degrees of freedom associated with the OA rows [2212.06737][2411.04096][2003.13639]. - **SLOCC inequivalence**: For $n\ge6$, SLOCC-inequivalent AME states abound, as phase insertions in minimal-support constructions persist under invertible local operations [2003.13639]. ### Existence and Non-Existence - **No-go theorems**: - AME$(4,2)$: No four-qubit AME exists; proof via polynomial invariants (Luque–Thibon), quantum code propagation, and anti-commutator arguments in Pauli expansion [2506.21282]. - AME$(7,2)$: Nonexistence proved using Bloch-representation and weight parity rules [1608.06228][2506.21282]. - **Construction failures and exceptional solutions**: Euler’s 36-officers case ($d=6$): no pair of classical orthogonal Latin squares, but a quantum (nonclassical) solution via entangled orthogonal squares yields AME$(4,6)$ [2212.06737]. - **Open existence**: For large $n$ and small $d$, minimal-support AME existence is essentially governed by code-theoretic and combinatorial constraints (Singleton bound, MDS conjecture) [1807.00218]. For composite $d$ not a prime power, explicit construction remains open. ### Technical Tools and Criteria - **Bloch representation**: Provides characterization via vanishing of weight-$k$ correlation tensors for $k \leq \lfloor n/2 \rfloor$ and explicit criteria for nonexistence based on sign of trace norms [1801.08476]. - **Parity rule**: In Pauli expansions, the parity of operator weight determines algebraic constraints for possible AME states [1608.06228][2411.12208]. - **Maximum-concurrence criterion**: The purity of every marginal must attain its minimal value, equating to maximal bipartite I-concurrence in all cuts [2501.15477]. ## 6. Advanced Generalizations: Heterogeneous and Multipartite Regimes - **Heterogeneous systems**: The generalization of $k$-uniformity and AME to systems with varying local dimensions leads to new combinatorial existence problems, often settled by magic solution arrays – arrays of nonnegative entries meeting row/column and modular sum constraints [2001.08821]. Existence and irreducibility in such contexts are classified by number-theoretic relations among subsystem dimensions. - **Irreducibility**: The criterion that AME states with three or more prime local dimensions among an odd number of parties are irreducible unless they factor into smaller AMEs shows the atomicity of such states in the multipartite entanglement hierarchy [2001.08821]. ## 7. Open Questions and Outlook - **Classification for higher $n$ and composite $d$**: Many existence questions reduce to combinatorial and coding-theoretic problems; for $d$ not a prime power, minimal-support constructions are incomplete [1807.00218][2212.06737]. - **Non-stabilizer AME states and tensor structures**: Most applications and explicit circuits are based on stabilizer or graph-state AMEs; broader families may be accessible via designs based on biunimodular arrays, OAs, or quantum Latin squares [2504.05394][2212.06737]. - **Noise robustness and application in realistic devices**: The response of AME states to local noise, especially Pauli and dephasing channels, illustrates both their invariance (under depolarizing channels) and possible symmetry breaking—relevant for quantum error correction and benchmarking [2505.06755]. --- **References:** - [1306.2536] Absolutely Maximally Entangled States: Existence and Applications - [1506.08857] Absolutely Maximally Entangled states, combinatorial designs and multi-unitary matrices - [1306.2879] Absolutely Maximally Entangled Qudit Graph States - [1807.00218] On the Existence of Absolutely Maximally Entangled States of Minimal Support II - [1910.07427] Quantum error correction codes and absolutely maximally entangled states - [2212.06737] Absolutely maximally entangled state equivalence and the construction of infinite quantum solutions to the problem of 36 officers of Euler - [2411.04096] Local unitary equivalence of absolutely maximally entangled states constructed from orthogonal arrays - [2411.12208] Extremal Maximal Entanglement - [1608.06228] Absolutely maximally entangled states of seven qubits do not exist - [2003.13639] Stochastic Local Operations with Classical Communication of Absolutely Maximally Entangled States - [2506.21282] On two maximally entangled couples - [2501.15477] A maximum concurrence criterion to investigate absolutely maximally entangled states - [2504.05394] Quantum Circuits for High-Dimensional Absolutely Maximally Entangled States - [2505.06755] Sending absolutely maximally entangled states through noisy quantum channels - [2308.07042] Tensor network decompositions for absolutely maximally entangled states - [2001.08821] Absolutely maximally entangled states in tripartite heterogeneous systems Source: https://www.emergentmind.com/topics/absolutely-maximally-entangled-states