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

Quantum circuits for maximally entangled states

Alba Cervera-Lierta, José Ignacio Latorre, Dardo Goyeneche

Published Aug 30, 2019• 47 citations
arXivHTMLPDF

Abstract

We design a series of quantum circuits that generate absolute maximally entangled (AME) states to benchmark a quantum computer. A relation between graph states and AME states can be exploited to optimize the structure of the circuits and minimize their depth. Furthermore, we find that most of the provided circuits obey majorization relations for every partition of the system and every step of the algorithm. The main goal of the work consists in testing efficiency of quantum computers when requiring the maximal amount of genuine multipartite entanglement allowed by quantum mechanics, which can be used to efficiently implement multipartite quantum protocols.

DOI
10.1103/physreva.100.022342

Related papers

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

Minimal decomposition entropy and optimal representations of absolutely maximally entangled states

N Ramadas

Understanding and classifying multipartite entanglement is fundamental to quantum information processing. This work focuses on absolutely maximally entangled (AME) states, a class of highly entangled states characterized by their maximal entanglement across any bipartitions. To analyze and classify AME states, we employ the minimal decomposition entropy, defined as the minimum Rényi entropy $S_q$ associated with the state's decomposition over all local product bases. This quantity identifies the product bases in which the state is maximally localized, thereby yielding optimal representations for analyzing properties of AME states. We develop an efficient algorithm for computing the minimal decomposition entropy for finite $q>1$ and compare AME and Haar-random states for \( q = 2 \) and \( q = \infty \) in qubit, qutrit, and ququad systems. For \( q = 2 \), AME states of four qutrits and ququads show lower minimal entropy than generic states, indicating sparser optimal forms. For \( q = \infty \) -- related to the geometric measure of entanglement -- AME states exhibit higher entanglement. The algorithm also simplifies known AME states into sparser representations, aiding in distinguishing genuinely quantum AME states from those constructible from classical combinatorial designs. Our results advance the classification of AME states and demonstrate the utility of minimal decomposition entropy as both a local unitary invariant and a tool for state simplification.

quant-pharXiv:2512.02749•Physical Review A•Dec 3, 2025•2 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 Qudit Graph States

Wolfram Helwig

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.

arXiv:1306.2879•Jun 12, 2013•111 citations

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•88 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
We design a series of quantum circuits that generate absolute maximally entangled (AME) states to benchmark a quantum computer. A relation between graph states and AME states can be exploited to optimize the structure of the circuits and minimize their depth. Furthermore, we find that most of the provided circuits obey majorization relations for every partition of the system and every step of the algorithm. The main goal of the work consists in testing efficiency of quantum computers when requiring the maximal amount of genuine multipartite entanglement allowed by quantum mechanics, which can be used to efficiently implement multipartite quantum protocols.
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.
Understanding and classifying multipartite entanglement is fundamental to quantum information processing. This work focuses on absolutely maximally entangled (AME) states, a class of highly entangled states characterized by their maximal entanglement across any bipartitions. To analyze and classify AME states, we employ the minimal decomposition entropy, defined as the minimum Rényi entropy SqS_qSq​ associated with the state's decomposition over all local product bases. This quantity identifies the product bases in which the state is maximally localized, thereby yielding optimal representations for analyzing properties of AME states. We develop an efficient algorithm for computing the minimal decomposition entropy for finite q>1q>1q>1 and compare AME and Haar-random states for q=2 q = 2 q=2 and q=∞ q = \infty q=∞ in qubit, qutrit, and ququad systems. For q=2 q = 2 q=2, AME states of four qutrits and ququads show lower minimal entropy than generic states, indicating sparser optimal forms. For q=∞ q = \infty q=∞ -- related to the geometric measure of entanglement -- AME states exhibit higher entanglement. The algorithm also simplifies known AME states into sparser representations, aiding in distinguishing genuinely quantum AME states from those constructible from classical combinatorial designs. Our results advance the classification of AME states and demonstrate the utility of minimal decomposition entropy as both a local unitary invariant and a tool for state simplification.
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 (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.
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.