Related papers: Switching operations for Hadamard matrices
Matrices are built and designed by applying procedures from lower order matrices. Matrix tensor products, direct sums or multiplication of matrices are such procedures and a matrix built from these is said to be a {\em separable} matrix. A…
The hybrid tensor network approach allows us to perform calculations on systems larger than the scale of a quantum computer. However, when calculating transition amplitudes, there is a problem that the number of terms to be measured…
The purpose of this paper is to introduce new parametric families of complex Hadamard matrices in two different ways. First, we prove that every real Hadamard matrix of order N>=4 admits an affine orbit. This settles a recent open problem…
We systematically explore the new method of construction (known as the propus construction) of symmetric Hadamard matrices for small orders, $4v$. In particular we give the first examples of symmetric Hadamard matrices of order $156=4\cdot…
We discuss an extension of the almost Hadamard matrix formalism, to the case of complex matrices. Quite surprisingly, the situation here is very different from the one in the real case, and our conjectural conclusion is that there should be…
In this paper we disprove the Haagerup statement that all complex Hadamard matrices of order five are equivalent with the Fourier matrix $F_5$ by constructing circulant matrices that lead to new Hadamard matrices. An important item is the…
We have extended the Paley constructions for Hadamard matrices and obtained some series of Hadamard matrices. Especially Paley construction-II is applicable for odd prime power q is congruent to 1(mod 4) however our method is applicable for…
We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…
In the present paper we establish some new integral inequalities analogous to the well known Hadamard inequality by using a fairly elementary analysis.
The normal sequences NS(n) and near-normal sequences NN(n) play an important role in the construction of orthogonal designs and Hadamard matrices. They can be identified with certain base sequences (A;B;C;D), where A and B have length n+1…
An analytical method for getting new complex Hadamard matrices by using mutually unbiased bases and a nonlinear doubling formula is provided. The method is illustrated with the n=4 case that leads to a rich family of eight-dimensional…
Let $S(x)$ be the number of $n \leq x$ for which a Hadamard matrix of order $n$ exists. Hadamard's conjecture states that $S(x)$ is about $x/4$. From Paley's constructions of Hadamard matrices, we have that \[ S(x) = \Omega(x/\log x). \] In…
We prove tight bounds for the $\infty$-norm of the inverse of symmetric, diagonally dominant positive matrices. We also prove a new lower-bound form of Hadamard's inequality for the determinant of diagonally dominant positive matrices and…
The integral representation of the Hadamard product of two functions is used to prove several Euler-type series transformation formulas. As applications we obtain three binomial identities involving harmonic numbers and an identity for the…
In this paper we give a new construction of parametric families of complex Hadamard matrices of square orders, and connect them to equiangular tight frames. The results presented here generalize some of the recent ideas of Bodmann et al.…
Every Hadamard matrix $H$ of order $n > 1$ induces a graph with $4n$ vertices, called the Hadamard graph $\Gamma(H)$ of $H$. Since $\Gamma(H)$ is a distance-regular graph with diameter $4$, it induces a $4$-class association scheme…
We rationalize the somewhat surprising efficacy of the Hadamard transform in simplifying the eigenstates of the quantum baker's map, a paradigmatic model of quantum chaos. This allows us to construct closely related, but new, transforms…
We construct new symmetric Hadamard matrices of orders $92,116$, and $172$. While the existence of those of order $92$ was known since 1978, the orders $116$ and $172$ are new. Our construction is based on a recent new combinatorial array…
In this paper, we establish some new inequalities of the Hermite-Hadamard like for class of (h-s)_{1,2}-convex functions which are ordinary, super-multiplicative or similarly ordered and nonnegative.
A new type of complex Hadamard matrices of order 9 are constructed. The studied matrices are symmetric, block circulant with circulant blocks ($BCCB$) and form an until now unknown non-reducible and non-affine two-parameter orbit. Several…