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

Information

Numerical Search for Extensions of Tensor-Product Mutually Unbiased Bases in Non-Prime-Power Composite Dimensions up to 100

Jeffery Wu, Ziyuan Liu, Shengjun Wu

Published Aug 19, 2026• 2 citations
Publisher

Abstract

For every prime-power dimension, a complete set of d+1 mutually unbiased bases (MUBs) is known, but in non-prime-power composite dimensions, the maximum number N(d) remains open. The tensor-product construction supplies mini(piai)+1 MUBs for d=∏ipiai, and this is the best lower bound currently known for every non-prime-power composite d≤100. We do not attempt to determine N(d); we ask whether these specific tensor-product sets admit one additional basis. We build and verify the sets for all 64 such dimensions, with pairwise overlap deviations below 10−15; run a construction-free joint search for d≤7; compare twelve optimizers; and test construction, convergence, and success thresholds. For a specified protocol A—algorithm, initialization distribution, success criterion, and stopping rule—let qA(d) denote the probability that one descent recovers a provably existing extension. Among the successful local-descent protocols tested, the inferred probabilities have comparable order, whereas the number of descents per computational budget differs much more strongly. With maxfun unbounded, exact gradients and optimization on U(d) recover guaranteed extensions at d=10,12, and 16. Raising the Riemannian CG iteration limit from 6000 to 150,000 changes none of the success counts or extension-search summaries. In d=6, the numerical failure to extend the tensor-product-basis triple reproduces a known analytic unextendibility theorem; it does not resolve the general four-MUB problem. Moreover, the actual extension target is maximally entangled. Haar-random initialization has zero probability of lying exactly on that structured submanifold, and the unrestricted search has not been validated for convergence to it, so recovery probabilities from the tensor-basis validation task cannot be transferred directly to the extension problem. The constructed bases, numerical summaries, per-restart arrays for the optimizer and threshold studies, complete per-descent arrays, and all code are publicly archived.

DOI
10.3390/info17080796

Related papers

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

Generalized Numerical Construction of MUBs: A Group Theoretical Investigation

B. Gültekin, S. B. Samuel, Z. Gedik

Mutually Unbiased Bases (MUBs) constitute a fundamental geometric structure in quantum theory, known for providing an optimal measurement scheme for quantum state tomography. In prime and prime-power dimensions, analytical constructions of maximal sets of MUBs are well-known and standard construction relies on the Weyl-Heisenberg (WH) group and finite fields. In non-prime-power dimensions, on the other hand, the existence of such maximal sets remains an open question. We present a generalized numerical method of constructing MUBs without any reliance on \textit{a priori} group structure or specific algebraic frameworks. Formulating the problem at the level of Gram matrix, we reduce the search for complete sets of d+1 MUBs to a phase space optimisation problem. We use the fact that the MUB Gram matrix is a projection matrix, and the third- and fourth-order trace constraints are necessary and sufficient conditions for a projection matrix. We further develop a classification framework based on third-order Bargmann invariants and automorphism groups, allowing us to probe the underlying algebraic and geometric structure of the resulting configurations. Numerical applications of this method in dimensions $3$, $4$, and $5$ demonstrate that all numerically constructed solutions are mutually isomorphic, are isolated points in phase space, and possess automorphism groups that coincide exactly with the Clifford group, the normalizer of the WH group. In the lowest non-prime-power dimension $6$ where the existence of a complete set remains open, our numerical search yields no solution. However, for incomplete sets of solutions, our search finds no set of four MUBs, but it yields several inequivalent triples, which we classify and whose neighbourhood we then investigate.

quant-pharXiv:2604.04164•Journal of Physics A Mathematical and Theoretical•Apr 7, 2026•0 citations

Mutually Unbiased Bases in Dimension Twelve: Tensor Saturation, Strong Unextendibility, and the Flat-Sum Trichotomy

Han-Jun Lim

