Related papers: Block-Circulant Complex Hadamard Matrices
We provide a novel Neural Network architecture that can: i) output R-matrix for a given quantum integrable spin chain, ii) search for an integrable Hamiltonian and the corresponding R-matrix under assumptions of certain symmetries or other…
Two methods to decompose block matrices analogous to Singular Matrix Decomposition are proposed, one yielding the so called economy decomposition, and other yielding the full decomposition. This method is devised to avoid handling matrices…
We consider a new splitting based on the Sherman-Morrison-Woodbury formula, which is particularly effective with iterative methods for the numerical solution of large linear systems. These systems involve matrices that are perturbations of…
In the light of several recent analyses pointing towards texture 4-zero Fritzsch-like quark mass matrices as the only viable structures for quark mass matrices, this work adopts a model independent approach to reconstruct an alternate and…
We study the partial Hadamard matrices $H\in M_{M\times N}(\mathbb C)$ which are regular, in the sense that the scalar products between pairs of distinct rows decompose as sums of cycles (rotated sums of roots of unity). The simplest…
We investigate the variety of commuting matrices. We classify its components for any number of matrices of size at most 7. We prove that starting from quadruples of size 8 matrices, this scheme has generically nonreduced components, while…
In this study, we present a new generalization of circulant matrices for the generalized $k$-Horadam numbers, by considering the $g$-circulant matrix $C_{n,g}(H)=g -circ(H_{k,1},H_{k,2},\ldots ,H_{k,n})$. Also, we calculate the spectral…
Applications in quantum information theory and quantum tomography have raised current interest in complex Hadamard matrices. In this note we investigate the connection between tiling Abelian groups and constructions of complex Hadamard…
Although Hadamard matrices have been investigated since the nineteenth century, relatively little is known about their higher-dimensional analogues. In this paper, we introduce two constructions of Hadamard hypercubes. The first…
The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work enumerates nonisomorphic cycles -- that is, the number of…
Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton's method. Using first-order derivatives of…
The cyclic reduction (CR) algorithm is an efficient method for solving quadratic matrix equations that arise in quasi-birth-death (QBD) stochastic processes. However, its convergence is not guaranteed when the associated matrix polynomial…
While dealing with the nontrivial task of classifying Mueller matrices, of special interest is the study of the degenerate Mueller matrices (matrices with vanishing determinant, for which the law of multiplication holds, but there exists no…
While quantum algorithms for solving large scale systems of linear equations offer potentially exponential speedups, their application has largely been confined to sparse matrices. This work extends the scope of these algorithms to a broad…
We introduce a new class of "filtered" schemes for some first order non-linear Hamilton-Jacobi-Bellman equations. The work follows recent ideas of Froese and Oberman (SIAM J. Numer. Anal., Vol 51, pp.423-444, 2013). The proposed schemes are…
Constructing four six-dimensional mutually unbiased bases (MUBs) is an open problem in quantum physics and measurement. We investigate the existence of four MUBs including the identity, and a complex Hadamard matrix (CHM) of Schmidt rank…
Clustering aims to group unlabelled samples based on their similarities. It has become a significant tool for the analysis of high-dimensional data. However, most of the clustering methods merely generate pseudo labels and thus are unable…
Many types of pairwise interaction take the form of a fixed set of nodes with edges that appear and disappear over time. In the case of discrete-time evolution, the resulting evolving network may be represented by a time-ordered sequence of…
We report on a search for mutually unbiased bases (MUBs) in 6 dimensions. We find only triplets of MUBs, and thus do not come close to the theoretical upper bound 7. However, we point out that the natural habitat for sets of MUBs is the set…
We analyze composition methods with complex coefficients exhibiting the so-called ``symmetry-conjugate'' pattern in their distribution. In particular, we study their behavior with respect to preservation of qualitative properties when…