K-Uniform States in Quantum Systems

• K-Uniform states are multipartite quantum states whose every k-body marginal is maximally mixed, demonstrating the strongest form of quantum entanglement.
• They are constructed using combinatorial designs, coding theory, and symmetric matrix methods, which yield precise conditions for maximal entanglement.
• These states underpin practical applications such as quantum error correction, secret sharing, and information masking in complex quantum systems.

A k-uniform state is a highly entangled multipartite quantum state whose every k-body marginal is maximally mixed. Such states represent the strongest possible form of quantum entanglement in the sense that local subsystems of size up to k are indistinguishable from uniform noise. This property underlies major applications in quantum secret sharing, quantum error correction, quantum masking, and the study of multipartite entanglement measures. The theory of k-uniform states is grounded in combinatorial designs, coding theory, and quantum information theory.

1. Formal Definition and Characterization

Let $|\psi\rangle \in (\mathbb{C}^d)^{\otimes n}$ be a pure state on $n$ parties (each a $d$-level system). For any subset $A \subset \{1, \dots, n\}$ with $|A| = k$, let $$\rho_A = \operatorname{Tr}_{A^c} (|\psi\rangle\langle\psi|)$$ denote the reduced density matrix on $A$.

A pure state is called k-uniform if

$$\rho_A = \frac{I_{d^k}}{d^k}, \quad \text{for all } |A| = k.$$

All k-party marginals are maximally mixed: every such subset of parties is entirely decoupled from the remainder of the system with respect to local information.

If $k = \lfloor n/2 \rfloor$, the state is called absolutely maximally entangled (AME). The upper bound $k \leq \lfloor n/2 \rfloor$ is dictated by the Schmidt rank; larger $k$ would contradict the purity of $|\psi\rangle$ (Feng et al., 2015, Goyeneche et al., 2014, Shi et al., 2023).

2. Construction Techniques and Algebraic Foundations

There are several principal constructions for k-uniform pure states, closely related to combinatorial and algebraic objects.

Orthogonal Arrays and Coding-Theoretic Constructions

• An orthogonal array $\mathrm{OA}(r, n, d, k)$ is an $r \times n$ array over an alphabet of size $d$ such that in every choice of $k$ columns, all $d^k$ $k$-tuples appear equally often.
• If the array is irredundant (removal of any $k$ columns leaves all rows distinct), the uniform superposition over computational states indexed by the rows yields a k-uniform state (Goyeneche et al., 2014).
• Classical maximum distance separable (MDS) codes naturally provide such arrays: the codewords correspond to the array rows (Shi et al., 2020, Feng et al., 2015).
• The code construction: Let $C \subseteq \mathbb{Z}_p^n$ be a $[n, t, w]_p$ code with dual distance $w^\perp$. The uniform superposition over codewords gives a $k$-uniform state if $\min\{w, w^\perp\} > k$ (Feng et al., 2015, Shi et al., 2020).

Quadratic-Phase (Symmetric Matrix) Construction

• Fix a zero-diagonal, symmetric matrix $H \in M_n(\mathbb{Z}_p)$. The state

$$|\psi\rangle = \sum_{c \in \mathbb{Z}_p^n} e^{2\pi i c H c^T / p} |c\rangle$$

is k-uniform if, for every $k$-subset $A$, there exists an invertible $k \times k$ submatrix $H_{A\times B}$ for some $B$ with $|B| = k$ (Feng et al., 2015).

• For even $n$ and sufficiently large $p$, such $H$ exist, yielding $(n/2)$-uniform states.

Concatenated and Quantum-Array Approaches

• The Cl+Q method: Concatenate a classical MDS code block with a quantum orthonormal basis of k-uniform states to yield a $(k+1)$-uniform state that cannot be reduced to minimal-support (code-array) form under SLOCC or LU (Raissi et al., 2019).
• Quantum orthogonal arrays generalize classical arrays by allowing the entries to be quantum states, enabling further constructions particularly for $k=2,3$ (Zang et al., 2023, Zang et al., 2021).

