betaFeedback

WorksPhysics and Astronomy

No complete set of mutually unbiased bases in C^6 without Fourier vanishing

Abstract

A recent exact certificate shows that C^6 admits no seven mutually unbiased bases, hence at most five (OpenAI, 2026). That argument has two parts. The first proves the Fourier-vanishing conjecture of Matolcsi, Ruzsa and Weiner for every complex Hadamard matrix of order six other than Tao's cubic matrix, and excludes the cubic matrix separately. The second feeds this vanishing into a positivity certificate on mixed moments of a hypothetical complete family. We show that the first part is not needed. We keep the same six families of test functions and the same linear identities, but we never set a moment to zero because of Fourier vanishing. New positive definite integer matrices still give the contradiction. The only inputs are orthonormality, unbiasedness, the second-moment (2-design) identity of a complete family, and the trivial bound |moment| <= 1. A standard-library program checks the certificate in exact integer and rational arithmetic in under a minute and a half. We also record computational observations that are not part of the proof: a systematic S_6-symmetric family of test functions appears to close the argument with relations of total order at most 7 instead of 11, and at order 9 two orbit types of test charges appear to suffice. In the prime-power dimensions 4,5,7,8, where complete families exist, the same pipeline finds no certificate, as it must.

Introduction

Two orthonormal bases of Cd\mathbb{C}^{d} are mutually unbiased if every inner product between a vector of one and a vector of the other has modulus d−1/2d^{-1/2}. At most d+1d+1 bases of Cd\mathbb{C}^{d} can be pairwise mutually unbiased, and complete families of d+1d+1 such bases exist whenever dd is a prime power [2, 12]. Write N(d)N(d) for the maximal size of a mutually unbiased family in Cd\mathbb{C}^{d}. Dimension six is the smallest case outside the prime-power constructions. Zauner conjectured that N(6)=3N(6)=3 [13]. Weiner proved that dd mutually unbiased bases in Cd\mathbb{C}^{d} always extend to a complete family [11]. Hence N(6)≤5N(6) \le5 is equivalent to the non-existence of seven mutually unbiased bases in C6\mathbb{C}^{6}.

Several computer-assisted proofs addressing N(6)N(6) appeared in the autumn of 2026. OpenAI’s companion preprint [9] proves N(6)=3N(6) = 3 by a discretisation of the space of complex Hadamard matrices of order six. Its validity is stated under hypotheses on binary64 floating-point arithmetic and the compiler that ran the computation. Jaswal carried out an independent certified computation of that discretisation proof, again under a binary64-correctness hypothesis [3]. Cárdenes Wuttig and Tindall classify all triples of mutually unbiased bases in C6\mathbb{C}^{6} up to equivalence and show that none extends to a fourth basis; their proof is certified with interval arithmetic. They also give an analytic proof of the Fourier-vanishing conjecture discussed below [1]. Jaswal gives a further computer-assisted classification of triples and recovers that there are no four mutually unbiased bases [4].

The preprint [8] proves the weaker bound N(6)≤5N(6) \le5 with a certificate that uses only integer and rational arithmetic and has no floating-point hypothesis at all. The bound N(6)≤5N(6) \le5 is therefore not the news here. What is at stake is the structure of the exact certificate. That proof has two parts.

(A) Sections 3–5 of [8] prove the Fourier-vanishing conjecture of Matolcsi, Ruzsa and Weiner [7], which arose in the Fourier-analytic approach to mutually unbiased bases [6]: gH(πα)=0g_H(\pi\alpha) = 0 for α=(1,1,1,−1,−1,−1)\alpha= (1,1,1,-1,-1,-1) and every coordinate permutation π\pi, for every complex Hadamard matrix HH of order six that is not equivalent to Tao’s cubic matrix [10]. The steps are an exact single-matrix identity [8 (10)], the dichotomy [8 Corollary 3.1], a classification of the cubic alternative [8 Section 4], and an exclusion of the cubic matrix from complete families [8 Proposition 5.2].

