Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1604.04797

An infinite family of strongly unextendible mutually unbiased bases in $\mathbb{C}^{2^{2h}}$

Jonathan Jedwab, Lily Yen

Published Apr 16, 2016• 3 citations
arXivHTMLPDF

Abstract

A set of $b$ mutually unbiased bases (MUBs) in $\mathbb{C}^d$ (for $d > 1$) comprises $bd$ vectors in $\mathbb{C}^d$, partitioned into $b$ orthogonal bases for $\mathbb{C}^d$ such that the pairwise angle between all vectors from distinct bases is $\arccos(1/\sqrt{d})$. The largest number $μ(d)$ of MUBs that can exist in $\mathbb{C}^d$ is at most $d+1$, but constructions attaining this bound are known only when $d$ is a prime power. A set of $b$ MUBs in $\mathbb{C}^d$ that cannot be enlarged, even by the first vector of a potential $(b+1)$-th MUB, is called strongly unextendible. Until now, only one infinite family of dimensions $d$ containing $b(d)$ strongly unextendible MUBs in $\mathbb{C}^d$ satisfying $b(d) < μ(d)$ was known, this family, due to Szántó, is asymptotically "large" in the sense that $b(d)/μ(d) \to 1$ as $d \to \infty$. However, the existence of $2^{m-1}+1$ strongly unextendible MUBs in $\mathbb{C}^{2^m}$ for each integer $m > 1$ has been conjectured by Mandayam et al. We prove their conjecture for all even values of $m$, using only elementary linear algebra. The existence of this "small" new infinite family suggests, contrary to widespread belief, that $μ(d)$ for non-prime-powers $d$ might be significantly larger than the size of particular unextendible sets.

DOI
10.48550/arxiv.1604.04797

Related papers

On Construction of Approximate Real Mutually Unbiased Bases for an infinite class of dimensions $d \not\equiv 0 \bmod 4$

Ajeet Kumar, Rakesh Kumar, Subhamoy Maitra +1 more

It is known that real Mutually Unbiased Bases (MUBs) do not exist for any dimension $d > 2$ which is not divisible by 4. Thus, the next combinatorial question is how one can construct Approximate Real MUBs (ARMUBs) in this direction with encouraging parameters. In this paper, for the first time, we show that it is possible to construct $> \lceil \sqrt{d} \rceil$ many ARMUBs for certain odd dimensions $d$ of the form $d = (4n-t)s$, $t = 1, 2, 3$, where $n$ is a natural number and $s$ is an odd prime power. Our method exploits any available $4n \times 4n$ real Hadamard matrix $H_{4n}$ (conjectured to be true) and uses this to construct an orthogonal matrix ${Y}_{4n-t}$ of size $(4n - t) \times (4n - t)$, such that the absolute value of each entry varies a little from $\frac{1}{\sqrt{4n-t}}$. In our construction, the absolute value of the inner product between any pair of basis vectors from two different ARMUBs will be $\leq \frac{1}{\sqrt{d}}(1 + O(d^{-\frac{1}{4}})) < 2$, for proper choices of parameters, the class of dimensions $d$ being infinitely large.

arXiv:2507.07028•Jul 9, 2025•0 citations

Unextendible mutually unbiased bases in prime-squared dimensions

Vishakh Hegde, Prabha Mandayam

A set of mutually unbiased bases (MUBs) is said to be unextendible if there does not exist another basis that is unbiased with respect to the given set. Here, we prove the existence of smaller sets of MUBs in prime-squared dimensions ($d=p^{2}$) that cannot be extended to a complete set using the generalized Pauli operators. We further observe an interesting connection between the existence of unextendible sets and the tightness of entropic uncertainty relations (EURs) in these dimensions. In particular, we show that our construction of unextendible sets of MUBs naturally leads to sets of $p+1$ MUBs that saturate both a Shannon ($H_{1}$) and a collision ($H_{2}$) entropic lower bound. Such an identification of smaller sets of MUBs satisfying tight EURs is crucial for cryptographic applications as well as constructing optimal entanglement witnesses for higher dimensional systems.

arXiv:1508.05892•Aug 24, 2015•5 citations

