Related papers: Thirty-six quantum officers are entangled
A pair of orthogonal latin cubes of order $q$ is equivalent to an MDS code with distance $3$ or to an ${\rm OA}_1(3,5,q)$ orthogonal array. We construct pairs of orthogonal latin cubes for a sequence of previously unknown orders…
Two $n \times n$ Latin squares $L_1, L_2$ are said to be orthogonal if, for every ordered pair $(x,y)$ of symbols, there are coordinates $(i,j)$ such that $L_1(i,j) = x$ and $L_2(i,j) = y$. A $k$-MOLS is a sequence of $k$…
We present a review of the problem of finding out whether a quantum state of two or more parties is entangled or separable. After a formal definition of entangled states, we present a few criteria for identifying entangled states and…
Classical systems can be entangled. Entanglement is defined by coincidence correlations. Quantum entanglement experiments can be mimicked by a mechanical system with a single conserved variable and 77.8% conditional efficiency. Experiments…
An interesting monogamy equation with the form of Pythagorean theorem is found for $2\otimes 2\otimes n$-dimensional pure states, which reveals the relation among bipartite concurrence, concurrence of assistance, and genuine tripartite…
A Latin square $L(n,k)$ is a square of order $n$ with its entries colored with $k$ colors so that all the entries in a row or column have different colors. Let $d(L(n,k))$ be the minimal number of colored entries of an $n \times n$ square…
We have performed a complete enumeration of non-isotopic triples of mutually orthogonal $k\times n$ Latin rectangles for $k\leq n \leq 7$. Here we will present a census of such triples, classified by various properties, including the order…
Bipartite correlations in multi-qubit systems cannot be shared freely. The presence of entanglement or classical correlation on certain pairs of qubits may imply correlations on other pairs. We present a method of characterization of…
We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms known methods already at the first level, and it is complete in…
Consider a partial Latin square $P$ where the first two rows and first three columns are completely filled, and every other cell of $P$ is empty. It has been conjectured that all such partial Latin squares of order at least $8$ are…
A new uncertainty relation (UR) is obtained for a system of N identical pure entangled particles if we use symmetrized observables when deriving the inequality. This new expression can be written in a form where we identify a term which…
Quantum mechanics of composite systems, gives rise to certain special states called entangled states. A physical system, that is in an entangled state displays an intricate correlation between its subsystems. There are also some composite…
The chromatic number of a cyclic Latin square of order 2n is 2n+2. The available proof for this statement includes a coloring that is rather lengthy. Here, we introduce a coloring of cyclic Latin square of even order 2n (the Latin square of…
In this paper we propose an algorithm for enumerating diagonal Latin squares of small order. It relies on specific properties of diagonal Latin squares to employ symmetry breaking techniques, and on several heuristic optimizations and bit…
Recent works by Brown et al and Borras et al have explored numerical optimisation procedures to search for highly entangled multi-qubit states according to some computationally tractable entanglement measure. We present an alternative…
A latin square of order $n$ with pairwise disjoint subsquares of orders $h_1,\dots,h_k$ such that $h_1+\dots+h_k = n$ is known as a realization. The existence of realizations is a partially solved problem with a few general results for an…
We formulate a two-party communication complexity problem and present its quantum solution that exploits the entanglement between two qutrits. We prove that for a broad class of protocols the entangled state can enhance the efficiency of…
A Costas latin square of order n is a set of n disjoint Costas arrays of the same order. Costas latin squares are studied here from a construction as well as a classification point of view. A complete classification is carried out up to…
We offer a piece of evidence that the problems of finding the number of mutually unbiased bases (MUB) and mutually orthogonal Latin squares (MOLS) might not be equivalent. We study a particular procedure which has been shown to relate the…
The problem of completing a partially specified n by n Latin square is solved by an alternative proof, based on filling the rows (or diagonals) from 1 to n, using an extended form of Hall's marriage theorem.