Construction of mutually unbiased maximally entangled bases in $\mathbb{C}^{2^s}\otimes\mathbb{C}^{2^s}$ by using Galois rings
Dengming Xu

TL;DR
This paper introduces a novel method using Galois rings to construct mutually unbiased maximally entangled bases in bipartite quantum systems, improving lower bounds on their quantity.
Contribution
It presents a new construction approach for MUMEBs in $ ext{C}^{2^s} imes ext{C}^{2^s}$ using Galois rings, differing from previous finite field methods.
Findings
Constructed new types of MUMEBs in bipartite systems.
Proved a lower bound of $M(2^s,2^s) \,\geq\, 3(2^s-1)$.
Enhanced previous bounds on the number of MUMEBs.
Abstract
Mutually unbiased bases plays a central role in quantum mechanics and quantum information processing. As an important class of mutually unbiased bases, mutually unbiased maximally entangled bases (MUMEBs) in bipartite systems have attracted much attention in recent years. In the paper, we try to construct MUMEBs in by using Galois rings, which is different from the work in \cite{xu2}, where finite fields are used. As applications, we obtain several new types of MUMEBs in and prove that , which raises the lower bound of given in \cite{xu}.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Quantum-Dot Cellular Automata · Quantum Computing Algorithms and Architecture