Mutually unbiased bases: polynomial optimization and symmetry

Sander Gribling, Sven C. Polak

A set of $k$ orthonormal bases of $\mathbb C^d$ is called mutually unbiased if $|\langle e,f\rangle |^2 = 1/d$ whenever $e$ and $f$ are basis vectors in distinct bases. A natural question is for which pairs $(d,k)$ there exist~$k$ mutually unbiased bases in dimension $d$. The (well-known) upper bound $k \leq d+1$ is attained when~$d$ is a power of a prime. For all other dimensions it is an open problem whether the bound can be attained. Navascués, Pironio, and Acín showed how to reformulate the existence question in terms of the existence of a certain $C^*$-algebra. This naturally leads to a noncommutative polynomial optimization problem and an associated hierarchy of semidefinite programs. The problem has a symmetry coming from the wreath product of $S_d$ and $S_k$. We exploit this symmetry (analytically) to reduce the size of the semidefinite programs making them (numerically) tractable. A key step is a novel explicit decomposition of the $S_d \wr S_k$-module $\mathbb C^{([d]\times [k])^t}$ into irreducible modules. We present numerical results for small $d,k$ and low levels of the hierarchy. In particular, we obtain sum-of-squares proofs for the (well-known) fact that there do not exist $d+2$ mutually unbiased bases in dimensions~$d=2,3,4,5,6,7,8$. Moreover, our numerical results indicate that a sum-of-squares refutation, in the above-mentioned framework, of the existence of more than $3$ MUBs in dimension $6$ requires polynomials of total degree at least~$12$.

arXiv:2111.05698•Nov 10, 2021•8 citations

Constructions of Mutually Unbiased Bases

Andreas Klappenecker, Martin Roetteler

Two orthonormal bases B and B' of a d-dimensional complex inner-product space are called mutually unbiased if and only if ||^2=1/d holds for all b in B and b' in B'. The size of any set containing (pairwise) mutually unbiased bases of C^d cannot exceed d+1. If d is a power of a prime, then extremal sets containing d+1 mutually unbiased bases are known to exist. We give a simplified proof of this fact based on the estimation of exponential sums. We discuss conjectures and open problems concerning the maximal number of mutually unbiased bases for arbitrary dimensions.

arXiv:quant-ph/0309120•Sep 15, 2003•120 citations

A gap for the maximum number of mutually unbiased bases

Mihály Weiner

A collection of pairwise mutually unbiased bases (in short: MUB) in d > 1 d>1 dimensions may consist of at most d + 1 d+1 bases. Such “complete” collections are known to exist in C d \mathbb {C}^d when d d is a power of a prime. However, in general, little is known about the maximum number N ( d ) N(d) of bases that a collection of MUB in C d \mathbb {C}^d can have. In this work it is proved that a collection of d d MUB in C d \mathbb {C}^d can always be completed. Hence N ( d ) ≠ d N(d)\neq d , and when d > 1 d>1 we have a dichotomy: either N ( d ) = d + 1 N(d)=d+1 (so that there exists a complete collection of MUB) or N ( d ) ≤ d − 1 N(d)\leq d-1 . In the course of the proof an interesting new characterization is given for a linear subspace of

arXiv:0902.0635•Proceedings of the American Mathematical Society•Jan 23, 2013•40 citations

On the Maximal Number of Real Mutually Unbiased Bases

Paweł Wocjan

In this note I point out that (1) pairs of real mutually unbiased bases (i.e., orthonormal bases of R^d) can only exist in dimensions 2 or d where d is a multiple of 4 and that (2) triples of real mutually unbiased bases can only exist for dimensions d that are also squares. For the case d=2^{2m} the maximal number of real MUBs is given by (d+2)/2 (this follows from known results on extremal euclidean line-sets). In the case d=s^2 where s is an even number that is not a power of 2, we have the lower bound N_MOLS(s)+2, where N_MOLS(s) denotes the maximal number of mutually orthogonal Latin square of order s, provided that there exists a Hadamard matrix of size s. It is not known how good this bound is. Moreover, I observe that the question of deciding if there always two real MUBs is equivalent to the Hadamard conjecture.

