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:1306.2879

Absolutely Maximally Entangled Qudit Graph States

Wolfram Helwig

Published Jun 12, 2013• 42 citations
arXivHTMLPDF

Abstract

Absolutely maximally entangled (AME) states are multipartite entangled states that are maximally entangled for any possible bipartition. In this paper, we study the description of AME states within the graph state formalism. The graphical representation provides an intuitive framework to visualize the entanglement in graph states, which makes them a natural candidate to describe AME states. We show two different methods of determining bipartite entanglement in graph states and use them to define various AME graph states. We further show that AME graph states exist for all number of parties, and that any AME graph states shared between an even number of parties can be used to describe quantum secret sharing schemes with a threshold or ramp access structure directly within the graph states formalism.

DOI
10.48550/arxiv.1306.2879

Related papers

Absolutely Maximally Entangled States: Existence and Applications

Wolfram Helwig, Wei Cui

We investigate absolutely maximally entangled (AME) states, which are multipartite quantum states that are maximally entangled with respect to any possible bipartition. These strong entanglement properties make them a powerful resource for a variety of quantum information protocols. In this paper, we show the existence of AME states for any number of parties, given that the dimension of the involved systems is chosen appropriately. We prove the equivalence of AME states shared between an even number of parties and pure state threshold quantum secret sharing (QSS) schemes, and prove necessary and sufficient entanglement properties for a wider class of ramp QSS schemes. We further show how AME states can be used as a valuable resource for open-destination teleportation protocols and to what extend entanglement swapping generalizes to AME states.

arXiv:1306.2536•Jun 11, 2013•39 citations

Absolute maximal entanglement and quantum secret sharing

Wolfram Helwig, Wei Cui, José Ignacio Latorre +2 more

We study the existence of absolutely maximally entangled (AME) states in quantum mechanics and its applications to quantum information. AME states are characterized by being maximally entangled for all bipartitions of the system and exhibit genuine multipartite entanglement. With such states, we present a parallel teleportation protocol which teleports multiple quantum states between groups of senders and receivers. The notable features of this protocol are that (i) the partition into senders and receivers can be chosen after the state has been distributed, and (ii) one group has to perform joint quantum operations while the parties of the other group only have to act locally on their system. We also prove the equivalence between pure state quantum secret sharing schemes and AME states with an even number of parties.

arXiv:1204.2289•Physical Review A•Nov 29, 2012•241 citations

Absolutely maximally entangled states, combinatorial designs, and multiunitary matrices

Dardo Goyeneche, Daniel Arriscado Alsina, José Ignacio Latorre +2 more

Absolutely maximally entangled (AME) states are those multipartite quantum states that carry absolute maximum entanglement in all possible bipartitions. AME states are known to play a relevant role in multipartite teleportation, in quantum secret sharing, and they provide the basis novel tensor networks related to holography. We present alternative constructions of AME states and show their link with combinatorial designs. We also analyze a key property of AME states, namely, their relation to tensors, which can be understood as unitary transformations in all of their bipartitions. We call this property multiunitarity.

arXiv:1506.08857•Physical Review A•Sep 15, 2015•164 citations

Majority-Agreed Key Distribution using Absolutely Maximally Entangled Stabilizer States

Sowrabh Sudevan, Ramij Rahaman, Sourin Das

In [Phys. Rev. A 77, 060304(R),(2008)], Facchi et al. introduced absolutely maximally entangled (AME) states and also suggested ``majority-agreed key distribution"(MAKD) as a possible application for such states. In MAKD, the qubits of an AME state are distributed one each to many spatially separated parties. AME property makes it necessary that quantum key distribution(QKD) between any two parties can only be performed with the cooperation of a majority of parties. Our contributions to MAKD are, $(1)$ We recognize that stabilizer structure of the shared state is a useful addition to MAKD and prove that the cooperation of any majority of parties(including the two communicants) is necessary and sufficient for QKD between any two parties sharing AME stabilizer states. Considering the rarity of qubit AME states, we extended this result to the qudit case. $(2)$ We generalize to shared graph states that are not necessarily AME. We show that the stabilizer structure of graph states allows for QKD between any inseparable bipartition of qubits. Inseparability in graph states is visually apparent in the connectivity of its underlying mathematical graph. We exploit this connectivity to demonstrate conference keys and multiple independent keys per shared state. Recent experimental and theoretical progress in graph state preparation and self-testing make these protocols feasible in the near future.

