Mutually Unbiased Bases in Non-Prime-Power Dimensions
Status Partially solved · unsolvedmath.comLLM status Open unverified
Top Open Problems openaiunknowngpt 6 astra ultraunknown Not reported cataloguedPartially solvedOpenStatement
Definitions and mathematical statement
Two orthonormal bases $B=(b_1,\ldots,b_D)$ and $C=(c_1,\ldots,c_D)$ of ${\mathbb{C}}^D$ are mutually unbiased if \[ |\langle b_i,c_j\rangle|^2=1/D\qquad(1\le i,j\le D). \] Let $M(D)$ be the greatest size of a collection of pairwise mutually unbiased orthonormal bases. The selected determination problem concerns composite dimensions that are not prime powers, especially $D=6$. In particular, decide whether $M(6)=7$ is possible, and determine the actual maximum. Bases are complex, with arbitrary entries; restricting entries to roots of unity or requiring a special construction would give only a subproblem. The standard general upper bound $M(D)\le D+1$ describes the meaning of a complete collection in the cited source.Formulation and concept references: [S1].
Short English statement
How many mutually unbiased complex bases can coexist in a non-prime-power dimension, particularly dimension six?Sources
- S1 Daniel McNulty and Stefan Weigert, Mutually Unbiased Bases in Composite Dimensions - A Review, Quantum 10, 2051 (2026), Abstract and Popular summary. https://quantum-journal.org/papers/q-2026-04-01-2051/. Formulation source.
Statement licence: CC-BY-SA-4.0 · Source file
Contributions 2
OpenAI claim summary for Phys-23
The theorem rules out the pair (d,k)=(6,7), but does not characterize all allowed pairs in non-prime-power dimensions. The theorem determines the existence pairs only at d=6, giving N(6)=3. The problem statement asks existence pairs across all dimensions, especially every non-prime-power dimension. This entry records partial support; complete coverage of the question is not established by this catalogue.
Mutually Unbiased Bases in Non-Prime-Power Dimensions
OpenAI's claim
The linked manuscripts present the following claims by OpenAI: Order-six Hadamard matrices outside the Tao class are claimed to satisfy the designated Fourier vanishing identities; exact certificates also exclude seven unbiased bases and imply an upper bound of five; The maximum MUB count in complex dimension six is claimed to be three, conditional on complete execution of the documented certified-arithmetic pipeline. Together they provide the following support within the scopes described below.Mathematical statement of the claimed result
Result 1.
The assertion excludes seven pairwise mutually unbiased orthonormal bases of $\mathbb C^6$. More explicitly, there are no bases $B_r=(b_{r,0},\ldots,b_{r,5})$, $1\le r\le7$, with \[ |\langle b_{r,i},b_{s,j}\rangle|^2=1/6 \qquad(r\ne s,\ 0\le i,j\le5). \] It does not by itself determine the maximum number below seven.Result 2.
For pairwise mutually unbiased bases, $|\langle b,c\rangle|^2=1/6$ whenever $b,c$ belong to different bases of $\mathbb C^6$. The source reports a computer-assisted exclusion of four such bases and concludes \[ N(6)=3, \] where $N(d)$ is their maximal number in dimension $d$. The result is explicitly conditional on the appendix's arithmetic/compiler requirements and the reported complete execution; those computational requirements are not omitted from the claim.Outline of the argument
Phase-invariant characters are rewritten as injective moments. Exact algebraic identities separate the Tao class, and integer/rational certificates verify the required moment inequalities; the supplied verifier and the completion theorem yield the stated MUB consequence.An exhaustive seed cover is refined into certified phase balls. Completion estimates within each ball exclude two additional bases, and finite recorded execution covers all arbitrary complex configurations under the stated binary64 and compiler conditions.
Formal verification
For family 266, the selected statements give Fourier cancellation outside the Tao class and a bound of five on the MUB family, with a further Hadamard-ratio cancellation lemma. They do not establish the claimed maximum of three or certify the binary64 four-basis exclusion. The listed Comparator files areHadamardCubeFiber.lean, MUBSix.lean. The inventory does not supply a named declaration for these Comparator entries. This site has not executed the Lean code. The scope descriptions do not certify the remaining manuscript arguments.Status caveat
OpenAI attributes these manuscripts to work by an internal model. Its release cautions that arguments without formalization can contain mistakes. This catalogue has not independently checked the proofs; the labels report the mathematical claims attributed to OpenAI.Sources
- OpenAI, Exact Fourier certificates for complex Hadamard matrices of order six, 2026-09-24; citation key
OAI:Exact-Fourier-certificates-for-complex-Hadamard-matrices-of-order-six-September-24-2026. PDF (GitHub); PDF (direct); Manuscript page and citation; Latest version; Statement source: thm:main. - OpenAI, The maximum number of mutually unbiased bases in dimension six, 2026-09-24; citation key
OAI:The-maximum-number-of-mutually-unbiased-bases-in-dimension-six-September-24-2026. PDF (GitHub); PDF (direct); Manuscript page and citation; Latest version; Statement source: thm:main. - Family 266: Lean scope.
- Comparator HadamardCubeFiber.json.
- Comparator HadamardCubeFiber.lean.
- Comparator MUBSix.json.
- Comparator MUBSix.lean.
- OpenAI catalogue entry.
gpt 6 astra ultra attempt on Phys-23
Mutually Unbiased Bases in Non-Prime-Power Dimensions
Definitions and mathematical statement
Two orthonormal bases $B=(b_1,\ldots,b_D)$ and $C=(c_1,\ldots,c_D)$ of ${\mathbb{C}}^D$ are mutually unbiased if \[ |\langle b_i,c_j\rangle|^2=1/D\qquad(1\le i,j\le D). \] Let $M(D)$ be the greatest size of a collection of pairwise mutually unbiased orthonormal bases. The selected determination problem concerns composite dimensions that are not prime powers, especially $D=6$. In particular, decide whether $M(6)=7$ is possible, and determine the actual maximum. Bases are complex, with arbitrary entries; restricting entries to roots of unity or requiring a special construction would give only a subproblem. The standard general upper bound $M(D)\le D+1$ describes the meaning of a complete collection in the cited source.Formulation and concept references: [S1].
Short English statement
How many mutually unbiased complex bases can coexist in a non-prime-power dimension, particularly dimension six?Research attempt
Scope and first unresolved step.
This GPT-6 Astra Ultra attempt, prepared on 27 September 2026, derives the universal upper bound, constructs three bases in dimension six, and tests extension through product structure and reduced density matrices. All entries may be arbitrary complex numbers. The work reconstructs standard partial results and explicitly separates them from determining $M(6)$.The 2026 review [S1] records the unresolved dimension-six problem. A relevant established restriction is stronger than merely failing to find a fourth product basis: McNulty--Weigert [E1] prove that a triple of mutually unbiased product bases in dimension six cannot be extended even by one mutually unbiased vector. Consequently, extending the particular product triple below is a closed route, not the general open problem. The remaining gap is a construction or obstruction for arbitrary collections of bases, with no product assumption; excluding seven alone would still not determine the exact maximum.
The upper bound through orthogonal matrix spaces.
For a unit vector $b$, let $P_b=bb^*$ be its rank-one projector. Work in the real inner-product space of traceless Hermitian $D\times D$ matrices, with inner product $\operatorname{tr}(AB)$. Its dimension is $D^2-1$.An orthonormal basis $B=(b_1,\ldots,b_D)$ gives the subspace \[ V_B=\operatorname{span}_{\mathbb R} \{P_{b_i}-I/D:1\le i\le D\}. \] It has dimension $D-1$: in the basis $B$ it is exactly the space of traceless real diagonal matrices. If $B,C$ are mutually unbiased, then \[ \operatorname{tr}\left((P_{b_i}-I/D)(P_{c_j}-I/D)\right) =|\langle b_i,c_j\rangle|^2-\frac1D=0. \] Hence their subspaces are orthogonal. For $r$ pairwise unbiased bases, \[ r(D-1)\le D^2-1,\qquad r\le D+1. \] This uses complex bases but a real vector space of Hermitian operators, so the dimension count is $D^2-1$, not twice that number. In dimension six it gives $M(6)\le7$.
Equality would decompose the entire traceless Hermitian space into seven mutually orthogonal five-dimensional diagonal subspaces. The count is necessary; it does not construct subspaces whose generators are compatible rank-one projectors.
Explicit small-dimensional ingredients.
In $\mathbb C^2$, take the standard basis and the columns of \[ X=\frac1{\sqrt2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}, \qquad Y=\frac1{\sqrt2}\begin{pmatrix}1&1\\ i&-i\end{pmatrix}. \] Their columns are orthonormal, and the squared cross-inner-products are $1/2$. Together with the upper bound they establish $M(2)=3$.For $\mathbb C^3$, put $\omega=e^{2\pi i/3}$ and define bases \[ C_a=\left\{\frac1{\sqrt3} \left(\omega^{aj^2+kj}\right)_{j=0}^{2}: k=0,1,2\right\},\qquad a=0,1,2. \] Each basis is orthonormal because the quadratic phase cancels in inner products within it. Each is unbiased to the standard basis because every entry has squared magnitude $1/3$.
For different $a,a'$, the relevant unnormalized overlap is $G=\sum_j\omega^{Aj^2+Bj}$ with $A\ne0$ modulo three. Expanding its squared magnitude and writing the difference of summation indices as $u$ gives \[ |G|^2=\sum_{u=0}^2\omega^{Au^2+Bu} \sum_{j=0}^2\omega^{2Auj}=3. \] Only $u=0$ contributes, since $2A$ is invertible modulo three. Normalization makes every squared overlap $1/3$. Thus these three bases and the standard one establish $M(3)=4$.
Tensor products give three bases in dimension six.
If $(B_\nu)$ are pairwise unbiased bases in $\mathbb C^a$ and $(C_\nu)$ are pairwise unbiased bases in $\mathbb C^b$, pairing the same number of them gives bases $B_\nu\otimes C_\nu$ in $\mathbb C^{ab}$. Indeed, \[ |\langle b\otimes c,b'\otimes c'\rangle|^2 =|\langle b,b'\rangle|^2|\langle c,c'\rangle|^2 =\frac1{ab} \] for vectors from different paired bases. Orthonormality within each tensor basis follows from the same factorization.Pair the standard, $X$, and $Y$ qubit bases with the standard qutrit basis, $C_0$, and $C_1$. This constructs three MUBs in dimension six and proves \[ 3\le M(6)\le7. \tag{435.1} \] The construction is exact; searching numerical entries is unnecessary for this lower bound.
A limit specific to direct tensor bases.
Suppose two bases of the form $B\otimes C$ and $B'\otimes C'$ are globally unbiased. Fix $b\in B$, $b'\in B'$, and $c\in C$, and sum their squared-overlap condition over $c'\in C'$. Orthonormality gives \[ |\langle b,b'\rangle|^2 =\sum_{c'}\frac1{ab}=\frac1a. \] The analogous sum gives unbiasedness of $C,C'$. Therefore a collection in which every basis is a direct tensor product has size at most $\min(M(a),M(b))$. For $2\times3$, it has size at most three.This statement assumes a whole basis splits into the same two local bases. More general orthonormal bases of product vectors can have a different structure, and arbitrary bases can contain entangled vectors. Neither is excluded by this elementary proof. The stronger theorem [E1] deals with triples of MU product bases; even that theorem does not classify all possible nonproduct triples.
A necessary entanglement condition, and why it is weak.
Suppose a unit vector $\psi\in\mathbb C^2\otimes\mathbb C^3$ were unbiased to all vectors in the constructed three tensor bases. Sum the six equal probabilities $1/6$ over the three qutrit outcomes for one fixed qubit outcome. This gives probability $1/2$ for each outcome in each of the standard, $X$, and $Y$ qubit measurements.Let $\rho$ be the reduced density matrix on the qubit. Writing \[ \rho=\tfrac12(I+r_x\sigma_x+r_y\sigma_y+r_z\sigma_z), \] those three uniform distributions force $r_x=r_y=r_z=0$. Thus $\rho=I/2$, and $\psi$ must have two equal Schmidt coefficients. This calculation gives a necessary condition on any attempted extension vector; it does not show that such a vector exists.
In fact having this reduced density matrix is far too weak. The six vectors \[ \psi_{\pm,j}=\frac{|0,j\rangle\pm|1,j+1\rangle}{\sqrt2}, \qquad j\in\mathbb Z/3\mathbb Z, \] form an orthonormal basis and each has qubit marginal $I/2$. Yet each has only two nonzero probabilities in the standard tensor basis, both $1/2$, rather than six probabilities $1/6$. Thus maximal entanglement does not satisfy the global unbiasedness equations. The impossibility theorem [E1] rules out the proposed extension altogether; the marginal calculation only illustrates one obstruction that a less complete argument would encounter.
Verification and outcome.
The local checks verify the small matrices' Gram matrices and all cross-modulus conditions, including the tensor triple. Numerical complex arithmetic is used to test the formulas; the root-of-unity sums above give exact proofs. The entangled-basis example is checked separately and is deliberately not reported as a fourth MUB.A unitary change of coordinates can normalize one arbitrary basis to the standard basis. It cannot justify assuming that an entire unknown triple has the special product form used here. Likewise failure within a root-of-unity search does not exclude arbitrary complex solutions.
UNRESOLVED. The bounds $435.1$, the direct-product restriction, and the marginal-state necessity are proved. The cited product-triple nonextension result is respected. Determining whether any unrestricted fourth through seventh bases can coexist, and hence the actual value of $M(6)$, remains unresolved in this attempt.
Sources
- S1 Daniel McNulty and Stefan Weigert, Mutually Unbiased Bases in Composite Dimensions - A Review, Quantum 10, 2051 $2026$, Abstract and Popular summary. https://quantum-journal.org/papers/q-2026-04-01-2051/. Formulation source.
- E1 D. McNulty and S. Weigert, On the Impossibility to Extend Triples of Mutually Unbiased Product Bases in Dimension Six, International Journal of Quantum Information 10 $2012$, 1250056. https://arxiv.org/abs/1203.6887. Nonextension for product triples, not an unrestricted dimension-six classification; consulted 27 September 2026.