2000 character limit reached
Constructing mutually unbiased bases from unextendible maximally entangled bases
Published 26 Jan 2020 in quant-ph | (2001.09515v1)
Abstract: We study mutually unbiased bases (MUBs) in which all the bases are unextendible maximally entangled ones. We first present a necessary and sufficient condition of constructing a pair of MUBs in $C2 \otimes C4$. Based on this condition, an analytical and necessary condition for constructing MUBs is given. Moreover we illustrate our approach by some detailed examples in $C2 \otimes C4$. The results are generalized to $C2 \otimes Cd$ $(d\geq 3)$ and a concrete example in $C2 \otimes C8$ is given.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.