Related papers: Tensor network decompositions for absolutely maxim…
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…
Multipartite entanglement is one of the hallmarks of quantum mechanics and is central to quantum information processing. In this work we show that Concentratable Entanglement (CE), an operationally motivated entanglement measure, induces a…
We introduce a protocol to classify three-qubit pure states into different entanglement classes and implement it on an NMR quantum processor. The protocol is designed in such a way that the experiments performed to classify the states can…
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…
The notion of entanglement of quantum states is usually defined with respect to a fixed bipartition. Indeed, a global basis change can always map an entangled state to a separable one. The situation is however different when considering a…
I generalize the concept of balancedness to qudits with arbitrary dimension $d$. It is an extension of the concept of balancedness in New J. Phys. {\bf 12}, 075025 (2010) [1]. At first, I define maximally entangled states as being the…
Entanglement is a resource in quantum information theory when state manipulation is restricted to Local Operations assisted by Classical Communication (LOCC). It is therefore of paramount importance to decide which LOCC transformations are…
Tensor network algorithms have proven to be very powerful tools for studying one- and two-dimensional quantum many-body systems. However, their application to three-dimensional (3D) quantum systems has so far been limited, mostly because…
Tensor networks are generated by a set of small rank tensors and define many-body quantum states in a succinct form. The corresponding map is not one-to-one: different sets of tensors may generate the very same state. A fundamental question…
We discuss the construction of $n$-qubit pure states with maximum bipartite entanglement across all possible choices of $k$ vs $n-k$ bi-partitioning, which implies that the Von Neumann entropy of every $k$-qubit reduced density matrix…
Entanglement is one of the key resources of quantum information science which makes identification of entangled states essential to a wide range of quantum technologies and phenomena. This problem is however both computationally and…
In this paper, we provide a complete mathematical theory for the entanglement of mixtures of Dicke states. These quantum states form an important subclass of bosonic states arising in the study of indistinguishable particles. We introduce a…
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…
We investigate genuinely entangled $N$-qubit states with no $N$-partite correlations in the case of symmetric states. Using a tensor representation for mixed symmetric states, we obtain a simple characterization of the absence of…
We prove a general reduction theorem for stabilizer absolutely maximally entangled states in composite local dimension. If a stabilizer $\mathrm{AME}(n,D)$ state exists and $D=\prod_{i=1}^m q_i$ is the prime-power factorization of $D$, then…
A pure quantum state is called $k$-uniform if all its reductions to $k$-qudit are maximally mixed. We investigate the general constructions of $k$-uniform pure quantum states of $n$ subsystems with $d$ levels. We provide one construction…
Here we show how the Minimally Entangled States (MES) of a 2d system with topological order can be identified using the geometric measure of entanglement. We show this by minimizing this measure for the doubled semion, doubled Fibonacci and…
Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. In a recent paper [arXiv:0907.2994v1] we discussed how to…
We demonstrate that any pure bipartite state of two qubits may be decomposed into a superposition of a maximally entangled state and an orthogonal factorizable one. Although there are many such decompositions, the weights of the two…
We investigate conditions on a finite set of multi-partite product vectors for which separable states with corresponding product states have unique decomposition, and show that this is true in most cases if the number of product vectors is…