Related papers: Thirty-six quantum officers are entangled

Suppose we have $N$ quantum systems in unknown states $\lvert\psi_i \rangle $, but know the value of some pairwise overlaps $\left| \langle \psi_k \lvert \psi_l \rangle \right|^2$. What can we say about the values of the unknown overlaps?…

Given an integer partition $(h_1,h_2,\dots,h_k)$ of $n$, is it possible to find an order $n$ latin square with $k$ disjoint subsquares of orders $h_1,\dots,h_k$? This question was posed by L.Fuchs and is only partially solved. Existence has…

We prove a general result on completing objects similar to Latin rectangles in which the number of occurrences of each symbol is prescribed, each cell contains multiple symbols, and no cell contains repeated symbols. This generalizes…

A bipartite multiphoton entangled state is created through stimulated parametric down-conversion of strong laser pulses in a nonlinear crystal. It is shown how detectors that do not resolve photon number can be used to analyze such…

There exists a bijection between the set of Latin squares of order $n$ and the set of feasible solutions of the 3-dimensional planar assignment problem ($3PAP_n$). In this paper, we prove that, given a Latin square isotopism $\Theta$, we…

There has been a surge of progress in recent years in developing algorithms for testing and learning quantum states that achieve optimal copy complexity. Unfortunately, they require the use of entangled measurements across many copies of…

Entanglement-assisted quantum error correcting codes (EAQECCs) are a simple and fundamental class of codes. They allow for the construction of quantum codes from classical codes by relaxing the duality condition and using pre-shared…

Systems of linear equations are used to model a wide array of problems in all fields of science and engineering. Recently, it has been shown that quantum computers could solve linear systems exponentially faster than classical computers,…

We address some of the most commonly raised questions about entanglement, especially with regard to so-called occupation number entanglement. To answer unambiguously whether entanglement can exist in a one-atom delocalized state, we propose…

Let $L(n)$ be the number of Latin squares of order $n$, and let $L^{\textrm{even}}(n)$ and $L^{\textrm{odd}}(n)$ be the number of even and odd such squares, so that $L(n) = L^{\textrm{even}}(n) + L^{\textrm{odd}}(n)$. The Alon-Tarsi…

Regarding neighbor balance, we consider natural generalizations of $D$-complete Latin squares and Vatican squares from the finite to the infinite. We show that if $G$ is an infinite abelian group with $|G|$-many square elements, then it is…

Let $T(n)$ denote the maximal number of transversals in an order-$n$ Latin square. Improving on the bounds obtained by McKay et al., Taranenko recently proved that $T(n) \leq \left((1+o(1))\frac{n}{e^2}\right)^{n}$, and conjectured that…

Understanding the relation between nonlocality and entanglement is one of the fundamental problems in quantum physics. In the bipartite case, it is known that the correlations observed for some entangled quantum states can be explained…

Two or more quantum systems are said to be in an entangled or non-factorisable state if their joint (supposedly pure) wave-function is not expressible as a product of individual wave functions but is instead a superposition of product…

For every positive integer $n$ greater than $4$ there is a set of Latin squares of order $n$ such that every permutation of the numbers $1,\ldots,n$ appears exactly once as a row, a column, a reverse row or a reverse column of one of the…

This article reviews and extends recent results concerning entanglement and frustration in multipartite systems which have some symmetry with respect to the ordering of the particles. Starting point of the discussion are Bell inequalities:…

A latin square of order $n$ is an $n\times n$ array of $n$ symbols in which each symbol occurs exactly once in each row and column. A transversal of such a square is a set of $n$ entries such that no two entries share the same row, column…

First, we present a Bell type inequality for n qubits, assuming that m out of the n qubits are independent. Quantum mechanics violates this inequality by a ratio that increases exponentially with m. Hence an experiment on n qubits violating…

Suppose that $k$ is a function of $n$ and $n\to\infty$. We show that with probability $1-O(1/n)$, a uniformly random $k\times n$ Latin rectangle contains no proper Latin subsquare of order $4$ or more, proving a conjecture of Divoux, Kelly,…

While quantum entanglement is known to be monogamous (i.e. shared entanglement is restricted in multi-partite settings), here we show that distributed entanglement (or the potential for entanglement) is by nature polygamous. By establishing…