Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1708.06298 · Journal of Physics A Mathematical and Theoretical

Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity

Felix Huber, Christopher Eltschka, Jens Siewert, Otfried Gühne

Published Feb 8, 2018• 95 citations
arXivHTMLPDF

Abstract

Abstract A pure multipartite quantum state is called absolutely maximally entangled (AME), if all reductions obtained by tracing out at least half of its parties are maximally mixed. Maximal entanglement is then present across every bipartition. The existence of such states is in many cases unclear. With the help of the weight enumerator machinery known from quantum error correction and the shadow inequalities, we obtain new bounds on the existence of AME states in dimensions larger than two. To complete the treatment on the weight enumerator machinery, the quantum MacWilliams identity is derived in the Bloch representation. Finally, we consider AME states whose subsystems have different local dimensions, and present an example for a 2 × 3 × 3 × 3 system that shows maximal entanglement across every bipartition.

DOI
10.1088/1751-8121/aaade5

Related papers

Mixed-dimensional quantum MacWilliams identity: Bounds for codes and absolutely maximally entangled states in heterogeneous systems

David González-Lociga, Simeon Ball

As emerging quantum architectures evolve into heterogeneous networks combining different physical substrates, such as qubits for logic and higher-dimensional qudits for robust communication, the traditional scalar metrics of quantum error correction become insufficient. To address this, we introduce a mathematical framework based on dimension multisets to characterize quantum error-correcting codes (QECC) and absolutely maximally entangled (AME) states in mixed-dimensional Hilbert spaces. By replacing scalar weights with multisets, we accurately capture the exact physical composition of error supports across these diverse systems. Our central result is the mixed-dimensional quantum MacWilliams identity, which establishes the formal algebraic relationship between Shor-Laflamme enumerators and unitary weight enumerators. From this foundation, we deduce the mixed-dimensional shadow identity and derive rigorous, generalized constraints on code parameters, explicitly formulating the mixed-dimensional quantum Hamming, Singleton and Scott bounds, and developing a linear program to systematically evaluate code viability. For the Singleton bound, a tighter bound that has no homogeneous analogue is derived for pure mixed-dimensional codes. Finally, we deploy this enumerator machinery to thoroughly analyze AME states, utilizing shadow inequalities to constrain their existence and introducing a combinatorial grid method for the explicit construction of mixed-dimensional tripartite AME states.

quant-pharXiv:2604.25790•Physical Review A•Apr 29, 2026•3 citations

Absolutely maximally entangled pure states of multipartite quantum systems

Grzegorz Rajchel-Mieldzioć, Rafał Bistroń, Albert Rico +2 more

Abstract Absolutely maximally entangled (AME) pure states of a system composed of N parties are distinguished by the property that for any splitting at least one partial trace is maximally mixed. Due to maximal possible correlations between any two selected subsystems these states have numerous applications in various fields of quantum information processing including multi-user teleportation, quantum error correction and secret sharing. We present an updated survey of various techniques to generate such strongly entangled states, including those going beyond the standard construction of graph and stabilizer states. Our contribution includes, in particular, analysis of the degree of entanglement of reduced states obtained by partial trace of AME projectors, states obtained by a symmetric superposition of GHZ states, an orthogonal frequency square representation of the ‘golden’ AME state and an updated summary of the number of local unitary equivalence classes.

arXiv:2508.04777•Reports on Progress in Physics•May 1, 2026•17 citations

Explicit Absolutely Maximally Entangled states in dimensions twice a prime power

Palash Pandya

Absolutely maximally entangled (AME) states are pure multipartite states with maximally mixed reductions on every set of at most half the parties. We construct explicit families in local dimension $2q$, twice an odd prime power $q$, using an established coupling of qubits and $q$-level systems. The $q$-level states remove interference between branches, so the qubit states need maximally mixed reductions only on average. This gives AME$(9,2q)$ and AME$(11,2q)$ for every odd prime power $q\geq5$, AME$(13,2q)$ for $q\geq17$, AME$(15,2q)$ for $q\geq9$, and AME$(17,2q)$ for $q\geq67$. For every odd $N\geq3$, the same coupling gives AME$(N,2q)$ under the sufficient condition $q\geq\max\{N,2^{N-2}\}$ on the odd prime power $q$. Within this coupling, the smallest such $q$ must grow exponentially with $N$. Combined with known inputs and products, these families complete the nine-party classification: for integer $d\geq2$, an AME$(9,d)$ state exists if and only if $d\geq3$. Choosing the branch pairing also gives AME$(15,2p)$ states with a cyclic shift of the parties compensated by local unitaries, for every prime $p\equiv1\pmod{15}$.

