The mixed-dimensional quantum MacWilliams identity: bounds for codes and absolutely maximally entangled states in heterogeneous systems

This paper introduces a mixed-dimensional quantum MacWilliams identity using dimension multisets to establish rigorous bounds (including Hamming, Singleton, and Scott) for quantum error-correcting codes and to analyze and construct absolutely maximally entangled states in heterogeneous quantum systems.

The Gist

Imagine you are building a super-secure vault to protect a secret message. In the old days of quantum computing, everyone assumed every "lock" in the vault was exactly the same size and shape (like a room full of identical square boxes). The rules for checking if the vault was secure were written specifically for these identical boxes.

But the future of quantum technology is different. We are moving toward heterogeneous systems—vaults made of a mix of different things: small, fast "qubits" (like tiny, quick coins) and larger, more robust "qudits" (like heavy, sturdy bricks).

The problem? The old rulebooks for checking security don't work when you mix coins and bricks. If you try to use the old rules, you might think a single broken brick is the same "damage" as a broken coin, but in reality, they are totally different.

This paper introduces a new way to measure and build these mixed vaults. Here is the breakdown of their discovery using simple analogies:

1. The New Ruler: "Dimension Multisets"

In the old system, if an error (a mistake or a break-in) happened, scientists just counted how many boxes were affected.

• Old Way: "Three boxes are broken."
• New Reality: "One big brick and two small coins are broken."

The authors introduce a new tool called a "dimension multiset." Think of this not as a simple counter, but as a shopping list or a recipe. Instead of just saying "3 items," the list says "1 brick, 2 coins." This allows them to track the exact physical makeup of an error. You can't just count the number of items; you have to know what those items are made of to understand the damage.

2. The Master Key: The "MacWilliams Identity"

In coding theory, there is a famous mathematical rule called the MacWilliams Identity. Think of this as a "Master Key" that connects two different ways of looking at a code:

1. The Error View: How the code looks when errors happen.
2. The Structure View: How the code looks from the inside (its internal symmetry).

For years, this Master Key only worked for vaults made of identical boxes. The authors proved a Mixed-Dimensional MacWilliams Identity. They created a new Master Key that works even when your vault is a chaotic mix of bricks and coins. This key allows them to translate between the "error view" and the "structure view" without getting lost in the math.

3. The Security Limits: "The Hamming and Singleton Bounds"

Using this new Master Key and the "shopping list" method, the authors derived new rules for how much information you can safely store.

• The Hamming Bound (The Volume Limit): Imagine trying to pack suitcases into a car. If the suitcases are all different sizes (some big, some small), you can't just count the number of suitcases; you have to calculate the actual space they take up. The authors created a new "packing rule" for mixed systems. It tells you the absolute maximum amount of data you can fit before the vault becomes too crowded to be secure.
• The Singleton Bound (The Purity Trap): This is their most surprising finding. In the old world of identical boxes, if you wanted to build the most efficient vault possible (one that holds the maximum data), it had to be "pure" (perfectly symmetrical).
  • The New Discovery: In a mixed system (bricks and coins), the authors found that if you try to build the most efficient vault possible, it cannot be pure. It must be "impure."
  • Analogy: It's like trying to build a perfect bridge using only steel. If you mix steel and wood, the strongest possible bridge you can build requires the wood to be placed in a specific, imperfect way. You can't have a "perfectly symmetrical" bridge with mixed materials; the math forces it to be asymmetrical to reach maximum strength.

4. The "Shadow" Test

The authors also developed a "Shadow Test." Imagine you are trying to find a hidden object in a dark room. You can't see the object, but you can see the shadow it casts on the wall.

• If the shadow looks weird or impossible, you know the object doesn't exist.
• The authors used this "shadow" math to prove that certain types of "perfectly entangled" states (super-connected quantum states) cannot exist in specific mixed systems. For example, they proved you cannot create a specific type of perfect connection using 7 coins and 1 brick. The "shadow" of that setup is mathematically impossible.

5. Building the Perfect Bridge: The "Combinatorial Grid"

Finally, for systems with just three parts (a tripartite system), they invented a Combinatorial Grid Method.

• The Analogy: Imagine a Sudoku puzzle or a crossword grid. The authors showed that if you can fill a grid with numbers according to specific rules (balancing rows and columns), you have automatically built a perfect quantum state.
• They used this to explicitly construct new, working examples of these mixed quantum states, turning abstract math into a concrete "blueprint" that engineers could theoretically follow.

Summary

The paper says: "We live in a world of mixed quantum parts (coins and bricks). The old math doesn't work. We have created a new 'shopping list' math (multisets) and a new Master Key (MacWilliams Identity) to handle this mix. We found that the most efficient mixed vaults must be imperfect (impure), and we have a new way to draw blueprints (grids) to build them."

Technical Summary

1. Problem Statement

As quantum architectures evolve toward heterogeneous networks (combining qubits for logic and higher-dimensional qudits for robust communication), traditional mathematical frameworks for quantum error correction (QEC) and entanglement characterization become insufficient.

• The Limitation: Existing theories (e.g., Shor-Laflamme enumerators, MacWilliams identities) assume homogeneous systems where all subsystems share a constant local dimension $D$. They rely on scalar weights (the number of subsystems an error acts on).
• The Gap: In mixed-dimensional systems, an error acting on a single high-dimensional qudit may have the same "dimensional weight" as an error acting on multiple qubits, yet their physical impact and combinatorial footprints differ. Scalar metrics fail to capture the exact physical composition of error supports, rendering standard bounds (Hamming, Singleton) and existence criteria for Absolutely Maximally Entangled (AME) states inaccurate or inapplicable.