(B) Section 6 of [8] is a positivity certificate on mixed moments of a hypothetical complete family. It uses the vanishing as an input [8 (27)].

The point of this note is that part (A) is not needed for the bound. Using the framework of [8 Sections 6–7] with the vanishing switched off, the obstruction is already visible from identities that hold in every dimension for every complete family. These are orthogonality, unbiasedness and the second-moment identity. The single-matrix theorem of [8] remains a result of independent interest. We only show that the complete-family exclusion does not depend on it.

Setting and the identities used

We use the notation and the probability space of [8 Section 6.1]. Bare equation numbers such as (12) or (27) refer to the numbering of [8]; this note has no numbered equations of its own. Suppose that B1,…,B7B_1,\ldots,B_7 are mutually unbiased orthonormal bases of C6\mathbb{C}^{6}. Choose a reference basis uniformly, a uniform permutation of its vectors, and a uniform bijection from the labels 0,…,50,\ldots,5 to the remaining bases. Let HsH_s be the transition matrices and gs=gHsg_s = g_{H_s} the normalised character sums [8 (1)]. Let M(s;a)\mathcal{M}(\mathbf{s};\mathbf{a}) be the mixed moments [8 (28)] and m(A)m(A) the ordered-pair injective moments [8 (29)]. All of these are real numbers of modulus at most one [8 (30)]. For a uniformly sampled column zz of H0H_0, the test functions are

F0(a)=g0(a)z−a,F1(a)=15∑s=15gs(a)z−aF_0(a) = g_0(a)z^{-a}, \qquad F_1(a) = \frac{1}{5}\sum_{s=1}^{5}g_s(a)z^{-a}

[8 (31)].

Identities used. We use exactly the following valid relations.

(R1) The contraction relations of [8 Lemma 3.2], eqs. (5) and (6). These come from orthogonality of a single transition matrix. We use the formal seven-row relations (6) generated from exponent matrices with seven formal rows, two to four columns and total order 7 to 11, enumerated as in [8 Section 7.2, (i)–(iii)]. (R2) The vanishing of every moment that has a charge of order one. This is row orthogonality, the first half of [8 (12)], and the first half of [8 Lemma 6.2(ii)]. When such a moment has a single label, its pair expansion is recorded as a homogeneous equation, as in [8 Section 7.3(ii)].

(R3) The singleton reduction [8 Lemma 6.2(iii), (34)]. It follows from the second-moment identity

∑s≠rgs(a)=0\sum_{s\ne r} g_s(a) = 0

for charges of order two [8 (12)]. This identity is the projective 2-design property of a complete family [5]. It is the only identity used that requires the family to be complete.

(R4) The symmetries [8 Lemma 6.2(i)] and the single-label expansion [8 Lemma 6.2(iv), (35)]. The latter is the equality-pattern expansion of [8 Lemma 3.3].

(R5) The mixed identities [8 (36), (37)], obtained from column orthogonality and unbiasedness, for all charge triples of total order at most 11, enumerated as in [8 Section 7.3].

(R6) The Gram formulas [8 Lemma 6.1] and the bounds [8 (30)].

Identities omitted. In contrast with [8 (27) and Lemma 6.2(ii)], no moment is set to zero because one of its charges is a permutation of α\alpha. Neither the identity [8 (10)], nor the dichotomy [8 Corollary 3.1], nor the classification of the cubic case [8 Section 4], nor the cubic-pair obstruction [8 Proposition 5.2] is used.

Lemma 1. For every set of seven mutually unbiased bases of C6\mathbb{C}^{6}, the relations (R1)(R1)–(R6)(R6) hold for the actual moment vector, whether or not the transition matrices satisfy [8 (27)].