arXiv:2411.15545•Nov 23, 2024•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

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
Absolutely maximally entangled (AME) states are multipartite entangled states that are maximally entangled for any possible bipartition. In this paper, we study the description of AME states within the graph state formalism. The graphical representation provides an intuitive framework to visualize the entanglement in graph states, which makes them a natural candidate to describe AME states. We show two different methods of determining bipartite entanglement in graph states and use them to define various AME graph states. We further show that AME graph states exist for all number of parties, and that any AME graph states shared between an even number of parties can be used to describe quantum secret sharing schemes with a threshold or ramp access structure directly within the graph states formalism.
We investigate absolutely maximally entangled (AME) states, which are multipartite quantum states that are maximally entangled with respect to any possible bipartition. These strong entanglement properties make them a powerful resource for a variety of quantum information protocols. In this paper, we show the existence of AME states for any number of parties, given that the dimension of the involved systems is chosen appropriately. We prove the equivalence of AME states shared between an even number of parties and pure state threshold quantum secret sharing (QSS) schemes, and prove necessary and sufficient entanglement properties for a wider class of ramp QSS schemes. We further show how AME states can be used as a valuable resource for open-destination teleportation protocols and to what extend entanglement swapping generalizes to AME states.
We study the existence of absolutely maximally entangled (AME) states in quantum mechanics and its applications to quantum information. AME states are characterized by being maximally entangled for all bipartitions of the system and exhibit genuine multipartite entanglement. With such states, we present a parallel teleportation protocol which teleports multiple quantum states between groups of senders and receivers. The notable features of this protocol are that (i) the partition into senders and receivers can be chosen after the state has been distributed, and (ii) one group has to perform joint quantum operations while the parties of the other group only have to act locally on their system. We also prove the equivalence between pure state quantum secret sharing schemes and AME states with an even number of parties.
Absolutely maximally entangled (AME) states are those multipartite quantum states that carry absolute maximum entanglement in all possible bipartitions. AME states are known to play a relevant role in multipartite teleportation, in quantum secret sharing, and they provide the basis novel tensor networks related to holography. We present alternative constructions of AME states and show their link with combinatorial designs. We also analyze a key property of AME states, namely, their relation to tensors, which can be understood as unitary transformations in all of their bipartitions. We call this property multiunitarity.
In [Phys. Rev. A 77, 060304(R),(2008)], Facchi et al. introduced absolutely maximally entangled (AME) states and also suggested ``majority-agreed key distribution"(MAKD) as a possible application for such states. In MAKD, the qubits of an AME state are distributed one each to many spatially separated parties. AME property makes it necessary that quantum key distribution(QKD) between any two parties can only be performed with the cooperation of a majority of parties. Our contributions to MAKD are, (1)(1)(1) We recognize that stabilizer structure of the shared state is a useful addition to MAKD and prove that the cooperation of any majority of parties(including the two communicants) is necessary and sufficient for QKD between any two parties sharing AME stabilizer states. Considering the rarity of qubit AME states, we extended this result to the qudit case. (2)(2)(2) We generalize to shared graph states that are not necessarily AME. We show that the stabilizer structure of graph states allows for QKD between any inseparable bipartition of qubits. Inseparability in graph states is visually apparent in the connectivity of its underlying mathematical graph. We exploit this connectivity to demonstrate conference keys and multiple independent keys per shared state. Recent experimental and theoretical progress in graph state preparation and self-testing make these protocols feasible in the near future.
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 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.