Entanglement and quantum combinatorial designs

We introduce several classes of quantum combinatorial designs, namely quantum Latin squares, cubes, hypercubes and a notion of orthogonality between them. A further introduced notion, quantum orthogonal arrays, generalizes all previous classes of designs. We show that mutually orthogonal quantum Latin arrangements can be entangled in the same way than quantum states are entangled. Furthermore, we show that such designs naturally define a remarkable class of genuinely multipartite highly entangled states called $k$-uniform, i.e. multipartite pure states such that every reduction to $k$ parties is maximally mixed. We derive infinitely many classes of mutually orthogonal quantum Latin arrangements and quantum orthogonal arrays having an arbitrary large number of columns. The corresponding multipartite $k$-uniform states exhibit a high persistency of entanglement, which makes them ideal candidates to develop multipartite quantum information protocols.Comment: 14 pages, 3 figures. Comments are very welcome

Optimal Ramp Schemes and Related Combinatorial Objects

In 1996, Jackson and Martin proved that a strong ideal ramp scheme is equivalent to an orthogonal array. However, there was no good characterization of ideal ramp schemes that are not strong. Here we show the equivalence of ideal ramp schemes to a new variant of orthogonal arrays that we term augmented orthogonal arrays. We give some constructions for these new kinds of arrays, and, as a consequence, we also provide parameter situations where ideal ramp schemes exist but strong ideal ramp schemes do not exist

On The Construction of Mixed Orthogonal Arrays of Strength Two

The generalized Kronecker sum was used by Wang and Wu (J. Amer. Statist. Assoc. 86 (1991) 450) and Dey and Midha (Statist. Probab. Lett. 28 (1996) 211; Proc. AP Akad. Sci. 5 (2001) 39) to construct mixed orthogonal arrays. We modify their methods to obtain several families of mixed orthogonal arrays. Some new arrays with run size less than 100 are found

Indicator function and complex coding for mixed fractional factorial designs

In a general fractional factorial design, the $n$-levels of a factor are coded by the $n$-th roots of the unity. This device allows a full generalization to mixed-level designs of the theory of the polynomial indicator function which has already been introduced for two level designs by Fontana and the Authors (2000). the properties of orthogonal arrays and regular fractions are discussed

3-Uniform states and orthogonal arrays

In a recent paper (Phys. Rev. A 90, 022316 (2014) ), Goyeneche et al. established a link between the combinatorial notion of orthogonal arrays and k-uniform states and present open issue. (B) Find for what N there are 3-uniform states of N-qubits. In this paper, we demonstrate the existence of 3-uniform states of N-qubits for N=11,..,15"

Generalized resolution for orthogonal arrays

The generalized word length pattern of an orthogonal array allows a ranking of orthogonal arrays in terms of the generalized minimum aberration criterion (Xu and Wu [Ann. Statist. 29 (2001) 1066-1077]). We provide a statistical interpretation for the number of shortest words of an orthogonal array in terms of sums of $R^2$ values (based on orthogonal coding) or sums of squared canonical correlations (based on arbitrary coding). Directly related to these results, we derive two versions of generalized resolution for qualitative factors, both of which are generalizations of the generalized resolution by Deng and Tang [Statist. Sinica 9 (1999) 1071-1082] and Tang and Deng [Ann. Statist. 27 (1999) 1914-1926]. We provide a sufficient condition for one of these to attain its upper bound, and we provide explicit upper bounds for two classes of symmetric designs. Factor-wise generalized resolution values provide useful additional detail.Comment: Published in at http://dx.doi.org/10.1214/14-AOS1205 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org

Genuinely multipartite entangled states and orthogonal arrays

A pure quantum state of N subsystems with d levels each is called k-multipartite maximally entangled state, written k-uniform, if all its reductions to k qudits are maximally mixed. These states form a natural generalization of N-qudits GHZ states which belong to the class 1-uniform states. We establish a link between the combinatorial notion of orthogonal arrays and k-uniform states and prove the existence of several new classes of such states for N-qudit systems. In particular, known Hadamard matrices allow us to explicitly construct 2-uniform states for an arbitrary number of N>5 qubits. We show that finding a different class of 2-uniform states would imply the Hadamard conjecture, so the full classification of 2-uniform states seems to be currently out of reach. Additionally, single vectors of another class of 2-uniform states are one-to-one related to maximal sets of mutually unbiased bases. Furthermore, we establish links between existence of k-uniform states, classical and quantum error correction codes and provide a novel graph representation for such states.Comment: 24 pages, 7 figures. Comments are very welcome