Related papers: Mutually Unbiased Weighing Matrices
We describe a general framework for weighted parametric multiple test procedures based on the closure principle. We utilize general weighting strategies that can reflect complex study objectives and include many procedures in the literature…
Excluding the existence of four MUBs in $\bbC^6$ is an open problem in quantum information. We investigate the number of product vectors in the set of four mutually unbiased bases (MUBs) in dimension six, by assuming that the set exists and…
We obtain general, exact formulas for the overlaps between the eigenvectors of large correlated random matrices, with additive or multiplicative noise. These results have potential applications in many different contexts, from quantum…
The question of determining the maximal number of mutually unbiased bases in dimension six has received much attention since their introduction to quantum information theory, but a definitive answer has still not been found. In this paper…
We develop a general framework for weighted parsing which is built on top of grammar-based language models and employs multioperator monoids as weight algebras. It generalizes previous work in that area (semiring parsing, weighted deductive…
Mutually unbiased bases determine an optimal set of measurements to extract complete information about the quantum state of a system. However, quite often a priori information about the state exist, making some of the measurement bases…
Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite…
In dimension $d$, Mutually Unbiased Bases (MUBs) are a collection of orthonormal bases over $\mathbb{C}^d$ such that for any two vectors $v_1, v_2$ belonging to different bases, the scalar product $|\braket{v_1|v_2}| = \frac{1}{\sqrt{d}}$.…
Many applications, including rank aggregation, crowd-labeling, and graphon estimation, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and/or columns. We consider the problem of estimating…
In order to describe the right setting to handle Zauner's conjecture on mutually unbiased bases (MUBs) (saying that in $\mathbb{C}^d$, a set of MUBs of the theoretical maximal size $d + 1$ exists only if $d$ is a prime power), we pose some…
We make two contributions to the problem of estimating the $L_1$ calibration error of a binary classifier from a finite dataset. First, we provide an upper bound for any classifier where the calibration function has bounded variation.…
We are interested in learning data-driven representations that can generalize well, even when trained on inherently biased data. In particular, we face the case where some attributes (bias) of the data, if learned by the model, can severely…
We analyze properties of non-hermitian matrices of size M constructed as square submatrices of unitary (orthogonal) random matrices of size N>M, distributed according to the Haar measure. In this way we define ensembles of random matrices…
We prove genuinely multilinear weighted estimates for singular integrals in product spaces. The estimates complete the qualitative weighted theory in this setting. Such estimates were previously known only in the one-parameter situation.…
This paper presents the generalization of weighted distances to modules and their computation through the chamfer algorithm on general point lattices. The first part is dedicated to formalization of definitions and properties (distance,…
In this research paper, structured bi-matrix variate, matrix quadratic equations are considered. Some lemmas related to determining the eigenvalues of unknown matrices are proved. Also, a method of determining the diagonalizabe unknown…
We introduce the notion of weighted singular vectors and weighted uniform exponent with respect to a set of weights. We prove invariance of these exponents for affine subspaces and submanifolds inside those affine subspaces. For certain…
An Hadamard matrix is a square matrix $H\in M_N(\pm1)$ whose rows and pairwise orthogonal. More generally, we can talk about the complex Hadamard matrices, which are the square matrices $H\in M_N(\mathbb C)$ whose entries are on the unit…
We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we…
We investigate the unconditional basis property of martingale differences in weighted $L^2$ spaces in the non-homogeneous situation (i.e. when the reference measure is not doubling). Specifically, we prove that finiteness of the quantity…