Optimal projective packings from association schemes

Finite tight frames play an important role in miscellaneous areas, including quantum information theory. Here we apply a class of tight frames, equiangular tight frames, to address the problem of detecting the entanglement of bipartite states. Here we derive some entanglement criteria based on positive operator-valued measurements built from equiangular tight frames. We also present a class of entanglement witnesses based on the equiangular tight frames. At last, we generalize the entanglement criterion for bipartite systems to multipartite systems.

Over-complete systems of vectors, or in short, frames, play the role of analog codes in many areas of communication and signal processing. To name a few, spreading sequences for code-division multiple access (CDMA), over-complete representations for multiple-description (MD) source coding, space-time codes, sensing matrices for compressed sensing (CS), and more recently, codes for unreliable distributed computation. In this survey paper we observe an informationtheoretic random-like behavior of frame subsets. Such subframes arise in setups involving erasures (communication), random user activity (multiple access), or sparsity (signal processing), in addition to channel or quantization noise. The goodness of a frame as an analog code is a function of the eigenvalues of a sub-frame, averaged over all subframes (e.g., harmonic mean of the eigenvalues relates to least-square estimation error, while geometric mean to the Shannon transform, and condition number to the restricted isometry property). Within the highly symmetric class of Equiangular Tight Frames (ETF), as well as other “near ETF” families, we show a universal behavior of the empirical eigenvalue distribution (ESD) of a randomly-selected sub-frame: (i) the ESD is asymptotically indistinguishable from Wachter’s MANOVA distribution; and (ii) it exhibits a convergence rate to this limit that is indistinguishable from that of a matrix sequence drawn from MANOVA (Jacobi) ensembles of corresponding dimensions. Some of these results follow from careful statistical analysis of empirical evidence, and some are proved analytically using random matrix theory arguments of independent interest. The goodness measures of the MANOVA limit distribution are better, in a concrete formal sense, than those of the Marchenko–Pastur distribution at the same aspect ratio, implying that deterministic analog codes are better than random (i.i.d.) analog codes. We further give evidence that the ETF (and near ETF) family is in fact superior to any other frame family in terms of its typical sub-frame goodness.

An equiangular tight frame (ETF) is an M N matrix which has orthogonal equal norm rows, equal normcolumns, and the inner products of all pairs of columns have the same modulus. In this paper we studyETFs in which all of the entries are unimodular, and in particular pth roots of unity. A new constructionof unimodular ETFs based on resolvable Steiner systems is presented. This construction gives many newexamples of unimodular ETFs. In particular, an new in nite class of ETFs with entries in f1; 1g ispresented.Keywords: tight frames, equiangular, Hadamard matrices, Steiner systems, resolvable 1. INTRODUCTION Let F be an M N matrix with real or complex entries. If there exists A > 0 such that FF = AI , where Iis the identity matrix, then F is called a tight frame . If F F has constant diagonal and all of the o -diagonalentries have the same modulus, then F is called equiangular. If all of the entries of F have modulus 1 thenwe call F unimodular . If all of the entries of F are pth roots of unity, then we call F unimodular of degree p.This article is concerned with equiangular tight frames (ETFs) which are unimodular of degree p. Inparticular, we are concerned with nding unimodular ETFs of degree 2, which we shall also refer to asHadamard ETFs. Note that in the usual de nition of ETFs the columns are taken to have norm 1. However,since we are concerned with unimodular ETFs we will avoid normalizing, thus the columns of an M Nunimodular ETF have norm M .The paper is organized as follows. In Section 2 we present some necessary conditions on the existence ofunimodular ETFs. In Section 3 we review the construction of harmonic ETFs, which is an important classof ETFs that also happen to be unimodular. In Section 4 we review the construction of the Steiner ETFs ofFickus, Mixon, and Tremain,

Equiangular tight frames that contain regular simplices

