New bounds of Mutually unbiased maximally entangled bases in C^d\otimes C^{kd}

TL;DR

This paper constructs new bounds for mutually unbiased maximally entangled bases (MUMEBs) in bipartite quantum systems, improving known lower bounds and providing methods for their construction in various dimensions.

Contribution

It introduces novel constructions of MUMEBs in bipartite systems, extending lower bounds and utilizing properties of Guss sums and Latin squares for general dimensions.

Findings

Constructed 2(p^a-1) MUMEBs in C^d⊗C^d for odd d.

Improved lower bounds for the number of MUMEBs in certain dimensions.

Provided construction methods for MUMEBs in C^d⊗C^{kd} with general k≥2 and odd d.

Abstract

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(p^a-1) MUMEBs in C^d\otimes C^d by properties of Guss sums for arbitrary odd d. It improves the known lower bound p^a-1 for odd d. Certainly, it also generalizes the lower bound 2(p^a-1) for d being a single prime power. Furthermore, we construct MUMEBs in C^d\otimes C^{kd} 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 C^d\otimes C^{kd}, and obtain greater lower bounds than reducing the problem into prime power dimension in some cases.