Mutually unbiased maximally entangled bases from difference matrices

Abstract

Based on maximally entangled states, we explore the constructions of mutually unbiased bases in bipartite quantum systems. We present a new way to construct mutually unbiased bases by difference matrices in the theory of combinatorial designs. In particular, we establish $q$ mutually unbiased bases with $q-1$ maximally entangled bases and one product basis in ${\mathbb{C}}^q\otimes {\mathbb{C}}^q$ for arbitrary prime power $q$. In addition, we construct maximally entangled bases for dimension of composite numbers of non-prime power, such as five maximally entangled bases in ${\mathbb{C}}^{12}\otimes {\mathbb{C}}^{12}$ and ${\mathbb{C}}^{21}\otimes {\mathbb{C}}^{21}$, which improve the known lower bounds for $d=3m$, with $(3,m)=1$ in ${\mathbb{C}}^d\otimes {\mathbb{C}}^d$. Furthermore, we construct $p+1$ mutually unbiased bases with $p$ maximally entangled bases and one product basis in ${\mathbb{C}}^p\otimes {\mathbb{C}}^{p^2}$ for arbitrary prime number $p$.

arXiv comment24 pages

References in corpus (13)

• Security of quantum key distribution using d-level systems
• On mutually unbiased bases
• Entanglement assisted random access codes
• Entanglement and quantum combinatorial designs
• Mean king's problem with mutually unbiased bases and orthogonal Latin squares
• Mutually unbiased bases, orthogonal Latin squares, and hidden-variable models
• The mean king's problem: Spin 1
• Maximally Entangled States via Mutual Unbiased collective Bases
• Constructing Mutually Unbiased Bases from Quantum Latin Squares
• Detecting Entanglement can be More Effective with Inequivalent Mutually Unbiased Bases
• Quantum Key Distribution Highly Sensitive to Eavesdropping
• Quantum combinatorial designs and $k$-uniform states
• Genuinely quantum SudoQ and its cardinality