Abstract Setting. The maximal number N(12) of mutually unbiased bases (MUBs) of C12 is unknown; no composite non-prime-power dimension has a known exact value. The quantum MacNeish (tensor) bound gives N(12) ≥ min{N(3),N(4)} = 4, and within Array Cosmology (AC) the integer 4 = k is the ququart rank of the rendering algebra R12 = M3(C)⊗ M4(C). This paper maps the d = 12 MUB landscape and states the tensor saturation conjecture N(12) = 4. Canonical sector. (i) Strong unextendibility [A]: no vector of C12 is unbiased to all four bases of the canonical product quadruple; the proof closes through an entanglement-forcing theorem, a flatness–circle-structure reduction, a monomial-rigidity step, and an atomic lemma whose ninebranches collapse to f = U+UV+V withexactminimum5/4 = (k+1)/k > 1. (ii)Localrigidity[A]: the canonical quadruple is rigid modulo its 191-dimensional gauge orbit; the Jacobian has exact rank 385 and exact nullity 191, certified by an explicit integer basis of the kernel verified in exact arithmetic, by modular arithmetic at p = 1000033, and by an independent gauge-dimension proof

•Jun 13, 2026•0 citations

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

Explicit constructions of mutually unbiased bases via Hadamard matrices

Jean-Christophe Pain

We present a detailed computational and algebraic study of Mutually Unbiased Bases (MUBs) in finite-dimensional Hilbert spaces, with a particular focus on dimensions 2, 3, 4, and the challenging case of 6. Starting from the Hadamard-phase parametrization, we derive explicit analytical conditions for mutual unbiasedness in dimension 4, providing a tractable system of trigonometric constraints on the phase parameters. We then explore a tensor-product construction via Pauli operators, highlighting the algebraic and group-theoretical origin of MUBs in two-qubit systems, and demonstrating how these constructions yield a complete set of 5 MUBs in dimension 4. Extending our approach, we investigate the Fourier-family method in dimension 6, where the absence of a prime-power structure imposes strong rigidity constraints and limits the known constructions to sets of 3 MUBs. We provide a systematic computational framework for testing candidate phase vectors, bridging the gap between analytical insight and numerical exploration. Finally, we generalize the discussion to arbitrary prime-power dimensions, emphasizing the role of finite-field structures, Heisenberg-Weyl operators, and discrete symmetries in generating complete sets of MUBs. Our work offers a transparent, line-by-line verification methodology, highlighting both the geometric and algebraic richness of MUBs, and clarifying why certain dimensions resist full analytical constructions. This study serves as a comprehensive resource for researchers seeking both theoretical understanding and practical construction of MUBs in quantum information science.