2. Methodology

The authors introduce a mathematical framework based on dimension multisets to generalize quantum coding theory to heterogeneous Hilbert spaces.

• Dimension Multisets: Instead of tracking the scalar weight of an error, the framework tracks the multiset of local dimensions of the subsystems involved in the error's support. For a subsystem $S$, the dimension multiset is $D(S) = \{D_i \mid i \in S\}$.
• Multivariate Enumerators: The authors redefine weight enumerators (Shor-Laflamme and Unitary) as multivariate polynomials.
  • Variables are grouped by distinct local dimensions ($x_d, y_d$ for each dimension $d$).
  • Coefficients are indexed by dimension multisets $v$ rather than integers.
  • This formulation naturally reduces to standard homogeneous enumerators when all dimensions are equal.
• Algebraic Derivations: Using the Bloch representation of operators and combinatorial counting lemmas (generalizing binomial coefficients to multisets), the authors derive algebraic identities connecting these new enumerators.

3. Key Contributions

A. The Mixed-Dimensional Quantum MacWilliams Identity

The central theoretical result is the proof of the mixed-dimensional quantum MacWilliams identity. This establishes the formal algebraic relationship between the multivariate Shor-Laflamme enumerators ($A, B$) and the unitary enumerators ($A', B'$).

• Result: The identity expresses the unitary enumerator as a transformation of the Shor-Laflamme enumerator, where the transformation parameters depend explicitly on the local dimensions $d$.
• Significance: This provides the necessary algebraic link to translate constraints between different types of enumerators in heterogeneous systems.

B. The Mixed-Dimensional Shadow Identity

Building on the MacWilliams identity, the authors derive the mixed-dimensional shadow identity.

• This relates the shadow weight enumerator (derived from shadow inequalities) to the Shor-Laflamme enumerator.
• It allows for the formulation of linear programs to systematically test the feasibility of code parameters. If no non-negative solution exists for the linear program, the code cannot exist.

C. Generalized Bounds

The framework yields rigorous, generalized constraints on code parameters:

1. Quantum Hamming Bound: Derived for non-degenerate mixed-dimensional codes. It accounts for the geometric volume of error spaces, summing the dimensions of all correctable error profiles defined by dimension multisets.
2. Quantum Singleton Bound:
   • General Bound: A generalized version for mixed-dimensional codes.
   • Pure Code Bound: A tighter bound derived specifically for pure mixed-dimensional codes. Crucially, this bound has no direct analogue in homogeneous systems.
   • Key Insight: The authors prove that in mixed-dimensional spaces, a code that saturates the general Singleton bound (maximizing dimension) is mathematically forced to be impure if the pure bound is strictly lower. This contrasts with homogeneous systems where Maximum Distance Separable (MDS) codes are typically pure.

D. AME State Characterization

The framework is applied to Absolutely Maximally Entangled (AME) states:

• Existence Constraints: Generalized Scott bounds and shadow inequalities are used to rule out the existence of AME states in specific heterogeneous configurations (e.g., 7 qubits + 1 qutrit).
• Combinatorial Grid Construction: A novel method is introduced for constructing tripartite AME states. This maps quantum algebraic constraints (maximally mixed reductions) to a combinatorial grid problem involving probability weights, row/column balance, and disjoint partitions.

4. Key Results and Examples

• Non-Existence Proofs:
  • Proved that an AME state does not exist for a system of 7 qubits and 1 qutrit ($H = (C^2)^{\otimes 7} \otimes C^3$) using the generalized Scott bound.
  • Proved non-existence for 4 parties with dimensions $C^2 \otimes C^2 \otimes C^2 \otimes C^3$ using shadow inequalities.
• Explicit Constructions:
  • Provided explicit AME states for heterogeneous tripartite systems:
    • $C^2 \otimes C^2 \otimes C^3$
    • $C^2 \otimes C^3 \otimes C^3$
    • $C^2 \otimes C^3 \otimes C^4$
    • $C^3 \otimes C^3 \otimes C^4$ and $C^3 \otimes C^4 \otimes C^4$ (Appendix).
• Linear Programming: Demonstrated that the linear program can distinguish between pure and impure codes, showing that high-performance non-degenerate codes in mixed dimensions must be impure.

5. Significance and Impact

• Bridging Theory and Hardware: As quantum hardware moves toward heterogeneous architectures (integrating different physical substrates), this work provides the essential theoretical toolkit to design and analyze error correction protocols for these realistic systems.
• Refining Entanglement Theory: The discovery that pure MDS codes do not exist in mixed-dimensional spaces (where they would in homogeneous spaces) reveals a fundamental difference in resource packing dynamics. It suggests that "impurity" is a necessary feature for maximizing information capacity in heterogeneous systems.
• Combinatorial-Quantum Bridge: The introduction of the combinatorial grid method offers a constructive, intuitive approach to building complex entangled states, moving beyond abstract existence proofs to explicit state generation.
• Generalization: The framework successfully generalizes classical coding theory concepts (MacWilliams identities, Krawtchouk polynomials) to the quantum mixed-dimensional regime, opening the door for further research into multipartite heterogeneous systems.

In summary, this paper establishes the foundational mathematics for quantum error correction and entanglement in the era of heterogeneous quantum computing, replacing scalar metrics with dimension multisets to provide accurate bounds, existence criteria, and construction methods.