Proof. [8 Lemma 6.2] is stated under (27). Its proof, however, invokes (27) only for the second half of part (ii). Parts (i), (iii), (iv) and (v) and the order-one half of (ii) are proved there from uniform sampling, from (12), from the equality-pattern expansion [8 Lemma 3.3], and from (13) and (14). [8 Lemma 3.2] concerns one Hadamard matrix and uses only its orthogonality. [8 Lemma 6.1] uses only the sampling. The bounds (30) hold because each moment averages products of unimodular numbers or of averages of them.

The certificate

Theorem 2. There do not exist seven mutually unbiased bases in C6\mathbb{C}^{6}. Hence N(6)≤5N(6) \le5.

The theorem follows from Weiner’s theorem [11] and the following finite statement.

Proposition 3. Let (λ,ws)(\lambda, w_{\mathrm{s}}) run over the six lists of [8 Section 6.3], unchanged, and let YλY_{\lambda} be the Young-symmetrised vectors of test functions [8 (39)]. Let ZλZ_{\lambda} be the symmetric integer matrices in the accompanying data file, given by their lower triangles as in [8 (38)]. Then:

(a) each ZλZ_{\lambda} is positive definite;

(b) using only (R1)(R1)–(R6)(R6), for every complete family,

5∑λE(Yλ∗ZλYλ)=f+∑ρ∈RβρXρ,5\sum_{\lambda}\mathbb{E}(Y_{\lambda}^{*}Z_{\lambda}Y_{\lambda})=f+\sum_{\rho\in R}\beta_{\rho}X_{\rho},

where each XρX_{\rho} is one of the original moments m(A)m(A) or M(s;a)\mathcal{M}(\mathbf{s};\mathbf{a}), and

f=−82160592753682338880≈−2.1132⋅1010,∑ρ∈R∣βρ∣=553168886932912960≈4.2683⋅108.f=-\frac{821605927536823}{38880}\approx-2.1132\cdot10^{10},\qquad \sum_{\rho\in R}\lvert\beta_{\rho}\rvert=\frac{5531688869329}{12960}\approx4.2683\cdot10^{8}.

Proof (computer-assisted, exact). The computation follows [8 Section 7] step by step, with the three changes listed below.

  1. The pair relations (R1) are generated and reduced by the contraction (5). Exact substitution rules are then certified by [8 Lemma 7.1]: modular elimination proposes the rules, and an exact integer check WP=0WP = 0 on the witness rows proves them.

  1. The mixed relations (R5) are generated for every charge triple of total order at most 11, after the reductions (R2)–(R4), and certified in the same way.

  1. Each YλY_\lambda is expanded by [8 (39)], and each Gram entry is replaced using [8 Lemma 6.1]. The factor 5 is the one in [8 (40)]. The reductions and the certified substitutions are then applied.

The changes relative to [8] are these. The zero rule for permutations of α\alpha is switched off. The coordinates are ordered by the default sort rather than by the priority lists of [8 Section 7.1]; this choice changes which coordinates are free, but adds no relation. The matrices ZλZ_\lambda are new. As noted in [8 Section 7.1], the value of f+∑ρ∣βρ∣f+\sum_\rho|\beta_\rho| depends on the coordinate order, and only its sign for the order actually used matters. The matrices ZλZ_\lambda here were computed for the default order, which the verifier fixes deterministically, so no priority list has to be supplied.

The pair table has 8871 nonzero equations, 909 coordinates and 897 witness rows, as in [8]. The mixed table has 40618 equations, 3583 coordinates and 2842 witness rows; with vanishing, [8] has 46041, 3429 and 2767. After substitution, 481 non-constant symbols remain: 10 pair moments, 320 two-label and 151 three-label mixed moments. All of them are irreducible original moments, and 21 of the mixed ones contain a permuted α\alpha. Under (27) these 21 would vanish; here they are bounded by 1 like all the others.

