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:2507.07028

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, Mandal, Uddipto

Published Jul 9, 2025• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2507.07028

Related papers

Further Constructions of AMUBs for Non-prime power Composite Dimensions

Kumar, Ajeet, Subhamoy Maitra

Construction of a large class of Mutually Unbiased Bases (MUBs) for non-prime power composite dimensions ($d = k\times s$) is a long standing open problem, which leads to different construction methods for the class Approximate MUBs (AMUBs) by relaxing the criterion that the absolute value of the dot product between two vectors chosen from different bases should be $\leq \fracβ{\sqrt{d}}$. In this chapter, we consider a more general class of AMUBs (ARMUBs, considering the real ones too), compared to our earlier work in [Cryptography and Communications, 14(3): 527--549, 2022]. We note that the quality of AMUBs (ARMUBs) constructed using RBD$(X,A)$ with $|X|= d$, critically depends on the parameters, $|s-k|$, $μ$ (maximum number of elements common between any pair of blocks), and the set of block sizes. We present the construction of $\mathcal{O}(\sqrt{d})$ many $β$-AMUBs for composite $d$ when $|s-k|< \sqrt{d}$, using RBDs having block sizes approximately $\sqrt{d}$, such that $|\braket{ψ^l_i|ψ^m_j}| \leq \fracβ{\sqrt{d}}$ where $β= 1 + \frac{|s-k|}{2\sqrt{d}}+ \mathcal{O}(d^{-1}) \leq 2$. Moreover, if real Hadamard matrix of order $k$ or $s$ exists, then one can construct at least $N(k)+1$ (or $N(s)+1$) many $β$-ARMUBs for dimension $d$, with $β\leq 2 - \frac{|s-k|}{2\sqrt{d}}+ \mathcal{O}(d^{-1})< 2$, where $N(w)$ is the number of MOLS$(w)$. This improves and generalizes some of our previous results for ARMUBs from two points, viz., the real cases are now extended to complex ones too. The earlier efforts use some existing RBDs, whereas here we consider new instances of RBDs that provide better results. Similar to the earlier cases, the AMUBs (ARMUBs) constructed using RBDs are in general very sparse, where the sparsity $(ε)$ is $1 - \mathcal{O}(d^{-\frac{1}{2}})$.

arXiv:2402.04231•Feb 6, 2024•0 citations

More mutually unbiased bases

Mateo Cárdenes Wuttig, Joseph Tindall

Mutually unbiased bases (MUBs) describe quantum measurements for which certainty in one basis gives uniform outcomes in the others. Their maximum number remains unknown in dimensions that are not powers of a prime. We introduce an ansatz that, in many dimensions, allows us to construct more MUBs than have previously been found. Each basis in the ansatz consists of a diagonal phase matrix applied to a fixed unitary, which is a tensor product of Fourier matrices and, optionally, any real Hadamard matrix. This construction yields five MUBs in dimension 12, six in dimensions 48, 96, and 192, seven in dimensions 36 and 108, and ten in dimension 648. These bases can then be extended to exceed the tensor product bound, asymptotically, in every eighteenth dimension. Moreover, we show that Paley's real Hadamard matrix can be used to construct $q+1$ bases in dimension $d = q(q+1)$ for every prime power $q\equiv3\pmod4$. This count grows as $\sqrt d$ and cannot be exceeded by tensor products of smaller sets.

quant-pharXiv:2609.40311•Oct 1, 2026•2 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 $\mathbb{C}^{2^{2h}}$

Jonathan Jedwab, Lily Yen

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.

arXiv:1604.04797•Apr 16, 2016•3 citations

Measures to characterise Approximate Mutually Unbiased Bases

Ajeet Kumar, Uditanshu Sadual

