WorksPhysics and Astronomy
No complete set of mutually unbiased bases in dimension ten contains the Fourier pair or three product bases
Abstract
With computer-assisted proofs that admits at most three mutually unbiased bases (MUBs) now available, is the smallest dimension in which it is unknown whether a complete set of MUBs exists; only three MUBs are known. We prove that every triple of mutually unbiased product bases of is strongly unextendible: no vector is unbiased to all three bases. Consequently no set of four MUBs in dimension ten, and in particular no complete set, contains three product bases. This settles the case anticipated by McNulty, Pammer and Weigert; it was known only for the Heisenberg-Weyl triple. The proof covers all ten equivalence classes with explicit Nullstellensatz certificates modulo one prime on charts of for each class ( in all), transferred to characteristic zero by a projective reduction lemma, together with an independent rank certificate for eight of the ten classes. We also prove that the pair formed by the standard and the Fourier basis of is contained in no set of four MUBs. Exactly rays are unbiased to both bases (this confirms the count found numerically by Führ and Rzeszotnik), each of them is unbiased to at most eight of the others, and every triple formed by the pair and a third MUB is strongly unextendible. For this we certify cyclic -roots in Krawczyk uniqueness boxes, decide unimodularity exactly through an involution, and prove completeness by a four-dimensional interval branch-and-bound obtained from the Chinese-remainder splitting .
Introduction
Two orthonormal bases of are mutually unbiased if every inner product between a vector of one and a vector of the other has modulus . At most bases of can be pairwise mutually unbiased, and complete sets of mutually unbiased bases (MUBs) exist whenever is a prime power [16, 42]. Let denote the maximal size of a set of MUBs in . For every other the value of was open, and the smallest case, , resisted for decades [8]. In the autumn of 2026 several computer-assisted proofs of appeared [31, 17, 7, 18]. Dimension ten is now the smallest dimension in which is unknown: . By Weiner’s gap theorem [41], is equivalent to the non-existence of eleven MUBs.
Two families of configurations have shaped the work on dimension six, and both have natural analogues in dimension ten.
Product bases. For , McNulty and Weigert classified all mutually unbiased product bases, showed that no triple of them extends, and that a complete set contains at most one product basis [25, 26, 24]. For , McNulty, Pammer and Weigert showed that there are at most three mutually unbiased product bases and brought every such triple into a normal form [28 Thm. 2, Cor. 3]. Recalling that in dimension six no vector is unbiased to three mutually unbiased product bases, they wrote: “We expect similar results to hold for larger product dimensions such as , but we have not been able to generalize the proof for ” [28 after Cor. 6]; see also [40, 6]. For , Grassl, McNulty, Mišta and Paterek showed by computer algebra that the Heisenberg–Weyl triple is strongly unextendible [12] (see also [23]). The recent review by McNulty and Weigert asks whether the sets of mutually unbiased product bases giving the lower bound on in composite dimensions are unextendible, and records only as solved [30 Problem 10.8].
The Fourier pair. Grassl found that exactly 48 vectors are unbiased to both the standard basis and the Fourier basis , that they form 16 bases, and that no further vector is unbiased to , and any of them [14], [30 Thm. 7.6]; hence no four MUBs contain (see also [2], who note that Björck and coworkers had found the same vectors). Jaming, Matolcsi, Móra, Szöllősi and Weiner extended this to the two-parameter Fourier family [19]. The vectors unbiased to and are the biunimodular sequences of length , equivalently the unimodular cyclic -roots [3, 4, 15, 11]. For the cyclic system has 34,940 roots, a count obtained by Gröbner-basis computations modulo primes and by numerical homotopy methods [9, 10, 35, 37]. Führ and Rzeszotnik found numerically 3040 unimodular ones in ten symmetry orbits [11], and Magsino and Xu found the same number [22]. Grassl and Szöllősi announced a complete set of algebraic solutions to the cyclic-10 problem, noting that together with and they yield triples of MUBs [13]; the announcement does not address extensions to four MUBs, and to our knowledge the consequences for extending have not appeared in print. Sun recently studied completions of Fourier-type pairs in dimension [36].
We settle both questions in dimension ten. A set of bases is strongly unextendible if no unit vector is unbiased to all of its bases. We identify ; a product basis is an orthonormal basis consisting of product vectors .
Theorem A (product triples). Every triple of pairwise mutually unbiased product bases of is strongly unextendible.
In particular, Theorem A answers [30 Problem 10.8] for , in the strong sense.
Theorem B (the Fourier pair). Let be the standard basis and the Fourier basis of . Then:
(i) exactly 3040 rays are unbiased to both and ;
(ii) each of these rays is unbiased to at most 8 of the others; 2240 of them are unbiased to none;
(iii) there are no four MUBs in containing and ;
(iv) there are at most 1136 bases unbiased to both and , and for every such basis the triple is strongly unextendible.
Theorem B(iv) is the ten-dimensional analogue of Grassl’s result for .
Corollary C. No set of four MUBs in , and in particular no complete set, contains (a) three bases that are product bases for one tensor factorisation , or (b) a pair of bases equivalent to .
Here two pairs of bases are equivalent if one common unitary or antiunitary map carries the first pair to the second, up to phases, the order of the vectors and the order of the two bases; such maps preserve all moduli of inner products. Corollary C(a) follows from Theorem A because a fourth MUB would consist of vectors unbiased to all three product bases, and (b) is Theorem B(iii). Together with [28 Thm. 2], (a) lowers the upper bound on the number of product bases (for one factorisation) in a set of four or more MUBs in from three to two. Theorem A is the statement expected in [28 after Cor. 6].
The two results meet in one configuration. Under the Chinese-remainder identification the pair is a pair of product bases, and the 40 product rays unbiased to it are the Gaussian chirps with , (Remark 3). Theorem A excludes a fourth basis for every triple of product bases. Theorem B shows that for this particular pair every third basis, product or not, already blocks a fourth.
Neither result decides whether : a complete set need contain neither the Fourier pair nor three product bases. We return to this point in § 4.
Certification standard. Every computational step that the proofs use is exact (integer arithmetic, in particular modulo one prime, with identities that an independent program re-expands) or rigorous interval arithmetic with outward rounding. Non-rigorous floating-point computations were used only to find certificates and starting points, never to validate them. The root enclosures, the unimodularity decision and the overlap graphs were computed twice, with independent code and arithmetic, and the graphs agree bit for bit. Two steps have a single implementation: the clique enumeration on the conservative graphs (exact combinatorics) and the completeness step of Theorem B (§ 3.4). The logic of an earlier version of the latter was audited independently, and the audit’s blocking findings were fixed in the version used for all runs; we split it into 256 independent subproblems and record each completion. Theorem A uses as external input only the classification of [28], with the normalisation step from [5]; Theorem B uses none.
Product triples in
Classification
Let , and . The bases of that occur are and , , with entries ; together they form the complete set of six MUBs of . The qubit vectors are the eigenvectors of the Pauli operators . A label assignment with labels in defines three product bases
They are pairwise mutually unbiased if and only if the three label sets are pairwise disjoint; the two labels within one pair may coincide.
By the classification of McNulty, Pammer and Weigert [28 Cor. 3], every triple of mutually unbiased product bases of is equivalent to one of the form (1). Their equivalences include local complex conjugations. On the normal forms these are realised by global maps: since and with , conjugation of the factor alone acts on the three bases as the unitary , and conjugation of the qubit factor alone acts as the antiunitary , where is global complex conjugation. A simultaneous normalisation step uses the fact that in every pair of MUBs has a unique completion and the only rays unbiased to and are the 20 columns of [5 Sec. 4.1]. Hence strong unextendibility, which is invariant under common unitary or antiunitary maps, phases and permutations of vectors, needs to be checked only on the assignments (1).
There are admissible assignments, where is the number of bases whose two labels coincide and . The qubit Clifford group (generated by and , acting on the six qubit rays), the action of on the labels (generated by , and ), and global conjugation act on them by explicit integer permutations. The 4080 assignments form ten orbits (Table 1); we checked this by enumerating all six-tuples with integer arithmetic.
| orbit | labels | labels | labels | size | second proof |
| 0 | 60 | — | |||
| 1 | 60 | — | |||
| 2 | 720 | rank 975 | |||
| 3 | 180 | rank 975 | |||
| 4 | 180 | rank 975 | |||
| 5 | 720 | rank 975 | |||
| 6 | 720 | rank 975 | |||
| 7 | 720 | rank 975 | |||
| 8 | 480 | rank 987 | |||
| 9 | 240 | rank 987 |
Table 1. The ten classes of mutually unbiased product triples in . Orbit 0 is the Heisenberg–Weyl triple of [12]. All ten are covered by the chart certificates of § 2.5; the last column refers to the independent rank certificate of § 2.6.
Exact coefficients
Write for and let be the quadratic character of . Completing the square in the quadratic Gauss sum gives
For an assignment put , a matrix. By (2) each entry of is a twentieth root of unity with an explicit integer exponent table . All computations below start from these integer tables; no floating-point quantity enters any certificate.
Polynomial formulation
Let be a unit vector unbiased to and put . Unbiasedness to says for all ; unbiasedness to the -th vector of or says . Replacing $\bar z by a second vector of unknowns , the diagonal terms contribute , so the conditions become
These equations are bihomogeneous of bidegree and define a closed subscheme over . The point lies in . Hence Theorem A follows once for the ten representatives.
Reduction to one prime
Fix and the residue map , a primitive 20th root of unity modulo .
Lemma 1 (projective reduction). If under , then .
Proof. A complex point gives a point over a number field . Choose a prime of above the prime . Scale each of the two homogeneous coordinate vectors so that all coordinates are -integral and one is a unit; the bihomogeneous equations are preserved. Reducing modulo gives two nonzero vectors over a finite field of characteristic satisfying the reduced system.
Charts. On , either , and we may scale to (the affine chart: and the twenty , in 18 variables), or , in which case all ; choosing and forces , and we scale to , (the 90 boundary charts). These 91 charts cover . In each chart an identity over among the chart equations proves that the chart has no point over .
The certificates
For each of the ten representatives and each of its 91 charts we produced such an identity, 910 in total.
The 900 boundary identities were obtained with the
liftcommand of Singular [39] aftermsolve[29] and Singular had both found the reduced Gröbner basis .
For the ten affine charts Singular’s
liftran out of memory (at 6 GB per process; for orbit 0 also at 26 GB). We instead use the torus structure of the affine chart. Substituting turns the generators into Laurent polynomials in , and an identity with Laurent cofactors of bounded degree is found by solving a sparse Macaulay-type linear system modulo , restricted to a symmetry-adapted subspace; this takes a few seconds and less than 0.1 GB per orbit (for orbits 0, 1 the system has 1789 rows). Each Laurent identity is then rewritten exactly as a polynomial identity in the 18 affine variables, of the same form as the Singular output.
The certificates were verified independently of how they were found. A short program expands every product with integer arithmetic modulo and checks that the sum is the constant 1. It reads the chart equations from inputs that a verification script regenerates from the exact exponent tables, and it requires that these inputs coincide byte for byte with the inputs given to the certificate search. All 910 identities pass (the largest affine identity has 479,691 cofactor terms). Modified certificates, such as swapped cofactors, a single altered coefficient, or the certificate of one orbit applied to another orbit, are rejected.
Proof of Theorem A. By the classification, a unit vector unbiased to a mutually unbiased product triple gives, after a common unitary or antiunitary map, a unit vector unbiased to one of the ten representatives, hence a complex point of the corresponding . The 91 verified chart identities show , and Lemma 1 gives , a contradiction.
An independent second proof for eight classes
Work in , bigraded by , , . The Weyl operators and preserve each of as sets of rays and therefore permute the up to phases; the resulting action of on the balanced components commutes with reduction modulo , because the stabiliser orders are units. If the multiplication map by the -projected generators has full row rank modulo , a nonzero maximal minor lifts to characteristic zero and . Evaluating at , , gives . At the matrices have full row rank 975 (orbits 2–7) and 987 (orbits 8, 9); square witnesses are part of the data. For orbits 0, 1 the rank at is 972 < 975, so this route does not apply to them; they are covered by the chart certificates above.
Remark 2 (Galois conjugate classes). The chart equations depend on the exponent table only through the row differences . The automorphism of maps the multiset of rows of the table of orbit 0, up to a phase per row, onto that of orbit 1, and similarly orbit 3 onto orbit 4 (checked with exact integer arithmetic). The corresponding systems are Galois conjugate, so their complex points correspond. Either member of each pair would therefore have sufficed.
The Fourier pair
Let and .
Cyclic 10-roots
Let be unbiased to and . Then has unimodular entries, and we fix the phase by . Unbiasedness to means for all . Since with the periodic autocorrelation and , this holds if and only if for . Put (indices modulo 10). As ,
Conversely, every root of the cyclic 10-roots system
with all defines , , consistently around the cycle. This is Björck’s correspondence [3]: rays unbiased to and are in bijection with unimodular roots of (4).
The number of roots
The cyclic 10-roots system is known computationally to have 34,940 roots: Gröbner-basis computations modulo the prime 32003 [35] and over a prime field (typically ) [10] give a zero-dimensional ideal with quotient of dimension 34,940, cyclic 10-roots is a standard benchmark of the F5 algorithm [9], numerical irreducible decomposition finds 34,940 isolated solutions [37], a Gröbner basis over has been computed by multi-modular methods [32], and Grassl and Szöllősi announced a complete set of algebraic solutions [13]. We do not use this count: below we prove that there are at least 34,940 distinct roots, and in § 3.4 we prove directly that the unimodular ones are exactly the certified 3040.
Certified enclosures of 34,940 roots
We start from the 1747 approximate representatives published with PHCpack [33] and expand them by the dihedral symmetry of (4) to 34,940 approximate roots; these serve only as starting points. For each, after a Newton polish, we apply Krawczyk’s test [21, 27, 34]: with the approximate root, and a box ,
implies that contains exactly one root, and that this root lies in . Complex rectangular interval arithmetic on encloses the real interval Jacobian on , so the real theorem applies. We ran two independent implementations:
a C++ program with double-precision intervals, in which every operation is rounded to nearest and then widened outward by one unit in the last place, compiled without floating-point contraction;
a SageMath program [38] in which the system and its Jacobian are built symbolically over and evaluated in Arb ball arithmetic [1] at 160 bits, with dyadic boxes whose endpoints are exact.
Both certify all 34,940 boxes (the C++ enclosures have width below ), and both find the enclosures pairwise disjoint. Hence (4) has at least 34,940 distinct roots. The C++ program checks its floating-point environment (binary64, round to nearest, gradual underflow) at run time and records the compiler; both programs exit with an error unless all 34,940 boxes are certified, every root is classified, the enclosures are disjoint and the degree bound below holds.
Exact unimodularity. The map permutes the roots of (4), since and . A root is unimodular if and only if it is fixed by . If the interval image of an enclosure lies in the uniqueness box , the root is fixed, by uniqueness in ; if some enclosure of excludes 1, it is not. This decides every certified root: exactly 3040 are unimodular and 31,900 are not, in both implementations.
All biunimodular vectors of length ten
We now show, without using the total number of roots, that the 3040 certified rays are all rays unbiased to and .
Reduction. Identify by and write for even and for odd . With , and , the discrete Fourier transform of at the frequency is . Hence is biunimodular if and only if
If the last two conditions give with (boxes on which may vanish are treated separately in the search below). After normalising , a choice of on the unit circle and of signs determines , and biunimodularity becomes the five equations in four real unknowns.
Symmetry. A modulation fixes and maps to ; the dilation maps to . Since , every biunimodular ray is the image of one with , and . The certified set is closed under these maps; we check this by mapping the root enclosures and finding their images inside certified uniqueness boxes.
Search. Each , , is parametrised by two overlapping rational charts , ; with the sign patterns this gives four-dimensional subproblems. A box is excluded if an interval or mean-value enclosure (computed with interval automatic differentiation) of some residual misses 0, or if the symmetry inequalities fail on the whole box. Where the direction of is not resolved, or is small, is computed instead from two of the linear equations that imposes on it, and the conditions and are kept as residuals. A box is covered if a Krawczyk test on a slightly inflated box certifies a unique zero of four of the residuals, and that zero is either excluded by the remaining residuals or mapped by into a certified uniqueness box of a cyclic 10-root. Every other box is bisected. All 256 subproblems terminate with no unresolved box: boxes in the certifying runs, about 2000 core-hours in total including duplicated runs (the subproblems are independent; they were run on a server, a cluster and a workstation with three compilers, all from one source file identified by its SHA-256 hash).
Overlap graphs
For the 3040 rays we enclose all overlaps . Let and be the graphs of genuinely orthogonal and genuinely unbiased pairs. Let join unless the enclosure of excludes 0, and let join them unless it excludes . Then and . The enclosures have width at most , and the excluded pairs are far from the thresholds: every pair not in has , every pair not in has , and no pair lies in both graphs. has 57,680 edges and has 3200. The edge sets computed by the two implementations agree bit for bit.
A symmetry group of the pair, of order 1600 [11] (generated by the cyclic shift, the modulation , the dilation , complex conjugation and the Fourier transform) acts on the rays; numerically the 3040 rays form ten orbits of the sizes found in [11]. Table 2 lists the degrees in the conservative graphs along this orbit decomposition. The proof uses only the degree bounds, not the orbits.
| orbit size | degree in | degree in | remark |
| 20, 20 | 144 | 0 | the 40 product rays (Gaussian chirps) |
| 200, 200 | 44 | 0 | |
| 200 | 28 | 0 | |
| 400, 400 | 52 | 8 | the only rays that may have unbiased partners |
| 400, 400 | 28 | 0 | |
| 800 | 28 | 0 |
Table 2. The 3040 rays unbiased to and , grouped by (numerically identified) symmetry orbit, with their degrees in the conservative graphs and . A degree 0 in is exact; a positive degree is an upper bound.
Proof of Theorem B. (i) follows from § 3: the 3040 certified unimodular roots are distinct, and by § 3.4 every biunimodular ray is one of them; (ii) is read off from . For (iii), suppose are MUBs. All vectors of and are among the 3040 rays, and for any the ten rays of are unbiased to , so has degree at least 10 in , hence in , contradicting (ii). For (iv), a basis unbiased to and is a 10-clique of the orthogonality graph . An exhaustive enumeration finds exactly 1136 ten-cliques in , so there are at most 1136 such bases, and for each of these cliques the common -neighbourhood of its ten vertices is empty.
A vector unbiased to , and would be one of the 3040 rays and would lie in that common neighbourhood.
Remark 3. Under (mod 10) the chirp factorises as , a product of a qubit vector unbiased to and and a column of some . These 40 rays are exactly the product rays unbiased to the pair; their mutual overlaps lie in . Among the 1136 candidate third bases, 16 consist of product rays, and numerically the other 1120 each lie inside a single orbit. All 1136 have pairwise inner products of modulus below numerically; we have not certified their exact orthonormality, and Theorem B(iv) does not need it. The candidate with ten rays from the eigenbasis of recovers the Heisenberg–Weyl triple of [12].
Remark 4 (second moments do not suffice). A complete set is a complex projective 2-design [20], so the 90 rays of the other nine bases would satisfy with . The linear relaxation over the 3040 rays is feasible numerically (residual ), even with no weight on product rays. The obstruction of Theorem B is therefore not visible at the level of the 2-design identity; it comes from the sparse unbiasedness graph.
Discussion
Corollary C removes two natural candidates for a complete set in , but it does not show . Since the set of pairs of bases that extend to four MUBs is closed (the set of quadruples of MUBs is compact), Theorem B also gives an open neighbourhood of in which no pair extends to four MUBs; making this neighbourhood explicit would be of interest. A complete set might contain neither the Fourier pair nor three product bases. Other pairs of the form with a complex Hadamard matrix of order ten generally come in continuous families, whose unbiased vectors need not be finite in number. In dimension six the result for [14] was later extended to the whole Fourier family [19] and eventually to all triples [7, 18]. Extending Theorem B from to its affine families is the natural next step in dimension ten.
The certification techniques are standard (rigorous numerical certification was used for in [19] (discretisation with explicit error bounds) and [7] (interval and ball arithmetic), and Gröbner-basis arguments in [14, 23]); we do not claim novelty for them. Two details may still be useful. Laurent Nullstellensatz certificates on the torus chart replace a memory-bound Gröbner lift by a small sparse linear solve. Certified root enclosures, an involution that detects the unimodular locus exactly, and a low-dimensional interval branch-and-bound from a Chinese-remainder splitting give finite, checkable lists of vectors unbiased to a pair whose unbiased set is finite, without using the degree of the system.
Data availability
The programs that generate the inputs and verify all certificates, the lists of SHA-256 checksums of every certificate file, the logs of the verification runs, the logs of all branch-and-bound runs and the script that merges them (it checks that every one of the 256 subproblems finished without an unresolved box, under one source file and one input file identified by their SHA-256 hashes) are included as ancillary files of the arXiv version. The certificates themselves (910 chart identities, eight rank witnesses and the root enclosures; about 0.6 GB compressed) will be deposited in a public repository, with the DOI added in a revised version; until then they are available from the authors on request.
Use of AI
Claude Opus 5.5 was used for coding and for optimizing the speed of the algorithms.
References
- [1]F. Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic, IEEE Trans. Comput. 66 (2017), 1281–1292.arxiv.org/abs/1611.02831
- [2]I. Bengtsson, W. Bruzda, Å. Ericsson, J.-Å. Larsson, W. Tadej and K. Życzkowski, Mutually unbiased bases and Hadamard matrices of order six, J. Math. Phys. 48 (2007), 052106.DOI
- [3]G. Björck, Functions of modulus 1 on Zₙ whose Fourier transforms have constant modulus, and “cyclic n-roots”, in Recent Advances in Fourier Analysis and its Applications, NATO Adv. Sci. Inst. Ser. C 315, Kluwer, 1990, 131–140.
- [4]G. Björck and R. Fröberg, A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic n-roots, J. Symbolic Comput. 12 (1991), 329–336, doi:10.1016/S0747-7171(08)80153-8.
- [5]S. Brierley, S. Weigert and I. Bengtsson, All mutually unbiased bases in dimensions two to five, Quantum Inf. Comput. 10 (2010), 803–820.arxiv.org/abs/0907.4097
- [6]D. Cariello, Schmidt rank constraints in quantum information theory, Lett. Math. Phys. 111 (2021), 86, doi:10.1007/s11005-021-01434-w.DOI
- [7]M. Cárdenes Wuttig and J. Tindall, Using topology to reveal all mutually unbiased bases in dimension six, arXiv:2611.06917 [quant-ph], 2026.arxiv.org/abs/2611.06917
- [8]T. Durt, B.-G. Englert, I. Bengtsson and K. Życzkowski, On mutually unbiased bases, Int. J. Quantum Inf. 8 (2010), 535–640.DOI
- [9]J.-C. Faugère, A new efficient algorithm for computing Gröbner bases without reduction to zero (F5), in Proc. ISSAC 2002, ACM, 2002, 75–83, doi:10.1145/780506.780516.DOI
- [10]J.-C. Faugère and J. Svartz, Gröbner bases of ideals invariant under a commutative group: the non-modular case, in Proc. ISSAC 2013, ACM, 2013, 347–354, doi:10.1145/2465506.2465944.DOI
- [11]H. Führ and Z. Rzeszotnik, On binunimodular vectors for unitary matrices, Linear Algebra Appl. 484 (2015), 86–129, doi:10.1016/j.laa.2015.06.019.DOI
- [12]M. Grassl, D. McNulty, L. Mišta and T. Paterek, Small sets of complementary observables, Phys. Rev. A 95 (2017), 012118, doi:10.1103/PhysRevA.95.012118.DOI
- [13]M. Grassl (joint work with F. Szöllősi), Circulant complex Hadamard matrices of order 10, invited talk, Hadamard 2020+2 workshop, Kraków, 27 June 2022, book of abstracts, p. 7 (announcement).
- [14]M. Grassl, On SIC-POVMs and MUBs in dimension 6, in Proc. ERATO Conference on Quantum Information Science, Tokyo, 2004, 60–61; arXiv:quant-ph/0406175.
- [15]U. Haagerup, Cyclic p-roots of prime lengths p and related complex Hadamard matrices, arXiv:0803.2629, 2008.arxiv.org/abs/0803.2629
- [16]I. D. Ivanović, Geometrical description of quantal state determination, J. Phys. A: Math. Gen. 14 (1981), 3241–3245.
- [17]M. Jaswal, An independent certified computation excluding four mutually unbiased bases in dimension six, Zenodo preprint, 2026, https://doi.org/10.5281/zenodo.23533384.
- [18]M. Jaswal, Triplets of mutually unbiased bases in dimension six, Zenodo preprint, 2026, https://doi.org/10.5281/zenodo.23991331.
- [19]P. Jaming, M. Matolcsi, P. Móra, F. Szöllősi and M. Weiner, A generalized Pauli problem and an infinite family of MUB-triplets in dimension 6, J. Phys. A: Math. Theor. 42 (2009), 245305.DOI
- [20]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.
- [21]R. Krawczyk, Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken, Computing 4 (1969), 187–201.DOI
- [22]M. Magsino and Y. Xu, A nonlinear sum of squares search for CAZAC sequences, in 2023 IEEE Radar Conference (RadarConf23), 2023, 1–6, doi:10.1109/RadarConf2351548.2023.10149667.DOI
- [23]P. Mandayam, S. Bandyopadhyay, M. Grassl and W. K. Wootters, Unextendible mutually unbiased bases from Pauli classes, Quantum Inf. Comput. 14 (2014), 823–844, doi:10.26421/QIC14.9-10-8.DOI
- [24]D. McNulty and S. Weigert, On the impossibility to extend triples of mutually unbiased product bases in dimension six, Int. J. Quantum Inf. 10 (2012), 1250056, doi:10.1142/S0219749912500566.DOI
- [25]D. McNulty and S. Weigert, All mutually unbiased product bases in dimension 6, J. Phys. A: Math. Theor. 45 (2012), 135307.DOI
- [26]D. McNulty, B. Pammer and S. Weigert, The limited role of mutually unbiased product bases in dimension 6, J. Phys. A: Math. Theor. 45 (2012), 102001.DOI
- [27]R. E. Moore, A test for existence of solutions to nonlinear systems, SIAM J. Numer. Anal. 14 (1977), 611–615.DOI
- [28]D. McNulty, B. Pammer and S. Weigert, Mutually unbiased product bases for multiple qudits, J. Math. Phys. 57 (2016), 032202, doi:10.1063/1.4943301.DOI
- [29]J. Berthomieu, C. Eder and M. Safey El Din, msolve: a library for solving polynomial systems, in Proc. ISSAC 2021, ACM, 2021, 51–58.
- [30]D. McNulty and S. Weigert, Mutually unbiased bases in composite dimensions – a review, Quantum 10 (2026), 2051, doi:10.22331/q-2026-04-01-2051.DOI
- [31]OpenAI, The maximum number of mutually unbiased bases in dimension six, OpenAI Math Release preprint, 2026, https://github.com/openai/math/tree/main/preprints/The-maximum-number-of-mutually-unbiased-bases-in-dimension-six-September-24-2026.
- [32]B. Parisse, Computing huge Gröbner basis like cyclic10 over ℚ with Giac, arXiv:1903.12427, 2019.arxiv.org/abs/1903.12427
- [33]J. Verschelde, Algorithm 795: PHCPack: a general-purpose solver for polynomial systems by homotopy continuation, ACM Trans. Math. Software 25 (1999), 251–276; cyclic 10-roots data at https://homepages.math.uic.edu/~jan/Demo/cyclic10.html.DOI
- [34]S. M. Rump, Solving algebraic problems with high accuracy, in A New Approach to Scientific Computation, Academic Press, 1983, 51–120.
- [35]A. Steel, Allan Steel’s Gröbner basis timings page, https://magma.maths.usyd.edu.au/users/allan/gb/ (accessed 16 November 2026).
- [36]H.-Y. Sun, Mutually unbiased bases: common states, completion, and extension obstructions, arXiv:2610.12180, 2026.arxiv.org/abs/2610.12180
- [37]A. J. Sommese, J. Verschelde and C. W. Wampler, Numerical decomposition of the solution sets of polynomial systems into irreducible components, SIAM J. Numer. Anal. 38 (2001), 2022–2046, doi:10.1137/S0036142900372549.DOI
- [38]The Sage Developers, SageMath, the Sage Mathematics Software System, https://www.sagemath.org.
- [39]W. Decker, G.-M. Greuel, G. Pfister and H. Schönemann, SINGULAR — a computer algebra system for polynomial computations, https://www.singular.uni-kl.de.
- [40]M. Wiśniak, T. Pater ek and A. Zeilinger, Entanglement in mutually unbiased bases, New J. Phys. 13 (2011), 053047, doi:10.1088/1367-2630/13/5/053047.DOI
- [41]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
- [42]W. K. Wootters and B. D. Fields, Optimal state-determination by mutually unbiased measurements, Ann. Physics 191 (1989), 363–381.DOI