Positive definiteness is checked by exact rational Schur complements, as in [8 Section 7.4]. All 98 pivots are positive. The smallest pivot of each matrix lies between 0.97 and 11.6, for entries of size up to about 10910^9. The check is exact, so this small margin is immaterial. Real Gram forms with a positive definite real matrix are nonnegative on complex vectors. The bounds (30) then give

0≤5∑λE(Yλ∗ZλYλ)≤f+∑ρ∣βρ∣=−2012527152322099720<0,0 \le5\sum_\lambda\mathbb{E}(Y_\lambda^{*}Z_\lambda Y_\lambda) \le f+\sum_\rho|\beta_\rho|=-\frac{201252715232209}{9720}<0,

a contradiction. Every arithmetic step that certifies an equality or an inequality is integer or rational. □

The relative margin is large: ∑ρ∣βρ∣/∣f∣≈0.020\sum_\rho|\beta_\rho|/|f| \approx0.020, against ≈0.293\approx0.293 for the certificate of [8], which uses vanishing. Both ratios are invariant under rescaling of the matrices ZλZ_\lambda.

Verification

The verifier verify_d6.py and the data file cert_d6_data.json accompany this note. Their SHA-256 checksums are

8149c17e766767712fa6a1724a9d9f22154ce2f473df8b38a652aad19d86df19 (verify_d6.py)

2f7b602b28799008f78a28744ae6c0e0ee02633038b0f21bf8707a4c7080f3e7 (cert_d6_data.json)

The verifier uses only the Python standard library (Python ≥3.8\ge3.8) and regenerates every relation from scratch. The command is python3 -I verify_d6.py cert_d6_data.json. The internal checks are assertions, so the program refuses to run when assertions are disabled (-O or PYTHONOPTIMIZE); the final sign test f+∑ρ∣βρ∣<0f+\sum_\rho|\beta_\rho|<0 is an explicit check. On one core of a Linux workstation (Intel Core i7-13700KF) the run takes 45 s with CPython 3.10.12 and uses about 0.38 GB of memory. It prints the rank tables and the values of Proposition 3. An earlier revision of the verifier, without these two safeguards, printed the same output on a Linux cluster node with CPython 3.9.18 (82 s) and CPython 3.12.4 (69 s).

The program is an adaptation of the verifier printed in [8 Appendix A]. After normalising formatting, 34 of its functions are unchanged. These include the canonical forms, the contraction, the modular elimination and rational reconstruction, the exact substitution check, the Young-symmetrised test functions and the Gram tagging. The mathematical differences are exactly the following. The test for a permuted α\alpha always returns false. The single-matrix check of [8 (10)] is absent. No priority lists are used. The pivot test is p>0p > 0, the exact criterion for positive definiteness, instead of the margin p>40000p > 40000 of [8]. A key that never occurs in a relation is kept as a free symbol instead of raising an error. This is sound, because such a symbol is still an actual moment bounded by 1, and with the present data it never happens.

As a cross-check, an independent C++ re-implementation of the relation generation and exact elimination reproduces exactly the pair table, the mixed table of [8] with vanishing together with its published values of ff and ∑∣β∣\sum|\beta|, and the mixed table without vanishing used here. That program has not been run on the matrices ZλZ_\lambda of this note. The proof rests on verify_d6.py alone.

Remarks

Remark 4 (Lower order; computational observation). The six lists of [8] need relations of total order 11. With the vanishing switched off, our pipeline finds no certificate for them when all relations are cut at total order 9 or 10, nor when only the pair relations are cut at order 8. The rationalised bounds are then positive: +74.6, +77.5 and +3.66.

A systematic family does better. Take Young-symmetrised test functions yμFt(v)y_\mu F_t(v) for all partitions μ\mu of 6, with yμy_\mu acting on all six coordinates, t∈{0,1}t \in\{0,1\}, and vv running over balanced charges of order at most 3. Optionally split each block into its real and imaginary parts using Y(−a)=Y(a)‾Y(-a) = \overline{Y(a)}. With all relations of total order at most 9 (pair table 197/55/45, mixed table 5363/465/335), our pipeline produced exact rational upper bounds of −8.54, and of −9.57 with the split. A variant that keeps the relations as equality constraints with rational multipliers, instead of eliminating them, gave −9.97. Test functions symmetrised only over the five non-reference coordinates gave −13.24.

