English

Almost Perfect Mutually Unbiased Bases that are Sparse

Discrete Mathematics 2024-03-15 v2 Combinatorics

Abstract

In dimension dd, Mutually Unbiased Bases (MUBs) are a collection of orthonormal bases over Cd\mathbb{C}^d such that for any two vectors v1,v2v_1, v_2 belonging to different bases, the scalar product v1v2=1d|\braket{v_1|v_2}| = \frac{1}{\sqrt{d}}. The upper bound on the number of such bases is d+1d+1. Constructions to achieve this bound are known when dd is some power of prime. The situation is more restrictive in other cases and also when we consider the results over real rather than complex. Thus, certain relaxations of this model are considered in literature and consequently Approximate MUBs (AMUB) are studied. This enables one to construct potentially large number of such objects for Cd\mathbb{C}^d as well as in Rd\mathbb{R}^d. In this regard, we propose the concept of Almost Perfect MUBs (APMUB), where we restrict the absolute value of inner product v1v2|\braket{v_1|v_2}| to be two-valued, one being 0 and the other 1+O(dλ)d \leq \frac{1+\mathcal{O}(d^{-\lambda})}{\sqrt{d}}, such that λ>0\lambda > 0 and the numerator 1+O(dλ)21 + \mathcal{O}(d^{-\lambda}) \leq 2. Each such vector constructed, has an important feature that large number of its components are zero and the non-zero components are of equal magnitude. Our techniques are based on combinatorial structures related to RBDs. We show that for several composite dimensions dd, one can construct O(d)\mathcal{O}(\sqrt{d}) many APMUBs, in which cases the number of MUBs are significantly small. To be specific, this result works for dd of the form (qe)(q+f), q,e,fN(q-e)(q+f), \ q, e, f \in \mathbb{N}, with the conditions 0fe0 \leq f \leq e for constant e,fe, f and qq some power of prime. We also show that such APMUBs provide sets of Bi-angular vectors which are O(d32)\mathcal{O}(d^{\frac{3}{2}}) in numbers, having high angular distances among them. Finally, as the MUBs are equivalent to a set of Hadamard matrices, we show that the APMUBs are so with the set of Weighing matrices.

Keywords

Cite

@article{arxiv.2402.03964,
  title  = {Almost Perfect Mutually Unbiased Bases that are Sparse},
  author = {Ajeet Kumar and Subhamoy Maitra and Somjit Roy},
  journal= {arXiv preprint arXiv:2402.03964},
  year   = {2024}
}
R2 v1 2026-06-28T14:40:05.816Z