New bounds of Mutually unbiased maximally entangled bases in C^dotimes C^{kd}
Add this Pith Number to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{LWL5HTMY}
Prints a linked pith:LWL5HTMY badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.