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) 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
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 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.
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. These states provide perfect tensors and optimal quantum error-correcting codes, yet their existence is known only in restricted parameter regimes. For every odd prime power
q=pe≥3, we construct a stabilizer
AME(2q,q) state whose normalized one-party projection yields a stabilizer
AME(2q−1,q) state. A closed-form
q×q bordered-circulant matrix
Aq over
Fq2 generates a Hermitian self-dual maximum distance separable (MDS) code
[2q,q,q+1]q2, which lies outside the extended Reed-Solomon classes. In suitable bases, the amplitude tensors define normalized
q-unitary complex Hadamard matrices of order
qq with
pth-root phases. Additional constructions yield
AME(q+3,q) states and families at intermediate particle numbers through explicit rescalings of selected submatrices. We also provide nine explicit parent matrices and the corresponding one-party projections.
A pure quantum state of
nparties associated with the Hilbert space
Cd1⊗Cd2⊗⋯⊗Cdnis called
k-uniform if all the reductions to
k-parties are maximally mixed. The
npartite system is called homogenous if the local dimensions
d1=d2=⋯=dn, while it is called heterogeneous if the local dimensions are not all equal.
k-uniform sates play an important role in quantum information theory. There are much progress in characterizing and constructing
k-uniform states in homogeneous systems. However, the study of entanglement for heterogeneous systems is much more challenging than that for the homogeneous case. There are very few results known for the
k-uniform states in heterogeneous systems for
k>3. We present two general methods to construct
k-uniform states in the heterogeneous systems for general
k. The first construction is derived from the error correcting codes by establishing a connection between irredundant mixed orthogonal arrays and error correcting codes. We can produce many new
k-uniform states such that the local dimension of each subsystem can be a prime power. The second construction is derived from a matrix
Hmeeting the condition that
HA×Aˉ+HAˉ×AThas full rank for any row index set
Aof size
k. These matrix construction can provide more flexible choices for the local dimensions, i.e., the local dimensions can be any integer (not necessarily prime power) subject to some constraints. Our constructions imply that for any positive integer
k, one can construct
k-uniform states of a heterogeneous system in many different Hilbert spaces.
Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.