An infinite family of strongly unextendible mutually unbiased bases in $\mathbb{C}^{2^{2h}}$
Jonathan Jedwab, Lily Yen

TL;DR
This paper proves the conjecture that for all even integers m > 1, there exist 2^{m-1}+1 strongly unextendible mutually unbiased bases in complex spaces of dimension 2^m, challenging previous beliefs about their sizes.
Contribution
It establishes the existence of a new infinite family of strongly unextendible MUBs in dimensions 2^m for even m, using elementary linear algebra, and suggests larger possible sizes of MUB sets.
Findings
Proves the conjecture for all even m > 1.
Constructs an infinite family of strongly unextendible MUBs in dimensions 2^m.
Indicates that the maximum number of MUBs in non-prime-power dimensions may be larger than previously thought.
Abstract
A set of mutually unbiased bases (MUBs) in (for ) comprises vectors in , partitioned into orthogonal bases for such that the pairwise angle between all vectors from distinct bases is . The largest number of MUBs that can exist in is at most , but constructions attaining this bound are known only when is a prime power. A set of MUBs in that cannot be enlarged, even by the first vector of a potential -th MUB, is called strongly unextendible. Until now, only one infinite family of dimensions containing strongly unextendible MUBs in satisfying was known, this family, due to Sz\'ant\'o, is asymptotically "large" in the sense that as . However, the existence of …
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 · Finite Group Theory Research · graph theory and CDMA systems