arXiv:2611.17216•Nov 12, 2026•0 citations

An Explicit Scott-Type Bound for Absolutely Maximally Entangled States with Arbitrary Defect

Shixuan Zeng, Xiande Zhang

Absolutely maximally entangled (AME) states and, more generally, $k$-uniform states in $(\C^q)^{\otimes n}$ are central objects in multipartite entanglement theory, with applications to quantum secret sharing, quantum masking, and quantum error correction. In the extremal case $k=\lfloor n/2\rfloor$, Scott (2004) proved a sharp nonexistence bound showing that AME states cannot exist once the number of parties $n$ exceeds a threshold of order $2q^{2}$ (with a parity dependence on $n$), where $q$ is the local dimension. Recently, Ning et al.\ studied \emph{defective} AME states (i.e., $k=\lfloor n/2\rfloor-l$ with $l>0$), gave explicit Scott-type bounds for defects $l=1,2$ and conjectured a general $(2l+2)q^{2}+o(q^{2})$ behavior. In this paper, we solve this conjecture and establish a fully explicit Scott-type upper bound for AME states with arbitrary defect $l\ge 0$, yielding Scott's bound for $l=0$ and Ning et al.'s bounds for $l=1,2$ as special cases. Equivalently, this gives nonexistence bounds for one-dimensional pure quantum error-correcting codes near the quantum Singleton regime. The proof uses a truncated MacWilliams linear-programming system and an explicit infeasibility certificate. As a direct application, we derive explicit asymptotic upper bounds on $k/n$ for fixed local dimension $q$, improving the implicit upper bounds given by Ning et al.

quant-pharXiv:2606.01943•IEEE Transactions on Information Theory•Jun 2, 2026•1 citation

Optimal quantum error correcting codes from absolutely maximally entangled states

Zahra Raissi, Christian Gogolin, Arnau Riera +1 more

Abstract Absolutely maximally entangled (AME) states are pure multi-partite generalizations of the bipartite maximally entangled states with the property that all reduced states of at most half the system size are in the maximally mixed state. AME states are of interest for multipartite teleportation and quantum secret sharing and have recently found new applications in the context of high-energy physics in toy models realizing the AdS/CFT-correspondence. We work out in detail the connection between AME states of minimal support and classical maximum distance separable (MDS) error correcting codes and, in particular, provide explicit closed form expressions for AME states of n parties with local dimension q a power of a prime for all q ⩾ n − 1 . Building on this, we construct a generalization of the Bell-basis consisting of AME states and develop a stabilizer formalism for AME states. For every q ⩾ n − 1 prime, we show how to construct stabilizer QECCs that encode a logical qudit into a subspace spanned by AME states. Under a conjecture for which we provide numerical evidence, this construction produces a family of quantum error correcting codes [ [ n , 1 , n / 2 ] ] q for n even with the highest distance allowed by the quantum Singleton bound.

arXiv:1701.03359•Journal of Physics A Mathematical and Theoretical•Dec 13, 2017•59 citations

Constructing absolute maximally entangled states and optimal quantum error correcting codes

Zahra Raissi, Christian Gogolin, Arnau Riera +1 more

Absolutely maximally entangled (AME) states are pure multi-partite generalizations of the bipartite maximally entangled states with the property that all reduced states of at most half the system size are in the maximally mixed state. AME states are of interest for multipartite teleportation and quantum secret sharing and have recently found new applications in the context of high-energy physics in toy models realizing the AdS/CFT-correspondence. We work out in detail the connection between AME states of minimal support and classical maximum distance separable (MDS) error correcting codes and, in particular, provide explicit closed form expressions for AME states of $n$ parties with local dimension $q$ a power of a prime for all $q \geq n-1$. Building on this, we construct a generalization of the Bell-basis consisting of AME states and develop a stabilizer formalism for AME states. For every $q \geq n-1$ prime we show how to construct QECCs that encode a logical qudit into a subspace spanned by AME states. Under a conjecture for which we provide numerical evidence, this construction produces a family of quantum error correcting codes $[\![n,1,n/2]\!]_q$ for $n$ even, saturating the quantum Singleton bound. We show that our conjecture is equivalent to the existence of an operator whose support cannot be decreased by multiplying it with stabilizer products and explicitly construct the codes up to $n = 8$.

