Resolvable block designs in construction of approximate real MUBs that are sparse

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 d √ de many ARMUBs for dimension d = q(q + 1), where q ≡ 3 mod 4 and it is a prime power, such that for any two vectors v1, v2 belonging to different bases, | 〈v1|v2〉 | < 2 √ d . We also demonstrate certain cases, such as d = sq, where q is a prime power and sq ≡ 0 mod 4. These findings subsume and improve our earlier results in [Cryptogr. Commun. 13, 321-329, January 2021]. This present construction idea provides several infinite families of such objects, not known in the literature, which can find efficient applications in quantum information processing for the sparsity, apart from suggesting that parallel classes of RBDs are intimately linked with MUBs/ARMUBs.

[1]  D. Đoković Hadamard matrices of order 764 exist , 2008 .

[2]  Haim Hanani,et al.  On Resolvable Balanced Incomplete Block Designs , 1974, J. Comb. Theory, Ser. A.

[3]  J. Seidel,et al.  QUADRATIC FORMS OVER GF(2) , 1973 .

[4]  M. Behbahani On orthogonal matrices , 2004 .

[5]  Igor E. Shparlinski,et al.  Constructions of Approximately Mutually Unbiased Bases , 2006, LATIN.

[6]  J. Seidel,et al.  QUADRATIC FORMS OVER GF(2) , 1973 .

[7]  W. Wootters Quantum Measurements and Finite Geometry , 2004, quant-ph/0406032.

[8]  Douglas R. Stinson,et al.  Combinatorial designs: constructions and analysis , 2003, SIGA.

[9]  S. S. Shrikhande,et al.  Affine resolvable balanced incomplete block designs: A survey , 1976 .

[10]  S. Agaian Hadamard Matrices and Their Applications , 1985 .

[11]  D. K. Ray-Chaudhuri,et al.  The Existence of Resolvable Block Designs , 1973 .

[12]  P. Oscar Boykin,et al.  A New Proof for the Existence of Mutually Unbiased Bases , 2002, Algorithmica.

[13]  T. Paterek,et al.  On the connection between mutually unbiased bases and orthogonal Latin squares , 2009 .

[14]  P. Oscar Boykin,et al.  Real Mutually Unbiased Bases , 2005 .

[15]  Metod Saniga,et al.  Mutually unbiased bases and finite projective planes , 2004 .

[16]  Subhamoy Maitra,et al.  On approximate real mutually unbiased bases in square dimension , 2021, Cryptography and Communications.

[17]  K. Życzkowski,et al.  ON MUTUALLY UNBIASED BASES , 2010, 1004.3348.

[18]  Pawel Wocjan,et al.  New construction of mutually unbiased bases in square dimensions , 2005, Quantum Inf. Comput..

[19]  S. Chaturvedi Mutually unbiased bases , 2002 .

[20]  R. Paley On Orthogonal Matrices , 1933 .

[21]  Marcin Pawłowski,et al.  Connections between Mutually Unbiased Bases and Quantum Random Access Codes. , 2017, Physical review letters.

[22]  A. Klappenecker,et al.  On approximately symmetric informationally complete positive operator-valued measures and related systems of quantum states , 2005, quant-ph/0503239.

[23]  Charles J. Colbourn,et al.  Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications) , 2006 .

[24]  Dragomir Z. Dokovic Hadamard matrices of order 764 exist , 2008, Comb..

[25]  W. Wallis,et al.  Hadamard Matrices and Their Applications , 1978 .

[26]  G. Zauner,et al.  QUANTUM DESIGNS: FOUNDATIONS OF A NONCOMMUTATIVE DESIGN THEORY , 2011 .

[27]  Ferenc SzollHosi,et al.  Construction, classification and parametrization of complex Hadamard matrices , 2011, 1110.5590.

[28]  Borivoje Dakic,et al.  Mutually unbiased bases, orthogonal Latin squares, and hidden-variable models , 2008, 0804.2193.

[29]  W. Wootters,et al.  Optimal state-determination by mutually unbiased measurements , 1989 .