Absolutely maximally entangled (AME) states are typically defined in homogeneous systems. However, the quantum system is more likely to be heterogeneous in a practical setup. In this work we pay attention to the construction of AME states in tripartite heterogeneous systems. We first introduce the concept of irreducible AME states as the basic elements to construct AME states with high local dimensions. Then we investigate the tripartite heterogeneous systems whose local dimensions are $l,m,n$, with $3\leq l<m<n\leq m+l-1$. We show the existence of AME states in such heterogeneous systems is related to a kind of arrays called magic solution array. We further identify the AME states in which kinds of heterogeneous systems are irreducible. In addition, we propose a method to construct $k$-uniform states of more parties using two existing AME states. We also build the connection between heterogeneous AME states and multi-isometry matrices, and indicate an application in quantum steering.
We develop a new technique to construct mutually unbiased tripartite absolutely maximally entangled bases. We first explore the tripartite absolutely maximally entangled bases and mutually unbiased bases in $\mathbb{C}^{d} \otimes \mathbb{C}^{d} \otimes \mathbb{C}^{d}$ based on mutually orthogonal Latin squares. Then we generalize the approach to the case of $\mathbb{C}^{d_{1}} \otimes \mathbb{C}^{d_{2}} \otimes \mathbb{C}^{d_{1}d_{2}}$ by mutually weak orthogonal Latin squares. The concise direct constructions of mutually unbiased tripartite absolutely maximally entangled bases are remarkably…
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…
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.
For every stabiliser $N$-qudit absolutely maximally entangled state, we present a method for determining the stabiliser generators and logical operators of a corresponding quantum error correction code. These codes encode $k$ qudits into $N-k$ qudits, with $k\leq \left \lfloor{N/2} \right \rfloor$, where the local dimension $d$ is prime. We use these methods to analyse the concatenation of such quantum codes and link this procedure to entanglement swapping. Using our techniques, we investigate the spread of quantum information on a tensor network code formerly used as a toy model for the AdS/C…
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 state…
Pure multipartite quantum states of n parties and local dimension q are called k-uniform if all reductions to k parties are maximally mixed. These states are relevant for our understanding of multipartite entanglement, quantum information protocols, and the construction of quantum error correction codes. To our knowledge, the only known systematic construction of these quantum states is based on classical error correction codes. We present a systematic method to construct other examples of k-uniform states and show that the states derived through our construction are not equivalent to any k-un…
Absolutely maximally entangled, AME, states are pure multipartite states that give rise to the maximally mixed states when half or more of the parties are traced out. AME states find applications in fields like teleportation or quantum secret sharing, and the problem of finding conditions on their existence has been considered in a number of papers. We consider here AME states of minimal support, that are simpler to analyse. An equivalence with coding theory gives a sufficient condition for their existence, that the number of sites be equal to the local dimension plus one, when the local dimen…
Quantum Circuits for High-Dimensional Absolutely Maximally Entangled States
Barcelona Supercomputing Center（巴塞罗那超级计算中心）；Universitat de Barcelona（巴塞罗那大学）；BEIT；Max Planck Institute for the Physics of Complex Systems（马克斯·普朗克复杂系统物理研究所）；ICFO-Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology（ICFO-光子科学研究所，巴塞罗那科学技术研究院）；Center for Theoretical Physics, Polish Academy of Sciences（波兰科学院理论物理中心）；Institute of Theoretical Physics, Jagiellonian University（雅盖隆大学理论物理研究所）
Absolutely maximally entangled pure states of multipartite quantum systems
BEIT sp. z o.o.（BEIT有限责任公司）；Jagiellonian University（雅盖隆大学）；Universität Siegen（锡根大学）；Indian Institute of Technology Madras（马德拉斯印度理工学院）；Polish Academy of Sciences（波兰科学院）
Self-testing refers to a method with which a classical user can certify the state and measurements of quantum systems in a device-independent way. Especially, the self-testing of entangled states is of great importance in quantum information process. A comprehensible example is that violating the CHSH inequality maximally necessarily implies the bipartite shares a singlet. One essential question in self-testing is that, when one observes a non-maximum violation, how close is the tested state to the target state (which maximally violates certain Bell inequality)? The answer to this question des…
Complete Existence Classification of Seven-Partite Absolutely Maximally Entangled States
School of Computer Science and Engineering, Sun Yat-sen University（中山大学计算机学院）；School of Mathematical Sciences, University of Science and Technology of China（中国科学技术大学数学科学学院）；Hefei National Laboratory, University of Science and Technology of China（中国科学技术大学合肥国家实验室）；QICI Quantum Information and Computation Initiative, School of Computing and Data Science, The University of Hong Kong（香港大学计算与数据科学学院量子信息与计算倡议）
Self-interactions and interaction with the environment tend to push quantum systems toward states of maximal entanglement. This is a definition of decoherence. We argue that these maximally entangled states fall into the well-defined classes that can be uniquely described by the values of certain entanglement invariants. After discussing these ideas we present examples of maximally entangled states for a number of generic systems, construct compact states in the most entangled classes for tripartite systems, and suggest how they may be constructed for other $n$-partite systems. We study random…
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 generalized 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 d…
Device-independent certification of tripartite quantum networks with bilocal Bell inequalities
Center for Quantum-Enabled Computing, Center for Theoretical Physics, Polish Academy of Sciences（波兰科学院理论与量子计算中心）；Institute of Theoretical Physics, University of Warsaw（华沙大学理论物理研究所）
We present a generalized criterion for maximally entangled nine-qubit states, whose minimum averaged subsystem purity should be equal to 1/14. In this note, we prove that absolutely maximally entangled state for nine qubits does not exist. Further, we construct a new genuine nine-qubit maximally entangled states of 110,15 and 1 balanced purities equal to 1/16, , 1/8 and and 1/4, respectively. We found that, the marginal density matrices for subsystems of 1,2,3- qubits all completely mixed in these states, therefore, maximally entangled nine-qubit state is a 3-uniform state.
We embarked upon the task of experimental protection of different classes of tripartite entangled states, namely the maximally entangled GHZ and W states and the ${\rm W \bar{W}}$ state, using dynamical decoupling. The states were created on a three-qubit NMR quantum information processor and allowed to evolve in the naturally noisy NMR environment. Tripartite entanglement was monitored at each time instant during state evolution, using negativity as an entanglement measure. It was found that the W state is most robust while the GHZ-type states are most fragile against the natural decoherence …
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 fami…
