Absolutely Maximally Entangled Research Articles

Tensor network decompositions for absolutely maximally entangled states

Absolutely maximally entangled (AME) states of k qudits (also known as perfect tensors) are quantum states that have maximal entanglement for all possible bipartitions of the sites/parties. We consider the problem of whether such states can be decomposed into a tensor network with a small number of tensors, such that all physical and all auxiliary spaces have the same dimension D. We find that certain AME states with k=6 can be decomposed into a network with only three 4-leg tensors; we provide concrete solutions for local dimension D=5 and higher. Our result implies that certain AME states with six parties can be created with only three two-site unitaries from a product state of three Bell pairs, or equivalently, with six two-site unitaries acting on a product state on six qudits. We also consider the problem for k=8, where we find similar tensor network decompositions with six 4-leg tensors.

General stabilizer approach for constructing highly entangled 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.

Experimental Single-Setting Quantum State Tomography

Quantum computers solve ever more complex tasks using steadily growing system sizes. Characterizing these quantum systems is vital, yet becoming increasingly challenging. The gold-standard is quantum state tomography (QST), capable of fully reconstructing a quantum state without prior knowledge. Measurement and classical computing costs, however, increase exponentially in the system size - a bottleneck given the scale of existing and near-term quantum devices. Here, we demonstrate a scalable and practical QST approach that uses a single measurement setting, namely symmetric informationally complete (SIC) positive operator-valued measures (POVM). We implement these nonorthogonal measurements on an ion trap device by utilizing more energy levels in each ion - without ancilla qubits. More precisely, we locally map the SIC POVM to orthogonal states embedded in a higher-dimensional system, which we read out using repeated in-sequence detections, providing full tomographic information in every shot. Combining this SIC tomography with the recently developed randomized measurement toolbox ("classical shadows") proves to be a powerful combination. SIC tomography alleviates the need for choosing measurement settings at random ("derandomization"), while classical shadows enable the estimation of arbitrary polynomial functions of the density matrix orders of magnitudes faster than standard methods. The latter enables in-depth entanglement studies, which we experimentally showcase on a 5-qubit absolutely maximally entangled (AME) state. Moreover, the fact that the full tomography information is available in every shot enables online QST in real time. We demonstrate this on an 8-qubit entangled state, as well as for fast state identification. All in all, these features single out SIC-based classical shadow estimation as a highly scalable and convenient tool for quantum state characterization.

Thirty-six Entangled Officers of Euler: Quantum Solution to a Classically Impossible Problem.

The negative solution to the famous problem of 36 officers of Euler implies that there are no two orthogonal Latin squares of order six. We show that the problem has a solution, provided the officers are entangled, and construct orthogonal quantum Latin squares of this size. As a consequence, we find an example of the long-elusive Absolutely Maximally Entangled state AME(4,6) of four subsystems with six levels each, equivalently a 2-unitary matrix of size 36, which maximizes the entangling power among all bipartite unitary gates of this dimension, or a perfect tensor with four indices, each running from one to six. This special state deserves the appellation golden AME state, as the golden ratio appears prominently in its elements. This result allows us to construct a pure nonadditive quhex quantum error detection code ((3,6,2))_{6}, which saturates the Singleton bound and allows one to encode a six-level state into a triplet of such states.

Demonstrate Absolutely Maximally Entangled of Four- and Eight-qubit States Inexistence via Simple Constraint Condition

Demonstrate Absolutely Maximally Entangled of Four- and Eight-qubit States Inexistence via Simple Constraint Condition

Planar k-uniform states: a generalization of planar maximally entangled states

Recently, Doroudiani and Karimipour [Phys. Rev. A \textbf{102} 012427(2020)] proposed the notation of planar maximally entangled (PME) states which are a wider class of multipartite entangled states than absolutely maximally entangled (AME) states. There they presented their constructions in the multipartite systems but the number of particles is restricted to be even. Here we first solve the remaining cases, i.e., constructions of planar maximally entangled states on systems with odd number of particles. In addition, we generalized the PME to the planar $k$-uniform states whose reductions to any adjacent $k$ parties along a circle of $N$ parties are maximally mixed. We presented a method to construct sets of planar $k$-uniform states which have minimal support.