In each case the floating-point dual of a semidefinite program was rationalised, and the resulting bound was then evaluated exactly. These certificates have not yet been packaged as standalone data with a verifier, and they have not been independently checked. We therefore record them as a computational observation, not as part of the proof. With test charges of order at most 2 the corresponding semidefinite program was numerically feasible, so no certificate of this type was found at that order.

Remark 5 (Prime-power dimensions). The relation generator is written for a general dimension DD. It uses D+1D+1 formal rows in (R1), the factor 1/(D+1−l)1/(D+1-l) in (34), and the Gram weights D−1D-1 and D−2D-2. We ran the same pipeline with order-3 systematic test functions, in several symmetrisation variants, and relations of total order at most 11 for D=4,5,7,8D=4,5,7,8. In these dimensions complete families exist, so no certificate can exist. In every case the exact bound was positive, so the pipeline found no certificate, as it must. The positive values ranged from 6⋅10−86\cdot10^{-8} (D=4D=4) to 1.5⋅1031.5\cdot10^{3} (D=7D=7).

In several of these runs the semidefinite solver reported a slightly negative optimum, for example −1.2⋅10−6-1.2\cdot10^{-6} for D=5D=5. Only the exact evaluation decides. This is a consistency check of the generator and of the exact evaluation, not evidence about the strength of the method.

Further computational observations

The following refines Remark 4. Its status is that of a computational observation, not of a theorem. Each item was obtained with our independent C++ implementation of the relation generator (the program of the cross-check in § 4). The floating-point dual of a semidefinite program was rationalised, and the bound was then evaluated in exact rational arithmetic, in the variant of Remark 4 that keeps the relations as equality constraints with rational multipliers. The rationalised Gram matrices are checked to be positive semidefinite by exact elimination, and the bound f+∑ρ∣βρ∣f+\sum_{\rho}|\beta_{\rho}| is computed exactly; a negative value is a contradiction, provided that the generated relations are correct. The values depend on the normalisation of the matrices, so only their signs matter. None of these certificates has been packaged as standalone data with a verifier or checked independently, and none is used in the proof of Theorem 2.

The test functions are those of Remark 4: yμFt(v)y_{\mu}F_t(v) for all partitions μ\mu of 6, t∈{0,1}t\in\{0,1\}, and balanced charges vv of order at most 3, with each block split into real and imaginary parts. Up to permutation and negation, these charges fall into 11 orbit types. “Relation order” is the total order up to which (R1)–(R5) are generated. The vanishing (27) is never used.

  • (a) Relation order 7 suffices. With all relations of total order at most 7 (243 relation rows), the exact bound is −1.70<0-1.70<0; at order 8 it is −1.87-1.87.

  • (b) Two orbit types suffice at relation order 9. At relation order 9, if all test charges of type (2,1,−1,−1,−1,0)(2,1,-1,-1,-1,0), or all of type (2,1,−2,−1,0,0)(2,1,-2,-1,0,0), are removed, the pipeline finds no certificate; if any one of the other nine types is removed, it still finds one. The charges of these two types alone, with t∈{0,1}t\in\{0,1\} and all μ\mu, give the exact bounds −0.227-0.227 at relation order 9 and −0.943-0.943 at order 11. At relation order 7 the pipeline finds no certificate for these two types alone, whereas it does for the full family by (a).

  • (c) The single-matrix relations are not needed. Omitting from (R1) all formal seven-row relations (6) of [8 Lemma 3.2] still gives certificates, with exact bounds −9.88-9.88 at relation order 9 and −33.5-33.5 at order 11.

  • (d) The orbit of α\alpha is not needed. Removing all test charges that are permutations of α=(1,1,1,−1,−1,−1)\alpha=(1,1,1,-1,-1,-1) still gives certificates, with exact bounds −9.98-9.98 at relation order 9 and −28.98-28.98 at order 11. Conversely, for test charges of order at most 2 together with the orbit of α\alpha, the pipeline finds no certificate at relation order 9 or 11.

