2017/10/20 by Xiaoya Cheng, Cheng, Xiaoya, Yun Shang +1
Engineering · Computer Science · #graph theory and CDMA systems #Quantum-Dot Cellular Automata #Coding theory and cryptography
paper · pdf · doi:10.48550/arxiv.1710.07458
Mutually unbiased bases which is also maximally entangled bases is called mutually unbiased maximally entangled bases (MUMEBs). We study the construction of MUMEBs in bipartite system. In detail, we construct 2(pa-1) MUMEBs in Cd⊗ Cd by properties of Guss sums for arbitrary odd d. It improves the known lower bound pa-1 for odd d. Certainly, it also generalizes the lower bound 2(pa-1) for d being a single prime power. Furthermore, we construct MUMEBs in Cd⊗ Ckd for general k>= 2 and odd d. We get the similar lower bounds as k,b are both single prime powers. Particularly, when k is a square number, by using mutually orthogonal Latin squares, we can construct more MUMEBs in Cd⊗ Ckd, and obtain greater lower bounds than reducing the problem into prime power dimension in some cases.