⚛️ quantum physics

Quantum Circuits for High-Dimensional Absolutely Maximally Entangled States

This paper presents explicit quantum circuits for generating exemplary non-stabilizer absolutely maximally entangled (AME) states across four subsystems with varying dimensions and analyzes their utility in quantum information tasks.

Original authors: Berta Casas, Grzegorz Rajchel-Mieldzioć, Suhail Ahmad Rather, Marcin Płodzień, Wojciech Bruzda, Alba Cervera-Lierta, Karol Życzkowski

Published 2026-03-24

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Berta Casas, Grzegorz Rajchel-Mieldzioć, Suhail Ahmad Rather, Marcin Płodzień, Wojciech Bruzda, Alba Cervera-Lierta, Karol Życzkowski

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to build the ultimate "super-connection" between a group of friends. In the world of quantum physics, this connection is called entanglement. Usually, when we talk about entanglement, we imagine pairs of friends who are so linked that if one sneezes, the other instantly catches a cold, no matter how far apart they are.

But this paper is about something much more ambitious: creating a group of four friends who are all perfectly linked to each other simultaneously, in every possible way you can split the group up.

Here is a simple breakdown of what the researchers did, using everyday analogies.

1. The Goal: The "Perfect Party" (AME States)

The scientists are looking for a special type of quantum state called an Absolutely Maximally Entangled (AME) state.

The Analogy: Imagine a party with four people (A, B, C, and D).
- In a normal "GHZ" party (the standard quantum state), if you look at just A and B, they might be linked, but C and D are just watching from the side.
- In an AME party, it's a perfect circle of friendship. If you take any two people out of the room, the remaining two are still perfectly linked to them. If you take any one person out, the other three are still perfectly linked.
- It's like a group of four people where every single pair, and every single trio, shares a secret handshake that is impossible to break.

Why do we want this?
These states are the "gold standard" for quantum computers. They are incredibly robust and useful for:

Teleportation: Sending information instantly across the group.
Secret Sharing: Splitting a secret so that you need a specific combination of people to unlock it, but no single person can do it alone.
Error Correction: If one part of the system gets messed up (like a noisy phone call), the information is so well-distributed that the group can still figure out what was said.

2. The Problem: The "Missing Puzzle Pieces"

For a long time, scientists knew how to build these perfect parties for some group sizes, but not all.

The "Stabilizer" States: Most known AME states are like "Lego structures." They are built using standard, predictable blocks (called graph states). You can easily draw a map of how they connect.
The "Non-Stabilizer" States: The researchers wanted to build AME states that aren't made of standard Lego blocks. These are the "weird," complex structures that don't follow the usual rules.
The Challenge: Specifically, they wanted to build these for groups where each person has more than just two options (like a coin flip: Heads/Tails). They wanted to build them for people who have 4, 6, or 8 options (like a 4-sided die, a 6-sided die, or an 8-sided die).

Until now, we knew these "weird" perfect parties existed mathematically, but we didn't know how to actually build them in a lab. It was like having a blueprint for a castle but no instructions on how to lay the bricks.

3. The Solution: The "Instruction Manual"

This paper provides the blueprints and circuits to build these complex, non-standard AME states.

The "Qudits": Instead of using simple qubits (coins that are Heads or Tails), they use qudits (dice with 4, 6, or 8 sides).
The Circuit: The authors designed specific sequences of quantum gates (the "moves" a quantum computer makes) to create these states.
- AME(4, 4): A party of 4 people, each holding a 4-sided die.
- AME(4, 6): A party of 4 people, each holding a 6-sided die. (This is the famous "36 Officers of Euler" problem solved in quantum mechanics!).
- AME(4, 8): A party of 4 people, each holding an 8-sided die.

They showed that even though these states are complex, you can build them using current technology, like trapped ions (atoms held by lasers) or photonic circuits (light).

4. The "Noise" Test: Will the Party Survive?