Efficient Tripartite Quantum Operation Sharing with Five-Qubit Absolutely Maximally Entangled State

A tripartite quantum operation sharing protocol is proposed by utilizing a five-qubit absolutely maximally entangled (AME) state presented by Helwig et al. (Phys. Rev. A 86, 052335 (2012). The security of the proposed protocol is analyzed and ensured. The essential role of the state in this quantum task is explained. The protocol determinacy and the sharer asymmetry are identified. The experimental feasibility of the proposed protocol is discussed and confirmed. Moreover, the protocol is compared with Peng’s tripartite protocol using a six-qubit AME state [Quantum Inf Process 14, 4255 (2015)] and its distinct advantages of consuming less quantum resources, degrading the intensity of necessary operations, and owning the higher intrinsic efficiency, are revealed.

Absolutely maximally entangled states in tripartite heterogeneous systems

Absolutely maximally entangled (AME) states are closely related to quantum error correction codes. They are typically defined in homogeneous systems. However, the heterogeneous system is very common in a practical setup. In this work, we focus on the AME states in tripartite heterogeneous systems. We first introduce irreducible AME states as the basic elements to construct AME states in the systems with large local dimensions. Then, we introduce an array called magic solution array and show it is related to the AME states in the systems whose local dimensions are l, m, n with $$3\le l<m<n\le m+l-1$$ . Furthermore, we identify in which kinds of heterogeneous systems the AME states are irreducible. We also indicate some applications of our results. First, we propose a protocol to prepare a kind of tripartite heterogeneous AME states. Second, we present a method to construct k-uniform states of more parties from two AME states. In addition, we establish the connection between heterogeneous AME states and multi-isometry matrices, and apply heterogeneous AME states to realize quantum steering.

Absolutely maximally entangled states, quantum-maximum-distance-separable codes, and quantum repeaters

We extend the relation between absolutely maximally entangled (AME) states and quantum maximum distance separable (QMDS) codes by constructing whole families of QMDS codes from their parent AME states. We introduce a reduction-friendly form for the generator set of the stabilizer representation of an AME state, from which the stabilizer form for children codes, all QMDS, can be obtained. We then relate this to optimal codes for one-way quantum repeaters, by minimizing the short-term infrastructure cost as well as the long-term running cost of such quantum repeaters. We establish that AME states provide a framework for a class of QMDS codes that can be used in quantum repeaters.

Tripartite Quantum Operation Sharing with a Six-Qubit Absolutely Maximally Entangled State

A three-party scheme for sharing an arbitrary single-qubit operation on a distant target qubit is proposed by utilizing a six-qubit absolutely maximally entangled (AME) state in a given qubit distribution. The security of the proposed scheme is analyzed and ensured. The essential role which the AME state in the given qubit distribution plays in the QOS task is revealed. The important features including scheme determinacy and sharer symmetry are identified. The experimental feasibility of the proposed scheme is simply discussed and confirmed. The scheme is compared with a competing tripartite one proposed by Peng with a same six-qubit AME state but in another qubit distribution (Peng Quant. Inf. Process. 14, 4255, 2015). It is found that this scheme is also applicable and needs less necessary two-qubit operations in contrast to Peng’s.

Stochastic local operations with classical communication of absolutely maximally entangled states

Absolutely Maximally Entangled (AME) states are maximally entangled for every bipartition of the system. They are crucial resources for various quantum information protocols. We present techniques for verifying either two AME states are equivalent concerning Stochastic Local Operations and Classical Communication (SLOCC). The conjecture that for a given multipartite quantum system all AME states are SLOCC-equivalent is falsified. We also show that the existence of AME states with minimal support of 6 or more particles results in the existence of infinitely many such non-SLOCC-equivalent states. Moreover, we present AME states which are not SLOCC-equivalent to the existing AME states with minimal support.

Planar maximally entangled states

We construct a large family of Planar Maximally Entangled (PME) states which are a wider class of multi-partite entangled states than Absolutely Maximally Entangled (AME) states. These are states in which any half of the qudits are in a maximally mixed state, provided that they form a connected subset. We show that in contrast to AMEs, PMEs are easier to find and there are various PMEs for any even number of qudits. In particular, while it is known that no AME state of four qubits exists, we show that there are two distinct multi-parameter classes of four qubit PMEs. We also give explicit families of PMEs for any even number of particles and for any dimension.

Entangling power of multipartite unitary gates

We study the entangling properties of multipartite unitary gates with respect to the measure of entanglement called one-tangle. Putting special emphasis on the case of three parties, we derive an analytical expression for the entangling power of an n-partite gate as an explicit function of the gate, linking the entangling power of gates acting on the n-partite Hilbert space of dimension to the entanglement of pure states in the Hilbert space of dimension . Furthermore, we evaluate its mean value averaged over the unitary and orthogonal groups, analyze the maximal entangling power and relate it to the absolutely maximally entangled (AME) states of a system with 2n parties. Finally, we provide a detailed analysis of the entangling properties of the three-qubit unitary and orthogonal gates.

Modifying Method of Constructing Quantum Codes From Highly Entangled States

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.

On the Existence of Absolutely Maximally Entangled States of Minimal Support II

On the Existence of Absolutely Maximally Entangled States of Minimal Support II

Absolutely maximally entangled states from phase states

We derive absolutely maximally entangled (AME) states from phase states for a multi-qudit system whose dynamics is governed by a two-qudit interaction Hamiltonian of Heisenberg type. AME states are characterized by being maximally entangled for all bipartitions of the multi-qudit system and present absolute multipartite entanglement. The key ingredient of this approach is the theory of phase states for finite-dimensional systems (qudits). We define further the unitary phase operators of [Formula: see text]-qudit systems and we give next the corresponding separable phase states. Using a qudit–qudit Hamiltonian acting as entangling operator on separable phase states, we generate entangled phase states. Finally, from the labeled entangled phase states, we derive the absolutely maximally entangled states.

Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity

A pure multipartite quantum state is called absolutely maximally entangled (AME), if all reductions obtained by tracing out at least half of its parties are maximally mixed. Maximal entanglement is then present across every bipartition. The existence of such states is in many cases unclear. With the help of the weight enumerator machinery known from quantum error correction and the shadow inequalities, we obtain new bounds on the existence of AME states in dimensions larger than two. To complete the treatment on the weight enumerator machinery, the quantum MacWilliams identity is derived in the Bloch representation. Finally, we consider AME states whose subsystems have different local dimensions, and present an example for a system that shows maximal entanglement across every bipartition.

A note on the Bloch representation of absolutely maximally entangled states

The absolutely maximally entangled (AME) states play key roles in quantum information processing. We provide an explicit expression of the generalized Bloch representation of AME states for general dimension $d$ of individual subsystems and arbitrary number of partite $n$. Based on this analytic formula, we prove that the trace of the squared support for any given weight is given by the so-called hyper-geometric function and is irrelevant with the choices of the subsystems. The optimal point for the existence of AME states is obtained.

Optimal quantum error correcting codes from absolutely maximally entangled 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 n parties with local dimension a power of a prime for all . 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 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 for n even with the highest distance allowed by the quantum Singleton bound.

Absolutely Maximally Entangled States of Seven Qubits Do Not Exist.

Pure multiparticle quantum states are called absolutely maximally entangled if all reduced states obtained by tracing out at least half of the particles are maximally mixed. We provide a method to characterize these states for a general multiparticle system. With that, we prove that a seven-qubit state whose three-body marginals are all maximally mixed, or equivalently, a pure ((7,1,4))_{2} quantum error correcting code, does not exist. Furthermore, we obtain an upper limit on the possible number of maximally mixed three-body marginals and identify the state saturating the bound. This solves the seven-particle problem as the last open case concerning maximally entangled states of qubits.