3. Existence Results and Parameter Regimes

Existence of k-uniform states depends strongly on $(d,n,k)$ and the combinatorial designs/codes available:

• For prime power $d$, k-uniform states exist for all $N \geq 2k$ once $d \geq 4k-2$; for $d \geq 2k-1$, for all $2k \leq N \leq d+1$ (Shi et al., 2020).
• For $k=2,3$, infinite families are known:
  • 2-uniform: exist for all $d \geq 2$, $N \geq 5$ (with certain small gaps) (Zang et al., 2023).
  • 3-uniform: for all $N \geq 6$, $N \neq 7,8,9,11$ for qubits; for $d \geq 7$ and $N \geq 7$ for qudit systems (Zang et al., 2023, Zha et al., 2015).
• For every fixed $k$, there exists $M_k$ so that a k-uniform state exists for all $n \geq M_k$ with large enough $d$. In particular, $(n/2)$-uniform states exist for every even $n$ for large enough prime $p$ (Feng et al., 2015).
• For composite $d$, constructions exist provided the individual factors are sufficiently large and coprime (by combinatorial Chinese Remainder methods) (Pang et al., 2021, Feng et al., 2023).

Nonexistence results are provided by:

• Rains, Scott, and recent LP/shadow enumerator techniques, showing, e.g., no AME(n,2) for $n > 6$, and for $d=3,4,5$, upper bounds of $k \leq \theta n$ with $\theta < 1/2$ for sufficiently large $n$ (Shi et al., 2023, Ning et al., 4 Mar 2025).
• Refined shadow and LP bounds push linear upper bounds on feasible $k$ as a fraction of $n$; see (Ning et al., 4 Mar 2025) for quantitative estimates in moderate $d, n$.

4. Extensions to Heterogeneous and Mixed States

Heterogeneous k-Uniform States

• The above constructions generalize to heterogeneous systems $$(\mathbb{C}^{d_1}) \otimes ... \otimes (\mathbb{C}^{d_n})$$, using mixed orthogonal arrays (MOAs) and their irredundant versions (Shi et al., 2020, Pang et al., 2021, Feng et al., 2023).
• Heterogeneous k-uniform states exist for many parameter regimes, particularly when subsystem dimensions are coprime or of compatible algebraic structure.

Mixed k-Uniform States

• Mixed (not pure) k-uniform states $\rho$ satisfy $\rho_A = I_{d^k}/d^k$ for every k-party marginal. Construction uses orthogonal partitions of OAs, leading to mixtures of pure superpositions determined by the OA blocks (Zhang et al., 2024, Klobus et al., 2019).
• Purity $\operatorname{Tr}(\rho^2)$ is optimized by choosing the minimal number of orthogonal blocks; in some cases, mixed states with maximal purity match or exceed existing constructions.

Approximate k-Uniformity

• In practice, exact k-uniformity is often unattainable. An $\epsilon$-approximate k-uniform state satisfies $||\rho_A - I_{d^k}/d^k||_1 \leq \epsilon$ for all $A$, with approximate constructions available via Haar-random states or shallow random quantum circuits (Guo et al., 25 Jul 2025).
• Remote distinguishability of exact and approximate k-uniform states requires exponentially many measurements in $k$.

5. Applications in Quantum Information and Quantum Error Correction

k-uniform states constitute central resources:

• In quantum error correction, a k-uniform state is equivalent to a pure $((n,1,k+1))_d$ code. Existence results for k-uniform states thus give explicit QECC constructions and bounds on minimum achievable distances (Feng et al., 2015, Shi et al., 2023). Approximate k-uniformity underpins the theory of approximate QECCs (Guo et al., 25 Jul 2025).
• In quantum secret sharing, AME states guarantee threshold schemes, while general k-uniform states allow threshold and beyond-threshold access structures. For instance, any 3-homogeneous pure QSS scheme for $n \geq 5$ players must arise from a 3-uniform state (Liu et al., 9 Oct 2025).
• In quantum information masking, a k-uniform state ensures that no group of $k$ parties can extract hidden information from the total state, generalized to multipartite masking with explicit mappings between masking and QECC (Shi et al., 2020, Guo et al., 25 Jul 2025).
• In high-dimensional quantum teleportation and distributed protocols, maximal k-uniformity ensures robustness to local noise and maximal sharing rates.
• As benchmarks for multipartite entanglement, k-uniform states serve both as theoretical tools for quantifying entanglement and as minimal-support resource states for entanglement measures.