•Feb 3, 2005•1 citation
An infinite family of strongly unextendible mutually unbiased bases in C22h\mathbb{C}^{2^{2h}}C22h
A set of bbb mutually unbiased bases (MUBs) in Cd\mathbb{C}^dCd (for d>1d > 1d>1) comprises bdbdbd vectors in Cd\mathbb{C}^dCd, partitioned into bbb orthogonal bases for Cd\mathbb{C}^dCd such that the pairwise angle between all vectors from distinct bases is arccos⁡(1/d)\arccos(1/\sqrt{d})arccos(1/d​). The largest number μ(d)μ(d)μ(d) of MUBs that can exist in Cd\mathbb{C}^dCd is at most d+1d+1d+1, but constructions attaining this bound are known only when ddd is a prime power. A set of bbb MUBs in Cd\mathbb{C}^dCd that cannot be enlarged, even by the first vector of a potential (b+1)(b+1)(b+1)-th MUB, is called strongly unextendible. Until now, only one infinite family of dimensions ddd containing b(d)b(d)b(d) strongly unextendible MUBs in Cd\mathbb{C}^dCd satisfying b(d)<μ(d)b(d) < μ(d)b(d)<μ(d) was known, this family, due to Szántó, is asymptotically "large" in the sense that b(d)/μ(d)→1b(d)/μ(d) \to 1b(d)/μ(d)→1 as d→∞d \to \inftyd→∞. However, the existence of 2m−1+12^{m-1}+12m−1+1 strongly unextendible MUBs in C2m\mathbb{C}^{2^m}C2m for each integer m>1m > 1m>1 has been conjectured by Mandayam et al. We prove their conjecture for all even values of mmm, using only elementary linear algebra. The existence of this "small" new infinite family suggests, contrary to widespread belief, that μ(d)μ(d)μ(d) for non-prime-powers ddd might be significantly larger than the size of particular unextendible sets.
On Construction of Approximate Real Mutually Unbiased Bases for an infinite class of dimensions d≢0 mod 4d \not\equiv 0 \bmod 4d≡0mod4
It is known that real Mutually Unbiased Bases (MUBs) do not exist for any dimension d>2d > 2d>2 which is not divisible by 4. Thus, the next combinatorial question is how one can construct Approximate Real MUBs (ARMUBs) in this direction with encouraging parameters. In this paper, for the first time, we show that it is possible to construct >⌈d⌉> \lceil \sqrt{d} \rceil>⌈d​⌉ many ARMUBs for certain odd dimensions ddd of the form d=(4n−t)sd = (4n-t)sd=(4n−t)s, t=1,2,3t = 1, 2, 3t=1,2,3, where nnn is a natural number and sss is an odd prime power. Our method exploits any available 4n×4n4n \times 4n4n×4n real Hadamard matrix H4nH_{4n}H4n​ (conjectured to be true) and uses this to construct an orthogonal matrix Y4n−t{Y}_{4n-t}Y4n−t​ of size (4n−t)×(4n−t)(4n - t) \times (4n - t)(4n−t)×(4n−t), such that the absolute value of each entry varies a little from 14n−t\frac{1}{\sqrt{4n-t}}4n−t​1​. In our construction, the absolute value of the inner product between any pair of basis vectors from two different ARMUBs will be ≤1d(1+O(d−14))<2\leq \frac{1}{\sqrt{d}}(1 + O(d^{-\frac{1}{4}})) < 2≤d​1​(1+O(d−41​))<2, for proper choices of parameters, the class of dimensions ddd being infinitely large.
A set of mutually unbiased bases (MUBs) is said to be unextendible if there does not exist another basis that is unbiased with respect to the given set. Here, we prove the existence of smaller sets of MUBs in prime-squared dimensions (d=p2d=p^{2}d=p2) that cannot be extended to a complete set using the generalized Pauli operators. We further observe an interesting connection between the existence of unextendible sets and the tightness of entropic uncertainty relations (EURs) in these dimensions. In particular, we show that our construction of unextendible sets of MUBs naturally leads to sets of p+1p+1p+1 MUBs that saturate both a Shannon (H1H_{1}H1​) and a collision (H2H_{2}H2​) entropic lower bound. Such an identification of smaller sets of MUBs satisfying tight EURs is crucial for cryptographic applications as well as constructing optimal entanglement witnesses for higher dimensional systems.
A set of kkk orthonormal bases of Cd\mathbb C^dCd is called mutually unbiased if ∣⟨e,f⟩∣2=1/d|\langle e,f\rangle |^2 = 1/d∣⟨e,f⟩∣2=1/d whenever eee and fff are basis vectors in distinct bases. A natural question is for which pairs (d,k)(d,k)(d,k) there exist~kkk mutually unbiased bases in dimension ddd. The (well-known) upper bound k≤d+1k \leq d+1k≤d+1 is attained when~ddd is a power of a prime. For all other dimensions it is an open problem whether the bound can be attained. Navascués, Pironio, and Acín showed how to reformulate the existence question in terms of the existence of a certain C∗C^*C∗-algebra. This naturally leads to a noncommutative polynomial optimization problem and an associated hierarchy of semidefinite programs. The problem has a symmetry coming from the wreath product of SdS_dSd​ and SkS_kSk​. We exploit this symmetry (analytically) to reduce the size of the semidefinite programs making them (numerically) tractable. A key step is a novel explicit decomposition of the Sd≀SkS_d \wr S_kSd​≀Sk​-module C([d]×[k])t\mathbb C^{([d]\times [k])^t}C([d]×[k])t into irreducible modules. We present numerical results for small d,kd,kd,k and low levels of the hierarchy. In particular, we obtain sum-of-squares proofs for the (well-known) fact that there do not exist d+2d+2d+2 mutually unbiased bases in dimensions~d=2,3,4,5,6,7,8d=2,3,4,5,6,7,8d=2,3,4,5,6,7,8. Moreover, our numerical results indicate that a sum-of-squares refutation, in the above-mentioned framework, of the existence of more than 333 MUBs in dimension 666 requires polynomials of total degree at least~121212.
Two orthonormal bases B and B' of a d-dimensional complex inner-product space are called mutually unbiased if and only if ||^2=1/d holds for all b in B and b' in B'. The size of any set containing (pairwise) mutually unbiased bases of C^d cannot exceed d+1. If d is a power of a prime, then extremal sets containing d+1 mutually unbiased bases are known to exist. We give a simplified proof of this fact based on the estimation of exponential sums. We discuss conjectures and open problems concerning the maximal number of mutually unbiased bases for arbitrary dimensions.
A collection of pairwise mutually unbiased bases (in short: MUB) in d > 1 d>1 dimensions may consist of at most d + 1 d+1 bases. Such “complete” collections are known to exist in C d \mathbb {C}^d when d d is a power of a prime. However, in general, little is known about the maximum number N ( d ) N(d) of bases that a collection of MUB in C d \mathbb {C}^d can have. In this work it is proved that a collection of d d MUB in C d \mathbb {C}^d can always be completed. Hence N ( d ) ≠ d N(d)\neq d , and when d > 1 d>1 we have a dichotomy: either N ( d ) = d + 1 N(d)=d+1 (so that there exists a complete collection of MUB) or N ( d ) ≤ d − 1 N(d)\leq d-1 . In the course of the proof an interesting new characterization is given for a linear subspace of
In this note I point out that (1) pairs of real mutually unbiased bases (i.e., orthonormal bases of R^d) can only exist in dimensions 2 or d where d is a multiple of 4 and that (2) triples of real mutually unbiased bases can only exist for dimensions d that are also squares. For the case d=2^{2m} the maximal number of real MUBs is given by (d+2)/2 (this follows from known results on extremal euclidean line-sets). In the case d=s^2 where s is an even number that is not a power of 2, we have the lower bound N_MOLS(s)+2, where N_MOLS(s) denotes the maximal number of mutually orthogonal Latin square of order s, provided that there exists a Hadamard matrix of size s. It is not known how good this bound is. Moreover, I observe that the question of deciding if there always two real MUBs is equivalent to the Hadamard conjecture.