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:2510.17231 · Physical Review A

Error-correcting codes and absolutely maximally entangled states for mixed-dimensional Hilbert spaces

Simeon Ball, Raven Zhang

Published Dec 23, 2025• 3 citations
arXivHTMLPDF

Abstract

A major difficulty in quantum computation is the ability to implement fault tolerant computations, protecting information against undesired interactions with the environment. Stabiliser codes were introduced as a means to protect information when storing or applying computations in Hilbert spaces where the local dimension is fixed, i.e. in Hilbert spaces of the form $({\mathbb C}^D)^{\otimes n}$. If $D$ is a prime power then one can consider stabiliser codes over finite fields \cite{KKKS2006}, which allows a deeper mathematical structure to be used to develop stabiliser codes. However, there is no practical reason that the subsystems should have the same local dimension and in this article we introduce a stabiliser formalism for mixed dimensional Hilbert spaces, i.e. of the form ${\mathbb C}^{D_1} \otimes \cdots \otimes {\mathbb C}^{D_n}$. More generally, we define and prove a Singleton bound for quantum error-correcting codes of mixed dimensional Hilbert spaces. We redefine entanglement measures for these Hilbert spaces and follow \cite{HESG2018} and define absolutely maximally entangled states as states which maximise this entanglement measure. We provide examples of absolutely maximally entangled states in spaces of dimensions not previously known to have absolutely maximally entangled states.

DOI
10.1103/yqck-92fb

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

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

Absolutely Maximally Entangled States of $2q$ Parties in Every Odd Prime-Power Dimension $q$

Mykhailo Hontarenko, Karol Życzkowski

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=p^e\ge3$, we construct a stabilizer $\mathrm{AME}(2q,q)$ state whose normalized one-party projection yields a stabilizer $\mathrm{AME}(2q-1,q)$ state. A closed-form $q\times q$ bordered-circulant matrix $A_q$ over $\mathbb{F}_{q^2}$ generates a Hermitian self-dual maximum distance separable (MDS) code $[2q,q,q+1]_{q^2}$, which lies outside the extended Reed-Solomon classes. In suitable bases, the amplitude tensors define normalized $q$-unitary complex Hadamard matrices of order $q^q$ with $p$th-root phases. Additional constructions yield $\mathrm{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.

quant-pharXiv:2609.11796•Sep 11, 2026•1 citation

Constructions of k-Uniform States in Heterogeneous Systems

Keqin Feng, Lingfei Jin, Chaoping Xing +1 more

A pure quantum state of$n$parties associated with the Hilbert space$\mathbb {C}^{d_{1}}\otimes \mathbb {C} ^{d_{2}}\otimes \cdots \otimes \mathbb {C} ^{d_{n}}$is called$k$-uniform if all the reductions to$k$-parties are maximally mixed. The$n$partite system is called homogenous if the local dimensions$d_{1}=d_{2}=\cdots =d_{n}$, 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$H$meeting the condition that$H_{A\times \bar {A}}+H^{T}_{\bar {A}\times A}$has full rank for any row index set$A$of 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.

arXiv:2305.12769•IEEE Transactions on Information Theory•Jun 2, 2023•4 citations

Stabilizer Codes and Quantum Error Correction

Daniel Gottesman

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.

arXiv:quant-ph/9705052•May 28, 1997•2,856 citations
A major difficulty in quantum computation is the ability to implement fault tolerant computations, protecting information against undesired interactions with the environment. Stabiliser codes were introduced as a means to protect information when storing or applying computations in Hilbert spaces where the local dimension is fixed, i.e. in Hilbert spaces of the form (CD)⊗n({\mathbb C}^D)^{\otimes n}(CD)⊗n. If DDD is a prime power then one can consider stabiliser codes over finite fields \cite{KKKS2006}, which allows a deeper mathematical structure to be used to develop stabiliser codes. However, there is no practical reason that the subsystems should have the same local dimension and in this article we introduce a stabiliser formalism for mixed dimensional Hilbert spaces, i.e. of the form CD1⊗⋯⊗CDn{\mathbb C}^{D_1} \otimes \cdots \otimes {\mathbb C}^{D_n}CD1​⊗⋯⊗CDn​. More generally, we define and prove a Singleton bound for quantum error-correcting codes of mixed dimensional Hilbert spaces. We redefine entanglement measures for these Hilbert spaces and follow \cite{HESG2018} and define absolutely maximally entangled states as states which maximise this entanglement measure. We provide examples of absolutely maximally entangled states in spaces of dimensions not previously known to have absolutely maximally entangled states.
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 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.
Absolutely Maximally Entangled States of 2q2q2q Parties in Every Odd Prime-Power Dimension qqq
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≥3q=p^e\ge3q=pe≥3, we construct a stabilizer AME(2q,q)\mathrm{AME}(2q,q)AME(2q,q) state whose normalized one-party projection yields a stabilizer AME(2q−1,q)\mathrm{AME}(2q-1,q)AME(2q−1,q) state. A closed-form q×qq\times qq×q bordered-circulant matrix AqA_qAq​ over Fq2\mathbb{F}_{q^2}Fq2​ generates a Hermitian self-dual maximum distance separable (MDS) code [2q,q,q+1]q2[2q,q,q+1]_{q^2}[2q,q,q+1]q2​, which lies outside the extended Reed-Solomon classes. In suitable bases, the amplitude tensors define normalized qqq-unitary complex Hadamard matrices of order qqq^qqq with pppth-root phases. Additional constructions yield AME(q+3,q)\mathrm{AME}(q+3,q)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 ofnnnparties associated with the Hilbert spaceCd1⊗Cd2⊗⋯⊗Cdn\mathbb {C}^{d_{1}}\otimes \mathbb {C} ^{d_{2}}\otimes \cdots \otimes \mathbb {C} ^{d_{n}}Cd1​⊗Cd2​⊗⋯⊗Cdn​is calledkkk-uniform if all the reductions tokkk-parties are maximally mixed. Thennnpartite system is called homogenous if the local dimensionsd1=d2=⋯=dnd_{1}=d_{2}=\cdots =d_{n}d1​=d2​=⋯=dn​, while it is called heterogeneous if the local dimensions are not all equal.kkk-uniform sates play an important role in quantum information theory. There are much progress in characterizing and constructingkkk-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 thekkk-uniform states in heterogeneous systems fork>3k>3k>3. We present two general methods to constructkkk-uniform states in the heterogeneous systems for generalkkk. 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 newkkk-uniform states such that the local dimension of each subsystem can be a prime power. The second construction is derived from a matrixHHHmeeting the condition thatHA×Aˉ+HAˉ×ATH_{A\times \bar {A}}+H^{T}_{\bar {A}\times A}HA×Aˉ​+HAˉ×AT​has full rank for any row index setAAAof sizekkk. 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 integerkkk, one can constructkkk-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.