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

General stabilizer approach for constructing highly entangled graph states

Zahra Raissi, Adam Burchardt, Edwin Barnes

Published Nov 15, 2021• 1 citation
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 this new class of k-UNI states, 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, Barnes, E. (Edwin)

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.

•Dec 19, 2022•12 citations

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

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•0 citations

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

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•1 citation

Quantum Hypergraph States: A Review

Davide Poderini, Dagmar Bruß, Chiara Macchiavello

Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite entanglement. In this review, we provide a compact overview of the formal structure, entanglement characteristics, and operational relevance of hypergraph states in quantum information theory. We begin by introducing their mathematical foundations and generalizations of the stabilizer formalism. A central focus is placed on their entanglement properties, including the classification under local unitary (LU) and stochastic local operations with classical communication (SLOCC), the quantification of multipartite entanglement, and detection techniques via entanglement witnesses. We also explore other nonclassical features of hypergraph states, such as contextuality and genuine multipartite nonlocality, derived from stabilizer-based Bell-type inequalities. Additional attention is given to the role of hypergraph states in error correction, and as a computational resource in measurement-based quantum computation (MBQC), and to their non-stabilizer character - quantified via resource-theoretic measures of quantum magic. Finally we review their generalization to higher dimensions, i.e. to qudits and continuous variables.

quant-pharXiv:2603.10917•Mar 12, 2026•0 citations
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 this new class of k-UNI states, 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.
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.
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.
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.
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.
Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite entanglement. In this review, we provide a compact overview of the formal structure, entanglement characteristics, and operational relevance of hypergraph states in quantum information theory. We begin by introducing their mathematical foundations and generalizations of the stabilizer formalism. A central focus is placed on their entanglement properties, including the classification under local unitary (LU) and stochastic local operations with classical communication (SLOCC), the quantification of multipartite entanglement, and detection techniques via entanglement witnesses. We also explore other nonclassical features of hypergraph states, such as contextuality and genuine multipartite nonlocality, derived from stabilizer-based Bell-type inequalities. Additional attention is given to the role of hypergraph states in error correction, and as a computational resource in measurement-based quantum computation (MBQC), and to their non-stabilizer character - quantified via resource-theoretic measures of quantum magic. Finally we review their generalization to higher dimensions, i.e. to qudits and continuous variables.