Mutually Unbiased bases has various application in quantum information procession and coding theory. There can be maximum d + 1 MUBs in C^d and d/2 +1 MUBs in R^d. But , over R^d MUBs are known to be non existent when d is odd and for most of the other even d there are mostly 3 Real MUBs. In case of C^d the construction for complete set of MUBs are known for only Prime Power dimension. Thus in general large set of MUBs are not known, particularly for composite dimensions which are not of the form of prime powers. Because of this, there are many constructions of Approximate version of MUBs. In this paper we make an attempt to define certain measures to characterise the AMUBs. Our construction of measures derives its inspiration from the applications of MUBs, and based on them, we define certain quantifiable measures, which are can be computed and gives estimates of how close the Approximate MUBs are to the MUBs. We use geometric interpretation, projective design features of MUBs and applications like Optimal State determination and Entropic Uncertainty of MUBs. We show generic relationship between these measures and show that it can be evaluated for APMUBs without known the exact construction details, thereby showing that definition of APMUB is sufficient completely characterise it. We also evaluate these measure for an interesting class of AMUBs called Weak MUBs and certain AMUBs constructed using RBDs.

quant-pharXiv:2512.12828•Dec 16, 2025•0 citations

The mutually unbiased bases revisited

Monique Combescure

The study of Mutually Unbiased Bases continues to be developed vigorously, and presents several challenges in the Quantum Information Theory. Two orthonormal bases in $\mathbb C^d, B {and} B'$ are said mutually unbiased if $\forall b\in B, b'\in B'$ the scalar product $b\cdot b'$ has modulus $d^{-1/2}$. In particular this property has been introduced in order to allow an optimization of the measurement-driven quantum evolution process of any state $ψ\in \mathbb C^d$ when measured in the mutually unbiased bases $B\_{j} {of} \mathbb C^d$. At present it is an open problem to find the maximal umber of mutually Unbiased Bases when $d$ is not a power of a prime number. \noindent In this article, we revisit the problem of finding Mutually Unbiased Bases (MUB's) in any dimension $d$. The method is very elementary, using the simple unitary matrices introduced by Schwinger in 1960, together with their diagonalizations. The Vandermonde matrix based on the $d$-th roots of unity plays a major role. This allows us to show the existence of a set of 3 MUB's in any dimension, to give conditions for existence of more than 3 MUB's for $d$ even or odd number, and to recover the known result of existence of $d+1$ MUB's for $d$ a prime number. Furthermore the construction of these MUB's is very explicit. As a by-product, we recover results about Gauss Sums, known in number theory, but which have apparently not been previously derived from MUB properties.

arXiv:quant-ph/0605090•Contemporary mathematics - American Mathematical Society•Jan 1, 2007•27 citations
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.
Construction of a large class of Mutually Unbiased Bases (MUBs) for non-prime power composite dimensions (d=k×sd = k\times sd=k×s) is a long standing open problem, which leads to different construction methods for the class Approximate MUBs (AMUBs) by relaxing the criterion that the absolute value of the dot product between two vectors chosen from different bases should be ≤βd\leq \fracβ{\sqrt{d}}≤d​β​. In this chapter, we consider a more general class of AMUBs (ARMUBs, considering the real ones too), compared to our earlier work in [Cryptography and Communications, 14(3): 527--549, 2022]. We note that the quality of AMUBs (ARMUBs) constructed using RBD(X,A)(X,A)(X,A) with ∣X∣=d|X|= d∣X∣=d, critically depends on the parameters, ∣s−k∣|s-k|∣s−k∣, μμμ (maximum number of elements common between any pair of blocks), and the set of block sizes. We present the construction of O(d)\mathcal{O}(\sqrt{d})O(d​) many βββ-AMUBs for composite ddd when ∣s−k∣<d|s-k|< \sqrt{d}∣s−k∣<d​, using RBDs having block sizes approximately d\sqrt{d}d​, such that ∣⟨ψil∣ψjm⟩∣≤βd|\braket{ψ^l_i|ψ^m_j}| \leq \fracβ{\sqrt{d}}∣⟨ψil​∣ψjm​⟩∣≤d​β​ where β=1+∣s−k∣2d+O(d−1)≤2β= 1 + \frac{|s-k|}{2\sqrt{d}}+ \mathcal{O}(d^{-1}) \leq 2β=1+2d​∣s−k∣​+O(d−1)≤2. Moreover, if real Hadamard matrix of order kkk or sss exists, then one can construct at least N(k)+1N(k)+1N(k)+1 (or N(s)+1N(s)+1N(s)+1) many βββ-ARMUBs for dimension ddd, with β≤2−∣s−k∣2d+O(d−1)<2β\leq 2 - \frac{|s-k|}{2\sqrt{d}}+ \mathcal{O}(d^{-1})< 2β≤2−2d​∣s−k∣​+O(d−1)<2, where N(w)N(w)N(w) is the number of MOLS(w)(w)(w). This improves and generalizes some of our previous results for ARMUBs from two points, viz., the real cases are now extended to complex ones too. The earlier efforts use some existing RBDs, whereas here we consider new instances of RBDs that provide better results. Similar to the earlier cases, the AMUBs (ARMUBs) constructed using RBDs are in general very sparse, where the sparsity (ε)(ε)(ε) is 1−O(d−12)1 - \mathcal{O}(d^{-\frac{1}{2}})1−O(d−21​).
Mutually unbiased bases (MUBs) describe quantum measurements for which certainty in one basis gives uniform outcomes in the others. Their maximum number remains unknown in dimensions that are not powers of a prime. We introduce an ansatz that, in many dimensions, allows us to construct more MUBs than have previously been found. Each basis in the ansatz consists of a diagonal phase matrix applied to a fixed unitary, which is a tensor product of Fourier matrices and, optionally, any real Hadamard matrix. This construction yields five MUBs in dimension 12, six in dimensions 48, 96, and 192, seven in dimensions 36 and 108, and ten in dimension 648. These bases can then be extended to exceed the tensor product bound, asymptotically, in every eighteenth dimension. Moreover, we show that Paley's real Hadamard matrix can be used to construct q+1q+1q+1 bases in dimension d=q(q+1)d = q(q+1)d=q(q+1) for every prime power q≡3(mod4)q\equiv3\pmod4q≡3(mod4). This count grows as d\sqrt dd​ and cannot be exceeded by tensor products of smaller sets.
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.
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.
Mutually Unbiased bases has various application in quantum information procession and coding theory. There can be maximum d + 1 MUBs in C^d and d/2 +1 MUBs in R^d. But , over R^d MUBs are known to be non existent when d is odd and for most of the other even d there are mostly 3 Real MUBs. In case of C^d the construction for complete set of MUBs are known for only Prime Power dimension. Thus in general large set of MUBs are not known, particularly for composite dimensions which are not of the form of prime powers. Because of this, there are many constructions of Approximate version of MUBs. In this paper we make an attempt to define certain measures to characterise the AMUBs. Our construction of measures derives its inspiration from the applications of MUBs, and based on them, we define certain quantifiable measures, which are can be computed and gives estimates of how close the Approximate MUBs are to the MUBs. We use geometric interpretation, projective design features of MUBs and applications like Optimal State determination and Entropic Uncertainty of MUBs. We show generic relationship between these measures and show that it can be evaluated for APMUBs without known the exact construction details, thereby showing that definition of APMUB is sufficient completely characterise it. We also evaluate these measure for an interesting class of AMUBs called Weak MUBs and certain AMUBs constructed using RBDs.
The study of Mutually Unbiased Bases continues to be developed vigorously, and presents several challenges in the Quantum Information Theory. Two orthonormal bases in Cd,BandB′\mathbb C^d, B {and} B'Cd,BandB′ are said mutually unbiased if ∀b∈B,b′∈B′\forall b\in B, b'\in B'∀b∈B,b′∈B′ the scalar product b⋅b′b\cdot b'b⋅b′ has modulus d−1/2d^{-1/2}d−1/2. In particular this property has been introduced in order to allow an optimization of the measurement-driven quantum evolution process of any state ψ∈Cdψ\in \mathbb C^dψ∈Cd when measured in the mutually unbiased bases B_jofCdB\_{j} {of} \mathbb C^dB_jofCd. At present it is an open problem to find the maximal umber of mutually Unbiased Bases when ddd is not a power of a prime number. \noindent In this article, we revisit the problem of finding Mutually Unbiased Bases (MUB's) in any dimension ddd. The method is very elementary, using the simple unitary matrices introduced by Schwinger in 1960, together with their diagonalizations. The Vandermonde matrix based on the ddd-th roots of unity plays a major role. This allows us to show the existence of a set of 3 MUB's in any dimension, to give conditions for existence of more than 3 MUB's for ddd even or odd number, and to recover the known result of existence of d+1d+1d+1 MUB's for ddd a prime number. Furthermore the construction of these MUB's is very explicit. As a by-product, we recover results about Gauss Sums, known in number theory, but which have apparently not been previously derived from MUB properties.