Detecting or classifying already known sparse signals contaminated by Gaussian noise from compressive measurements is different from reconstructing sparse signals, as its objective is to minimize the error probability which describes performance of the detectors or classifiers. This paper is concerned about the performance improvement of a commonly used Compressive Classifier. We prove that when the arbitrary sensing matrices used to get the Compressive Measurements are transformed into Equi-Norm Tight Frames, i.e. the matrices that are row-orthogonal, The Compressive Classifier achieves better performance. Although there are other proofs that among all Equi-Norm Tight Frames the Equiangular tight Frames (ETFs) bring best worst-case performance, the existence and construction of ETFs on some dimensions is still an open problem. As the construction of Equi-Norm Tight Frames from any arbitrary matrices is very easy and practical compared with ETF matrices, the result of this paper can also provide a practical method to design an improved sensing matrix for Compressive Classification. We can conclude that: Tight is Better!

A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes. The association schemes based on non-Abelian groups are constructed by bases for the regular representation from U6n, T4n, V8n and dihedral D2n groups. By using Abelian group association schemes followed by cyclic groups and non-Abelian group association schemes a list of binary stabilizer codes up to 40 qubits is given in tables 4, 5 and 10. Moreover, several binary stabilizer codes of minimum distances 5, 7 and 8 with good quantum parameters is presented. The preference of this method specially for Abelian group association schemes is that one can construct any binary quantum stabilizer code with any distance by using the commutative structure of association schemes.

We introduce the study of frames and equiangular lines in classical geometries over finite fields. After developing the basic theory, we give several examples and demonstrate finite field analogs of equiangular tight frames (ETFs) produced by modular difference sets, and by translation and modulation operators. Using the latter, we prove that Gerzon's bound is attained in each unitary geometry of dimension d=22l+1 over the field F32. We also investigate interactions between complex ETFs and those in finite unitary geometries, and we show that every complex ETF implies the existence of ETFs with the same size over infinitely many finite fields.

The relationship between equiangular tight frames and strongly regular graphs has been known for several years. This relationship has been exploited to construct many of the latest examples of new strongly regular graphs. Recently it was shown that there is a similar relationship between two-distance tight frames and strongly regular graphs. In this paper we present a new tensor like construction of two-distance tight frames, and hence a family of strongly regular graphs. While graphs with these parameters were known to exist, this new construction is very simple, requiring only the existence of an affine plane, whereas the original constructions often require more complicated objects such as generalized quadrangles.

Association schemes and permutation groups

A SIC is a maximal equiangular tight frame in a finite dimensional Hilbert space. Given a SIC in dimension d, there is good evidence that there always exists an aligned SIC in dimension d(d − 2), having predictable symmetries and smaller equiangular tight frames embedded in them. We provide a recipe for how to calculate sets of vectors in dimension d(d − 2) that share these properties. They consist of maximally entangled vectors in certain subspaces defined by the numbers entering the d dimensional SIC. However, the construction contains free parameters and we have not proven that they can always be chosen so that one of these sets of vectors is a SIC. We give some worked examples that, we hope, may suggest to the reader how our construction can be improved. For simplicity we restrict ourselves to the case of odd dimensions.

Review for "Entropic uncertainty relations from equiangular tight frames and their applications"

Decision letter for "Entropic uncertainty relations from equiangular tight frames and their applications"

We use group schemes to construct optimal packings of lines through the origin. In this setting, optimal line packings are naturally characterized using representation theory, which in turn leads to a necessary integrality condition for the existence of equiangular central group frames. We conclude with an infinite family of optimal line packings using the group schemes associated with certain Suzuki 2-groups, specifically, extensions of Heisenberg groups. Notably, this is the first known infinite family of equiangular tight frames generated by representations of nonabelian groups.

An efficient algorithm for designing projection matrix in compressive sensing based on alternating optimization

In this paper the stability of the quadratic equation is considered on arbitrary groups. Since the quadratic equation is stable on Abelian groups, this paper examines the stability of the quadratic equation on noncommutative groups. It is shown that the quadratic equation is stable on $n$-Abelian groups when $n$ is a positive integer. The stability of the quadratic equation is also established on the noncommutative group $T(2, K)$, where $K$ is an arbitrary commutative field. It is proved that every group can be embedded into a group in which the quadratic equation is stable.