Real-world quantum computers are noisy. It's like trying to have a perfect conversation in a crowded, loud bar.

The researchers tested their new states against "noise" (static, errors, interference).
The Result: Surprisingly, these complex AME states are very tough. Even with a fair amount of noise (up to about 28-35%), the "perfect party" connection remains stronger than in other types of quantum states.
Analogy: If you try to whisper a secret in a noisy room, a normal pair might fail. But this "super-group" is so tightly knit that even with the noise, they can still hear each other perfectly.

5. Why This Matters

This paper is a bridge between math theory and real-world engineering.

Before: We knew these "perfectly entangled" states existed on paper, but we couldn't build them.
Now: We have the specific instructions (circuits) to build them on real hardware.

This is a big deal because:

Benchmarking: It gives us a new, harder test to see if a quantum computer is actually working well. If a computer can build this "perfect party," it's doing something amazing.
New Tech: It opens the door to better quantum teleportation and unhackable communication networks.
Math in Action: It solves a centuries-old math puzzle (Euler's 36 Officers) by turning it into a physical quantum experiment.

Summary

Think of this paper as the instruction manual for building the ultimate quantum super-connection. The researchers figured out how to take complex, high-dimensional dice (4, 6, and 8 sides) and arrange them into a state where everyone is perfectly linked to everyone else, even in the presence of noise. They didn't just prove it's possible; they showed us exactly which buttons to push on a quantum computer to make it happen.

1. Problem Statement

Absolutely Maximally Entangled (AME) states are multipartite quantum states where every subset of particles is maximally entangled with its complement. They are crucial for quantum error correction, secret sharing, and advanced teleportation protocols.

The Gap: While AME states based on stabilizer formalism (graph states) are well-understood and efficiently simulable (via the Gottesman-Knill theorem), there is a lack of practical methods to generate non-stabilizer AME states. These non-stabilizer states possess entanglement structures beyond the Clifford regime, making them superior benchmarks for quantum hardware but difficult to construct.
Specific Challenge: For systems with four parties ( $n=4$ ) and local dimensions $d > 3$ (specifically $d=4, 6, 8$ ), explicit quantum circuits for non-stabilizer AME states were previously unknown. Furthermore, existing hardware is predominantly qubit-based, requiring efficient encoding strategies for higher-dimensional qudits.

2. Methodology

The authors propose a systematic approach to construct and implement non-stabilizer AME states using biunimodular vectors and multi-unitary gates.

A. Theoretical Framework

Operator-State Mapping: The paper utilizes the isomorphism between a pure four-qudit state and a bipartite operator. An AME state is generated by applying a multi-unitary gate ( $U$ ) to a pair of Bell states.
Multi-Unitary Gates: A gate $U$ is "multi-unitary" if $U$ , its reshuffling ( $U^R$ ), and its partial transpose ( $U^\Gamma$ ) are all unitary. This property ensures the resulting state is maximally entangled across all bipartitions.
Biunimodular Construction: The authors use biunimodular vectors (vectors with unit modulus entries that vanish in periodic auto-correlations) to construct these multi-unitary gates. This method allows for the generation of gates that are non-Clifford, distinguishing them from standard graph states.

B. Circuit Design Strategies

The paper presents explicit circuits for three specific cases, adapting the theoretical gates to different hardware architectures:

AME(4, 4) - Four Ququarts (8 Qubits):
- Encodes each 4-level system into 2 qubits.
- Replaces the 4-dimensional Fourier gate ( $F_4$ ) with a tensor product of Hadamard gates ( $H \otimes H$ ) to simplify implementation.
- Decomposes the required diagonal unitary $D[\Lambda]$ into single-qubit phase gates ( $S, S^\dagger$ ) and multi-qubit controlled gates (CCZ).
AME(4, 6) - Four Quhexes (12 Qubits/Qutrits):
- Addresses the case where no stabilizer AME state exists.
- Proposes a mixed-hardware architecture: encoding each 6-level system as a qubit ( $d=2$ ) and a qutrit ( $d=3$ ).
- Uses an iterative numerical algorithm to find a biunimodular vector for $d=6$ and decomposes the resulting diagonal gate into controlled-phase operations.
AME(4, 8) - Four Quocts (12 Qubits):
- Encodes each 8-level system into 3 qubits ( $2^3 = 8$ ).
- Constructs the multi-unitary gate using a tensor product of three Hadamard gates.
- Decomposes the complex 64-dimensional diagonal unitary into a sequence of CNOT and single-qubit $Z$ -rotations.

C. Experimental Validation & Analysis

Entanglement Certification: The authors derive a fidelity threshold ( $F \geq \frac{d-1}{d}$ ) required to certify that an experimental state is genuinely multipartite entangled in a $d^4$ -dimensional space.
Noise Robustness: They analyze the states under depolarizing noise. Using negativity as an entanglement measure, they demonstrate that AME(4, 6) retains superior entanglement compared to generic Haar-random states and GHZ states up to a noise level of $\gamma \approx 28\%$ .
Teleportation: The paper evaluates the utility of these noisy states in quantum teleportation, showing that AME(4, 6) and AME(4, 4) can achieve quantum advantage (beating classical fidelity limits) even with noise levels up to $\approx 35\%$ .

3. Key Contributions

Explicit Non-Stabilizer Circuits: The first presentation of explicit quantum circuits for non-stabilizer AME states for $n=4$ with dimensions $d=4, 6, 8$ . These states are not locally unitary (LU) equivalent to any known graph states.
Hardware-Agnostic Encoding: Development of encoding schemes that map high-dimensional qudits to existing qubit hardware (e.g., mapping $d=6$ to a qubit-qutrit pair), making experimental realization feasible on current platforms like trapped ions or superconducting circuits.
LU Invariant Distinction: The use of LU equivalence invariants (specifically $\text{Tr}[I(U)^2]$ ) to mathematically prove that the constructed non-graph states belong to distinct entanglement classes from stabilizer states.
Robustness Benchmarks: Establishment of specific fidelity thresholds and noise tolerance levels required to experimentally verify these states, providing a roadmap for near-term quantum processors.

4. Results

Circuit Construction: Successfully derived decompositions for the complex diagonal unitaries required for AME(4, 4), AME(4, 6), and AME(4, 8) using standard gate sets (Hadamard, CNOT, CZ, CCZ, and phase gates).
Entanglement Verification: Theoretical analysis confirms that the constructed states are genuinely multipartite entangled.
Noise Performance:
- AME(4, 6) is shown to be more robust to noise than GHZ states and generic random states.
- The states maintain utility for quantum teleportation protocols even with significant noise (up to 34-35% depolarization), outperforming classical limits.
Experimental Feasibility: The paper identifies trapped ions as the most promising platform for immediate implementation due to their native ability to control high-dimensional qudits (up to 7 levels), though the qubit-encoding strategies allow for testing on superconducting and photonic platforms.

5. Significance

Beyond Stabilizer Formalism: This work moves the field beyond the "easy-to-simulate" stabilizer states, pushing quantum hardware to generate and verify highly complex, non-Clifford entanglement structures.
Benchmarking Tool: These states serve as rigorous benchmarks for quantum processors. Generating them requires high gate fidelity and low noise, making them ideal for testing the limits of current and future quantum hardware.
Quantum Combinatorics: The construction links quantum information to classical combinatorial designs (specifically the "36 officers of Euler" problem), offering a physical realization of abstract mathematical solutions.
Practical Applications: By demonstrating that these states are robust enough for teleportation and error correction even in noisy environments, the paper paves the way for using high-dimensional entanglement in real-world quantum communication and computing tasks.

In conclusion, this paper bridges the gap between the theoretical existence of non-stabilizer AME states and their experimental realization, providing the necessary circuit blueprints and performance metrics to guide the next generation of high-dimensional quantum experiments.