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

General stabilizer approach for constructing highly entangled graph states

Zahra Raissi, Adam Burchardt, Edwin Barnes

Published Dec 19, 2022• 16 citations
arXivHTMLPDF

Abstract

Highly entangled multipartite states such as $k$-uniform ($k$-UNI) and absolutely maximally entangled (AME) states serve as critical resources in quantum networking and other quantum information applications. However, there does not yet exist a complete classification of such states, and much remains unknown about their entanglement structure. Here we substantially broaden the class of known $k$-UNI and AME states by introducing a method for explicitly constructing such states that combines classical error correcting codes and qudit graph states. This method in fact constitutes a general recipe for obtaining multipartitite entangled states from classical codes. Furthermore, we show that at least for a large subset of the class of $k$-UNI states that we present, the states are inequivalent under stochastic local operations and classical communication. This subset is defined by an iterative procedure for constructing a hierarchy of $k$-UNI graph states.

DOI
10.1103/physreva.106.062424

Related papers

General stabilizer approach for constructing highly entangled graph states

Zahra Raissi, Adam Burchardt, Edwin Barnes

We uncover a large class of graph states that are maximally multipartite entangled. At least some of these are inequivalent under stochastic-local-operations and classical communication, as we show explicitly for a certain hierarchical subset.

Quantum 2.0 Conference and Exhibition•Jan 1, 2022•0 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

Modifying Method of Constructing Quantum Codes From Highly Entangled States

Zahra Raissi

There is a connection between classical codes, highly entangled pure states (called$k$-uniform or absolutely maximally entangled (AME) states), and quantum error correcting codes (QECCs). This leads to a systematic method to construct stabilizer QECCs by starting from a$k$-uniform state or the corresponding classical code and tracing out one party at each step. We provide explicit constructions for codewords, encoding procedure and stabilizer formalism of the QECCs by describing the changes that partial traces cause on the corresponding generator matrix of the classical codes. We then modify the method to produce another set of stabilizer QECCs that encode a logical qudit into a subspace spanned by AME states. This construction produces quantum codes starting from an AME state without tracing out any party. Therefore, quantum stabilizer codes with larger codespace can be constructed.

arXiv:2005.01426•IEEE Access•Jan 1, 2020•12 citations

On Non-Existence of Absolutely Maximally Entangled Canonical Graph States in Even Local Dimensions

Jakub Wójcik, Owidiusz Makuta, Wojciech Bruzda +1 more

We demonstrate that absolutely maximally entangled (AME) states consisting of $N=4n$ qudits with $n\in\{1,2,3,\ldots\}$, each of even local dimension $d$, cannot be realized as canonical graph states over the ring $\mathbb{Z}_d$. This result imposes strong constraints on AME states in composite local dimensions and characterizes the limitations of graph-state constructions for highly entangled multipartite quantum systems. Furthermore, for $d\equiv 2\pmod 4$ this obstruction, combined with the prime-power decomposition of stabilizer states, excludes all pure stabilizer AME states (including four quhexes), while clarifying the distinction between canonical $\mathbb{Z}_{d}$ graph states and stabilizer constructions over prime-power factors. We also discuss a composite construction of mixed $k$-uniform states. For $(N,d)=(4,6)$, the construction yields a rank-two mixed $2$-uniform stabilizer state of purity $1/2$, which is optimal among normalized stabilizer projectors.

quant-pharXiv:2603.18193•Mar 20, 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

Quantum circuits for high-dimensional absolutely maximally entangled states

Berta Casas, Grzegorz Rajchel-Mieldzioć, Suhail Ahmad Rather +4 more

Abstract Absolutely maximally entangled (AME) states of multipartite quantum systems exhibit maximal entanglement across all possible bipartitions. These states lead to teleportation protocols that surpass standard teleportation schemes, determine quantum error correction codes and can be used to test performance of current term quantum processors. Several AME states can be constructed from graph states using minimal quantum resources. However, there exist other constructions that depart from the stabilizer formalism. In this work, we present explicit quantum circuits to generate exemplary non-stabilizer AME states of four subsystems with four, six, and eight levels each and analyze their capabilities to perform quantum information tasks.

arXiv:2504.05394•Quantum Science and Technology•Feb 17, 2026•2 citations
Highly entangled multipartite states such as kkk-uniform (kkk-UNI) and absolutely maximally entangled (AME) states serve as critical resources in quantum networking and other quantum information applications. However, there does not yet exist a complete classification of such states, and much remains unknown about their entanglement structure. Here we substantially broaden the class of known kkk-UNI and AME states by introducing a method for explicitly constructing such states that combines classical error correcting codes and qudit graph states. This method in fact constitutes a general recipe for obtaining multipartitite entangled states from classical codes. Furthermore, we show that at least for a large subset of the class of kkk-UNI states that we present, the states are inequivalent under stochastic local operations and classical communication. This subset is defined by an iterative procedure for constructing a hierarchy of kkk-UNI graph states.
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.
There is a connection between classical codes, highly entangled pure states (calledkkk-uniform or absolutely maximally entangled (AME) states), and quantum error correcting codes (QECCs). This leads to a systematic method to construct stabilizer QECCs by starting from akkk-uniform state or the corresponding classical code and tracing out one party at each step. We provide explicit constructions for codewords, encoding procedure and stabilizer formalism of the QECCs by describing the changes that partial traces cause on the corresponding generator matrix of the classical codes. We then modify the method to produce another set of stabilizer QECCs that encode a logical qudit into a subspace spanned by AME states. This construction produces quantum codes starting from an AME state without tracing out any party. Therefore, quantum stabilizer codes with larger codespace can be constructed.
We demonstrate that absolutely maximally entangled (AME) states consisting of N=4nN=4nN=4n qudits with n∈{1,2,3,…}n\in\{1,2,3,\ldots\}n∈{1,2,3,…}, each of even local dimension ddd, cannot be realized as canonical graph states over the ring Zd\mathbb{Z}_dZd​. This result imposes strong constraints on AME states in composite local dimensions and characterizes the limitations of graph-state constructions for highly entangled multipartite quantum systems. Furthermore, for d≡2(mod4)d\equiv 2\pmod 4d≡2(mod4) this obstruction, combined with the prime-power decomposition of stabilizer states, excludes all pure stabilizer AME states (including four quhexes), while clarifying the distinction between canonical Zd\mathbb{Z}_{d}Zd​ graph states and stabilizer constructions over prime-power factors. We also discuss a composite construction of mixed kkk-uniform states. For (N,d)=(4,6)(N,d)=(4,6)(N,d)=(4,6), the construction yields a rank-two mixed 222-uniform stabilizer state of purity 1/21/21/2, which is optimal among normalized stabilizer projectors.
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.
Abstract Absolutely maximally entangled (AME) states of multipartite quantum systems exhibit maximal entanglement across all possible bipartitions. These states lead to teleportation protocols that surpass standard teleportation schemes, determine quantum error correction codes and can be used to test performance of current term quantum processors. Several AME states can be constructed from graph states using minimal quantum resources. However, there exist other constructions that depart from the stabilizer formalism. In this work, we present explicit quantum circuits to generate exemplary non-stabilizer AME states of four subsystems with four, six, and eight levels each and analyze their capabilities to perform quantum information tasks.