6. Graph and Hypergraph State Perspectives

• k-uniform states can be interpreted as graph or hypergraph states with a specific entanglement structure:
  • In the hypergraph formalism, a complete k-uniform hypergraph state is built by applying a $C^kZ$ gate (generalized controlled-Z) to each k-tuple of qubits, starting from $|+\rangle^{\otimes n}$ (Rossi et al., 2012, Arantes et al., 19 Nov 2025).
  • Stabilizer formalism: For k-uniform hypergraph states, stabilizers involve highly nonlocal operators whose expansions in the local Pauli basis require new combinatorial techniques for their explicit representation (Arantes et al., 19 Nov 2025).
  • Entanglement structure and nonlocality properties of these graph-based k-uniform states are distinct from those derived from codes or OAs.

7. Open Problems and Future Directions

• Classification of existence and explicit construction of k-uniform states for larger $k$, especially for non-prime-power $d$ and heterogeneous systems, remains an open combinatorial and algebraic challenge (Feng et al., 2023, Zang et al., 2021).
• LP and combinatorial bounds on $k$-uniform states in large systems are active research topics (Ning et al., 4 Mar 2025, Shi et al., 2023).
• Precise characterization of the gap between approximate and exact k-uniformity, especially for practical circuit constructions, and its implications for robust QECC and quantum cryptography, is under development (Guo et al., 25 Jul 2025, Majidy et al., 18 Mar 2025).
• Connections between combinatorial designs (generalized quantum Latin hypercubes, QOAs), error-correcting codes, and multipartite entanglement are being further explored to yield new explicit families and to enable automatable classification methods (Zang et al., 2021, Zang et al., 2023).

• (Feng et al., 2015) Multipartite entangled states, symmetric matrices and error-correcting codes
• (Goyeneche et al., 2014) Genuinely multipartite entangled states and orthogonal arrays
• (Shi et al., 2023) Bounds on $k$-Uniform Quantum States
• (Shi et al., 2020) $k$-Uniform states and quantum information masking
• (Raissi et al., 2019) Constructions of k-uniform and absolutely maximally entangled states beyond maximum distance codes
• (Zha et al., 2015) 3-Uniform states and orthogonal arrays
• (Zang et al., 2023) Quantum $k$-uniform states from quantum orthogonal arrays
• (Wang, 2021) Planar k-Uniform States: a Generalization of Planar Maximally Entangled States
• (Pang et al., 2021) Quantum k-uniform states for heterogeneous systems from irredundant mixed orthogonal arrays
• (Feng et al., 2023) Constructions of $k$-uniform states in heterogeneous systems
• (Zhang et al., 2024) Purity and construction of arbitrary dimensional $k$-uniform mixed states
• (Klobus et al., 2019) $k$-uniform mixed states
• (Rossi et al., 2012) Quantum Hypergraph States
• (Arantes et al., 19 Nov 2025) k-Uniform complete hypergraph states stabilizers in terms of local operators
• (Majidy et al., 18 Mar 2025) Scalable and fault-tolerant preparation of encoded k-uniform states
• (Guo et al., 25 Jul 2025) Approximate k-uniform states: definition, construction and applications
• (Ning et al., 4 Mar 2025) Linear Programming Bounds on $k$-Uniform States
• (Liu et al., 9 Oct 2025) Beyond AME: A Novel Connection between Quantum Secret Sharing Schemes and $k$-Uniform States
• (Zang et al., 2021) Quantum combinatorial designs and $k$-uniform states