quant-pharXiv:2604.02234•Apr 3, 2026•0 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
For every prime-power dimension, a complete set of d+1 mutually unbiased bases (MUBs) is known, but in non-prime-power composite dimensions, the maximum number N(d) remains open. The tensor-product construction supplies mini(piai)+1 MUBs for d=∏ipiai, and this is the best lower bound currently known for every non-prime-power composite d≤100. We do not attempt to determine N(d); we ask whether these specific tensor-product sets admit one additional basis. We build and verify the sets for all 64 such dimensions, with pairwise overlap deviations below 10−15; run a construction-free joint search for d≤7; compare twelve optimizers; and test construction, convergence, and success thresholds. For a specified protocol A—algorithm, initialization distribution, success criterion, and stopping rule—let qA(d) denote the probability that one descent recovers a provably existing extension. Among the successful local-descent protocols tested, the inferred probabilities have comparable order, whereas the number of descents per computational budget differs much more strongly. With maxfun unbounded, exact gradients and optimization on U(d) recover guaranteed extensions at d=10,12, and 16. Raising the Riemannian CG iteration limit from 6000 to 150,000 changes none of the success counts or extension-search summaries. In d=6, the numerical failure to extend the tensor-product-basis triple reproduces a known analytic unextendibility theorem; it does not resolve the general four-MUB problem. Moreover, the actual extension target is maximally entangled. Haar-random initialization has zero probability of lying exactly on that structured submanifold, and the unrestricted search has not been validated for convergence to it, so recovery probabilities from the tensor-basis validation task cannot be transferred directly to the extension problem. The constructed bases, numerical summaries, per-restart arrays for the optimizer and threshold studies, complete per-descent arrays, and all code are publicly archived.
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.
Mutually Unbiased Bases (MUBs) constitute a fundamental geometric structure in quantum theory, known for providing an optimal measurement scheme for quantum state tomography. In prime and prime-power dimensions, analytical constructions of maximal sets of MUBs are well-known and standard construction relies on the Weyl-Heisenberg (WH) group and finite fields. In non-prime-power dimensions, on the other hand, the existence of such maximal sets remains an open question. We present a generalized numerical method of constructing MUBs without any reliance on \textit{a priori} group structure or specific algebraic frameworks. Formulating the problem at the level of Gram matrix, we reduce the search for complete sets of d+1 MUBs to a phase space optimisation problem. We use the fact that the MUB Gram matrix is a projection matrix, and the third- and fourth-order trace constraints are necessary and sufficient conditions for a projection matrix. We further develop a classification framework based on third-order Bargmann invariants and automorphism groups, allowing us to probe the underlying algebraic and geometric structure of the resulting configurations. Numerical applications of this method in dimensions 333, 444, and 555 demonstrate that all numerically constructed solutions are mutually isomorphic, are isolated points in phase space, and possess automorphism groups that coincide exactly with the Clifford group, the normalizer of the WH group. In the lowest non-prime-power dimension 666 where the existence of a complete set remains open, our numerical search yields no solution. However, for incomplete sets of solutions, our search finds no set of four MUBs, but it yields several inequivalent triples, which we classify and whose neighbourhood we then investigate.
Abstract Setting. The maximal number N(12) of mutually unbiased bases (MUBs) of C12 is unknown; no composite non-prime-power dimension has a known exact value. The quantum MacNeish (tensor) bound gives N(12) ≥ min{N(3),N(4)} = 4, and within Array Cosmology (AC) the integer 4 = k is the ququart rank of the rendering algebra R12 = M3(C)⊗ M4(C). This paper maps the d = 12 MUB landscape and states the tensor saturation conjecture N(12) = 4. Canonical sector. (i) Strong unextendibility [A]: no vector of C12 is unbiased to all four bases of the canonical product quadruple; the proof closes through an entanglement-forcing theorem, a flatness–circle-structure reduction, a monomial-rigidity step, and an atomic lemma whose ninebranches collapse to f = U+UV+V withexactminimum5/4 = (k+1)/k > 1. (ii)Localrigidity[A]: the canonical quadruple is rigid modulo its 191-dimensional gauge orbit; the Jacobian has exact rank 385 and exact nullity 191, certified by an explicit integer basis of the kernel verified in exact arithmetic, by modular arithmetic at p = 1000033, and by an independent gauge-dimension proof
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​).
We present a detailed computational and algebraic study of Mutually Unbiased Bases (MUBs) in finite-dimensional Hilbert spaces, with a particular focus on dimensions 2, 3, 4, and the challenging case of 6. Starting from the Hadamard-phase parametrization, we derive explicit analytical conditions for mutual unbiasedness in dimension 4, providing a tractable system of trigonometric constraints on the phase parameters. We then explore a tensor-product construction via Pauli operators, highlighting the algebraic and group-theoretical origin of MUBs in two-qubit systems, and demonstrating how these constructions yield a complete set of 5 MUBs in dimension 4. Extending our approach, we investigate the Fourier-family method in dimension 6, where the absence of a prime-power structure imposes strong rigidity constraints and limits the known constructions to sets of 3 MUBs. We provide a systematic computational framework for testing candidate phase vectors, bridging the gap between analytical insight and numerical exploration. Finally, we generalize the discussion to arbitrary prime-power dimensions, emphasizing the role of finite-field structures, Heisenberg-Weyl operators, and discrete symmetries in generating complete sets of MUBs. Our work offers a transparent, line-by-line verification methodology, highlighting both the geometric and algebraic richness of MUBs, and clarifying why certain dimensions resist full analytical constructions. This study serves as a comprehensive resource for researchers seeking both theoretical understanding and practical construction of MUBs in quantum information science.
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.