•Jan 12, 2017•1 citation
Abstract A pure multipartite quantum state is called absolutely maximally entangled (AME), if all reductions obtained by tracing out at least half of its parties are maximally mixed. Maximal entanglement is then present across every bipartition. The existence of such states is in many cases unclear. With the help of the weight enumerator machinery known from quantum error correction and the shadow inequalities, we obtain new bounds on the existence of AME states in dimensions larger than two. To complete the treatment on the weight enumerator machinery, the quantum MacWilliams identity is derived in the Bloch representation. Finally, we consider AME states whose subsystems have different local dimensions, and present an example for a 2 × 3 × 3 × 3 system that shows maximal entanglement across every bipartition.
As emerging quantum architectures evolve into heterogeneous networks combining different physical substrates, such as qubits for logic and higher-dimensional qudits for robust communication, the traditional scalar metrics of quantum error correction become insufficient. To address this, we introduce a mathematical framework based on dimension multisets to characterize quantum error-correcting codes (QECC) and absolutely maximally entangled (AME) states in mixed-dimensional Hilbert spaces. By replacing scalar weights with multisets, we accurately capture the exact physical composition of error supports across these diverse systems. Our central result is the mixed-dimensional quantum MacWilliams identity, which establishes the formal algebraic relationship between Shor-Laflamme enumerators and unitary weight enumerators. From this foundation, we deduce the mixed-dimensional shadow identity and derive rigorous, generalized constraints on code parameters, explicitly formulating the mixed-dimensional quantum Hamming, Singleton and Scott bounds, and developing a linear program to systematically evaluate code viability. For the Singleton bound, a tighter bound that has no homogeneous analogue is derived for pure mixed-dimensional codes. Finally, we deploy this enumerator machinery to thoroughly analyze AME states, utilizing shadow inequalities to constrain their existence and introducing a combinatorial grid method for the explicit construction of mixed-dimensional tripartite AME states.
Abstract Absolutely maximally entangled (AME) pure states of a system composed of N parties are distinguished by the property that for any splitting at least one partial trace is maximally mixed. Due to maximal possible correlations between any two selected subsystems these states have numerous applications in various fields of quantum information processing including multi-user teleportation, quantum error correction and secret sharing. We present an updated survey of various techniques to generate such strongly entangled states, including those going beyond the standard construction of graph and stabilizer states. Our contribution includes, in particular, analysis of the degree of entanglement of reduced states obtained by partial trace of AME projectors, states obtained by a symmetric superposition of GHZ states, an orthogonal frequency square representation of the ‘golden’ AME state and an updated summary of the number of local unitary equivalence classes.
Absolutely maximally entangled (AME) states are pure multipartite states with maximally mixed reductions on every set of at most half the parties. We construct explicit families in local dimension 2q2q2q, twice an odd prime power qqq, using an established coupling of qubits and qqq-level systems. The qqq-level states remove interference between branches, so the qubit states need maximally mixed reductions only on average. This gives AME(9,2q)(9,2q)(9,2q) and AME(11,2q)(11,2q)(11,2q) for every odd prime power q≥5q\geq5q≥5, AME(13,2q)(13,2q)(13,2q) for q≥17q\geq17q≥17, AME(15,2q)(15,2q)(15,2q) for q≥9q\geq9q≥9, and AME(17,2q)(17,2q)(17,2q) for q≥67q\geq67q≥67. For every odd N≥3N\geq3N≥3, the same coupling gives AME(N,2q)(N,2q)(N,2q) under the sufficient condition q≥max⁡{N,2N−2}q\geq\max\{N,2^{N-2}\}q≥max{N,2N−2} on the odd prime power qqq. Within this coupling, the smallest such qqq must grow exponentially with NNN. Combined with known inputs and products, these families complete the nine-party classification: for integer d≥2d\geq2d≥2, an AME(9,d)(9,d)(9,d) state exists if and only if d≥3d\geq3d≥3. Choosing the branch pairing also gives AME(15,2p)(15,2p)(15,2p) states with a cyclic shift of the parties compensated by local unitaries, for every prime p≡1(mod15)p\equiv1\pmod{15}p≡1(mod15).
Absolutely maximally entangled (AME) states and, more generally, kkk-uniform states in $(\C^q)^{\otimes n}$ are central objects in multipartite entanglement theory, with applications to quantum secret sharing, quantum masking, and quantum error correction. In the extremal case k=⌊n/2⌋k=\lfloor n/2\rfloork=⌊n/2⌋, Scott (2004) proved a sharp nonexistence bound showing that AME states cannot exist once the number of parties nnn exceeds a threshold of order 2q22q^{2}2q2 (with a parity dependence on nnn), where qqq is the local dimension. Recently, Ning et al.\ studied \emph{defective} AME states (i.e., k=⌊n/2⌋−lk=\lfloor n/2\rfloor-lk=⌊n/2⌋−l with l>0l>0l>0), gave explicit Scott-type bounds for defects l=1,2l=1,2l=1,2 and conjectured a general (2l+2)q2+o(q2)(2l+2)q^{2}+o(q^{2})(2l+2)q2+o(q2) behavior. In this paper, we solve this conjecture and establish a fully explicit Scott-type upper bound for AME states with arbitrary defect l≥0l\ge 0l≥0, yielding Scott's bound for l=0l=0l=0 and Ning et al.'s bounds for l=1,2l=1,2l=1,2 as special cases. Equivalently, this gives nonexistence bounds for one-dimensional pure quantum error-correcting codes near the quantum Singleton regime. The proof uses a truncated MacWilliams linear-programming system and an explicit infeasibility certificate. As a direct application, we derive explicit asymptotic upper bounds on k/nk/nk/n for fixed local dimension qqq, improving the implicit upper bounds given by Ning et al.
Abstract Absolutely maximally entangled (AME) states are pure multi-partite generalizations of the bipartite maximally entangled states with the property that all reduced states of at most half the system size are in the maximally mixed state. AME states are of interest for multipartite teleportation and quantum secret sharing and have recently found new applications in the context of high-energy physics in toy models realizing the AdS/CFT-correspondence. We work out in detail the connection between AME states of minimal support and classical maximum distance separable (MDS) error correcting codes and, in particular, provide explicit closed form expressions for AME states of n parties with local dimension q a power of a prime for all q ⩾ n − 1 . Building on this, we construct a generalization of the Bell-basis consisting of AME states and develop a stabilizer formalism for AME states. For every q ⩾ n − 1 prime, we show how to construct stabilizer QECCs that encode a logical qudit into a subspace spanned by AME states. Under a conjecture for which we provide numerical evidence, this construction produces a family of quantum error correcting codes [ [ n , 1 , n / 2 ] ] q for n even with the highest distance allowed by the quantum Singleton bound.
Absolutely maximally entangled (AME) states are pure multi-partite generalizations of the bipartite maximally entangled states with the property that all reduced states of at most half the system size are in the maximally mixed state. AME states are of interest for multipartite teleportation and quantum secret sharing and have recently found new applications in the context of high-energy physics in toy models realizing the AdS/CFT-correspondence. We work out in detail the connection between AME states of minimal support and classical maximum distance separable (MDS) error correcting codes and, in particular, provide explicit closed form expressions for AME states of nnn parties with local dimension qqq a power of a prime for all q≥n−1q \geq n-1q≥n−1. Building on this, we construct a generalization of the Bell-basis consisting of AME states and develop a stabilizer formalism for AME states. For every q≥n−1q \geq n-1q≥n−1 prime we show how to construct QECCs that encode a logical qudit into a subspace spanned by AME states. Under a conjecture for which we provide numerical evidence, this construction produces a family of quantum error correcting codes [ ⁣[n,1,n/2] ⁣]q[\![n,1,n/2]\!]_q[[n,1,n/2]]q​ for nnn even, saturating the quantum Singleton bound. We show that our conjecture is equivalent to the existence of an operator whose support cannot be decreased by multiplying it with stabilizer products and explicitly construct the codes up to n=8n = 8n=8.