Paper 2021/901
Resolvable Block Designs in Construction of Approximate Real MUBs that are Sparse
Ajeet Kumar and Subhamoy Maitra
Abstract
Several constructions of Mutually Unbiased Bases (MUBs) borrow tools from combinatorial objects. In this paper we focus
how one can construct Approximate Real MUBs (ARMUBs) with improved parameters using results from the domain of Resolvable Block Designs (RBDs). We first explain the generic idea of our strategy in relating the RBDs with MUBs/ARMUBs, which are sparse (the basis vectors have small number of non-zero co-ordinates). Then specific parameters are presented, for which we can obtain new classes and improve the existing results. To be specific, we present an infinite family of many ARMUBs for dimension , where and it is a prime power, such that for any two vectors belonging to different bases, . We also demonstrate certain cases, such as
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- (Approximate Real) Mutually Unbiased BasesCombinatorial DesignCryptologyHadamard MatricesQuantum Information TheoryResolvable Block Design.
- Contact author(s)
- subho @ isical ac in
- History
- 2021-07-05: received
- Short URL
- https://ia.cr/2021/901
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/901, author = {Ajeet Kumar and Subhamoy Maitra}, title = {Resolvable Block Designs in Construction of Approximate Real {MUBs} that are Sparse}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/901}, year = {2021}, url = {https://eprint.iacr.org/2021/901} }