Data availability

The verifier verify_d6.py, the certificate data cert_d6_data.json, the checksums and the logs of the reference runs are included as ancillary files of the arXiv version of this note. The verifier is an adaptation of the verifier of [8], which is distributed under the Apache License 2.0; it is released under the Apache License 2.0, with the modifications listed in § 4. The certificate data are released under the Creative Commons Attribution 4.0 International licence (CC BY 4.0).

Use of AI

Claude Opus 5.5 (Anthropic) was used to write and run the code (the adaptation of the verifier, the relation generator and the semidefinite-programming pipeline). The authors take full responsibility for the content.

References

  1. [1]M. Cárdenes Wuttig and J. Tindall, Using topology to reveal all mutually unbiased bases in dimension six, arXiv:2611.06917 [quant-ph], 4 November 2026.
  2. [2]I. D. Ivanović, Geometrical description of quantal state determination, J. Phys. A: Math. Gen. 14 (1981), 3241–3245.
  3. [3]M. Jaswal, An independent certified computation excluding four mutually unbiased bases in dimension six, Zenodo preprint, version 2, 21 October 2026, https://doi.org/10.5281/zenodo.23533384.
  4. [4]M. Jaswal, Triplets of mutually unbiased bases in dimension six, Zenodo preprint, 6 November 2026, https://doi.org/10.5281/zenodo.23991331.
  5. [5]A. Klappenecker and M. Rötteler, Mutually unbiased bases are complex projective 2-designs, in Proc. 2005 IEEE International Symposium on Information Theory, 1740–1744, 2005.
  6. [6]M. Matolcsi, A Fourier analytic approach to the problem of mutually unbiased bases, Studia Sci. Math. Hungar. 49 (2012), 482–491.arxiv.org/abs/1009.2407
  7. [7]M. Matolcsi, I. Z. Ruzsa and M. Weiner, Systems of mutually unbiased Hadamard matrices containing real and complex matrices, Australas. J. Combin. 55 (2013), 35–47.
  8. [8]OpenAI, Exact Fourier certificates for complex Hadamard matrices of order six, OpenAI Math Release preprint, dated 24 September 2026 (released 6 October 2026), https://github.com/openai/math/tree/main/preprints/Exact-Fourier-certificates-for-complex-Hadamard-matrices-of-order-six-September-24-2026.
  9. [9]OpenAI, The maximum number of mutually unbiased bases in dimension six, OpenAI Math Release preprint, dated 24 September 2026 (released 6 October 2026), https://github.com/openai/math/tree/main/preprints/The-maximum-number-of-mutually-unbiased-bases-in-dimension-six-September-24-2026.
  10. [10]T. Tao, Fuglede’s conjecture is false in 5 and higher dimensions, Math. Res. Lett. 11 (2004), 251–258.DOI
  11. [11]M. Weiner, A gap for the maximum number of mutually unbiased bases, Proc. Amer. Math. Soc. 141 (2013), 1963–1969.arxiv.org/abs/0902.0635
  12. [12]W. K. Wootters and B. D. Fields, Optimal state-determination by mutually unbiased measurements, Ann. Physics 191 (1989), 363–381.DOI
  13. [13]G. Zauner, Quantum designs: foundations of a noncommutative design theory, Int. J. Quantum Inf. 9 (2011), 445–507.DOI

Paper details

vlnc:W_rmjpgyq3
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Claude Opus 5.5

View statement
Looking for related papers…
Contents