A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples

We enumerate all circulant good matrices with odd orders divisible by 3 up to order 70. As a consequence of this we find a previously overlooked set of good matrices of order 27 and a new set of good matrices of order 57. We also find that circulant good matrices do not exist in the orders 51, 63, and 69, thereby finding three new counterexamples to the conjecture that such matrices exist in all odd orders. Additionally, we prove a new relationship between the entries of good matrices and exploit this relationship in our enumeration algorithm. Our method applies the SAT+CAS paradigm of combining computer algebra functionality with modern SAT solvers to efficiently search large spaces which are specified by both algebraic and logical constraints

The geometry of quantum learning

Concept learning provides a natural framework in which to place the problems solved by the quantum algorithms of Bernstein-Vazirani and Grover. By combining the tools used in these algorithms--quantum fast transforms and amplitude amplification--with a novel (in this context) tool--a solution method for geometrical optimization problems--we derive a general technique for quantum concept learning. We name this technique "Amplified Impatient Learning" and apply it to construct quantum algorithms solving two new problems: BATTLESHIP and MAJORITY, more efficiently than is possible classically.Comment: 20 pages, plain TeX with amssym.tex, related work at http://www.math.uga.edu/~hunziker/ and http://math.ucsd.edu/~dmeyer

Supplementary difference sets with symmetry for Hadamard matrices

First we give an overview of the known supplementary difference sets (SDS) (A_i), i=1..4, with parameters (n;k_i;d), where k_i=|A_i| and each A_i is either symmetric or skew and k_1 + ... + k_4 = n + d. Five new Williamson matrices over the elementary abelian groups of order 25, 27 and 49 are constructed. New examples of skew Hadamard matrices of order 4n for n=47,61,127 are presented. The last of these is obtained from a (127,57,76)-difference family that we have constructed. An old non-published example of G-matrices of order 37 is also included.Comment: 16 pages, 2 tables. A few minor changes are made. The paper will appear in Operators and Matrice

Tree-structured complementary filter banks using all-pass sections

Tree-structured complementary filter banks are developed with transfer functions that are simultaneously all-pass complementary and power complementary. Using a formulation based on unitary transforms and all-pass functions, we obtain analysis and synthesis filter banks which are related through a transposition operation, such that the cascade of analysis and synthesis filter banks achieves an all-pass function. The simplest structure is obtained using a Hadamard transform, which is shown to correspond to a binary tree structure. Tree structures can be generated for a variety of other unitary transforms as well. In addition, given a tree-structured filter bank where the number of bands is a power of two, simple methods are developed to generate complementary filter banks with an arbitrary number of channels, which retain the transpose relationship between analysis and synthesis banks, and allow for any combination of bandwidths. The structural properties of the filter banks are illustrated with design examples, and multirate applications are outlined

Recycling Randomness with Structure for Sublinear time Kernel Expansions

We propose a scheme for recycling Gaussian random vectors into structured matrices to approximate various kernel functions in sublinear time via random embeddings. Our framework includes the Fastfood construction as a special case, but also extends to Circulant, Toeplitz and Hankel matrices, and the broader family of structured matrices that are characterized by the concept of low-displacement rank. We introduce notions of coherence and graph-theoretic structural constants that control the approximation quality, and prove unbiasedness and low-variance properties of random feature maps that arise within our framework. For the case of low-displacement matrices, we show how the degree of structure and randomness can be controlled to reduce statistical variance at the cost of increased computation and storage requirements. Empirical results strongly support our theory and justify the use of a broader family of structured matrices for scaling up kernel methods using random features

Robust Hadamard matrices, unistochastic rays in Birkhoff polytope and equi-entangled bases in composite spaces

We study a special class of (real or complex) robust Hadamard matrices, distinguished by the property that their projection onto a $2$-dimensional subspace forms a Hadamard matrix. It is shown that such a matrix of order $n$ exists, if there exists a skew Hadamard matrix of this size. This is the case for any even dimension $n\le 20$, and for these dimensions we demonstrate that a bistochastic matrix $B$ located at any ray of the Birkhoff polytope, (which joins the center of this body with any permutation matrix), is unistochastic. An explicit form of the corresponding unitary matrix $U$, such that $B_{ij}=|U_{ij}|^2$, is determined by a robust Hadamard matrix. These unitary matrices allow us to construct a family of orthogonal bases in the composed Hilbert space of order $n \times n$. Each basis consists of vectors with the same degree of entanglement and the constructed family interpolates between the product basis and the maximally entangled basis.Comment: 17 page

Trades in complex Hadamard matrices

A trade in a complex Hadamard matrix is a set of entries which can be changed to obtain a different complex Hadamard matrix. We show that in a real Hadamard matrix of order $n$ all trades contain at least $n$ entries. We call a trade rectangular if it consists of a submatrix that can be multiplied by some scalar $c \neq 1$ to obtain another complex Hadamard matrix. We give a characterisation of rectangular trades in complex Hadamard matrices of order $n$ and show that they all contain at least $n$ entries. We conjecture that all trades in complex Hadamard matrices contain at least $n$ entries.Comment: 9 pages, no figure