Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.16030

Sharp Total-Support Uncertainty for the Standard Complete Set of Mutually Unbiased Bases

Dongwei Li

Published Sep 11, 2026• 0 citations
arXivHTMLPDF

Abstract

We determine the sharp total-support uncertainty for the standard complete set of mutually unbiased bases in every prime dimension at least five, proving that the minimum is \(T_s(p)=p^2-p+2\). This resolves all prime dimensions left open by Fiorentino and Weigert, beginning with dimension eleven, and gives a uniform analytic determination of the optimal lower bound in dimension seven, where the earlier determination was partly numerical. The main new ingredient is a sharp zero-count theorem for arbitrary complex Fourier data supported on the finite parabola. A cyclotomic reduction and truncated local expansion produce a first nonzero finite-field jet that is affine in the transverse variable, reducing the planar zero count to a one-dimensional multiplicity problem. We then classify all extremizing projective states and derive an exact enumeration formula. In dimension seven, this gives analytic four-point extremizers and exactly \(12348\) such rays, completing the analytic description and count left open in the earlier work.

DOI
10.48550/arxiv.2609.16030

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

Uncertainty relations for the support of quantum states

Vincenzo Fiorentino, Stefan Weigert

Abstract Given a narrow signal over the real line, there is a limit to the localisation of its Fourier transform. In spaces of prime dimensions, Tao derived a sharp state-independent uncertainty relation which holds for the support sizes of a pure qudit state in two bases related by a discrete Fourier transform. We generalise Tao’s uncertainty relation to complete sets of mutually unbiased (MU) bases in spaces of prime dimensions. The bound we obtain appears to be sharp for dimension three only. Analytic and numerical results for prime dimensions up to nineteen suggest that the bound cannot be saturated in general. For prime dimensions two to seven we construct sharp bounds on the support sizes in <?CDATA $(d+1)$?> ( d + 1 ) MU bases and identify some of the states achieving them.

arXiv:2209.09817•Journal of Physics A Mathematical and Theoretical•Dec 7, 2022•4 citations

Mutually unbiased bases: polynomial optimization and symmetry

Sander Gribling, Sven C. Polak

A set of k orthonormal bases of Cd is called mutually unbiased if |⟨e,f⟩|2=1/d whenever e and f are basis vectors in distinct bases. A natural question is for which pairs (d,k) there exist k mutually unbiased bases in dimension d . The (well-known) upper bound k≤d+1 is attained when d is a power of a prime. For all other dimensions it is an open problem whether the bound can be attained. Navascués, Pironio, and Acín showed how to reformulate the existence question in terms of the existence of a certain C∗ -algebra. This naturally leads to a noncommutative polynomial optimization problem and an associated hierarchy of semidefinite programs. The problem has a symmetry coming from the wreath product of Sd and Sk .We exploit this symmetry (analytically) to reduce the size of the semidefinite programs making them (numerically) tractable. A key step is a novel explicit decomposition of the Sd≀Sk -module C([d]×[k])t into irreducible modules. We present numerical results for small d,k and low levels of the hierarchy. In particular, we obtain sum-of-squares proofs for the (well-known) fact that there do not exist d+2 mutually unbiased bases in dimensions d=2,3,4,5,6,7,8 . Moreover, our numerical results indicate that a sum-of-squares refutation, in the above-mentioned framework, of the existence of more than 3 MUBs in dimension 6 requires polynomials of total degree at least 12 .

Quantum•Apr 30, 2024•10 citations

Mutually unbiased bases: common states, completion, and extension obstructions

Hao-Yu Sun

Which pure states give uniform outcomes in several mutually unbiased measurements, and when can they form another measurement basis? We distinguish common unbiased states, their orthonormal completion, and further extension. For a displayed phase-deformed Fourier pair in dimension $2m$, a clock symmetry and skew antiunitary complete every prescribed common unbiased state to an explicit orthonormal basis. In dimension six, an amplitude-profile obstruction proves strong unextendibility of a given mutually unbiased triple when its original third-basis rays are invariant under the ternary clock. We give an exact nonproduct example and an application to a companion whose columns are localized at single Fourier frequencies. For every exact Hadamard matrix in a specified closed entrywise neighborhood of a fixed reference matrix, the coordinate and Hadamard bases have exactly 48 common unbiased rays but no third measurement basis, with a quantitative lower bound on the squared Gram defect of every six-column candidate. We also study auxiliary complex equations for common states, retaining algebraic multiplicities. For a flat unitary of order six with all $3\times3$ minors nonzero, the projective ray scheme is finite; each singular two-minor contributes two reduced isolated boundary points, and the affine coordinate algebra is finite-dimensional over $\mathbb{C}$. In every order, a critical-algebra identity preserves multiplicities; in dimension six it gives finiteness for a fixed phase fibre. Specialization over a discrete valuation ring controls complete reciprocal-orthogonal collections. A nonphysical Tao/Potts collection separates algebraic from physical solutions. These results do not determine the global maximum number of mutually unbiased bases or classify all triples.

quant-pharXiv:2610.12180•Oct 9, 2026•1 citation

Mutually unbiased bases: polynomial optimization and symmetry

Sander Gribling, Sven C. Polak

A set of $k$ orthonormal bases of $\mathbb C^d$ is called mutually unbiased if $|\langle e,f\rangle |^2 = 1/d$ whenever $e$ and $f$ are basis vectors in distinct bases. A natural question is for which pairs $(d,k)$ there exist~$k$ mutually unbiased bases in dimension $d$. The (well-known) upper bound $k \leq d+1$ is attained when~$d$ is a power of a prime. For all other dimensions it is an open problem whether the bound can be attained. Navascués, Pironio, and Acín showed how to reformulate the existence question in terms of the existence of a certain $C^*$-algebra. This naturally leads to a noncommutative polynomial optimization problem and an associated hierarchy of semidefinite programs. The problem has a symmetry coming from the wreath product of $S_d$ and $S_k$. We exploit this symmetry (analytically) to reduce the size of the semidefinite programs making them (numerically) tractable. A key step is a novel explicit decomposition of the $S_d \wr S_k$-module $\mathbb C^{([d]\times [k])^t}$ into irreducible modules. We present numerical results for small $d,k$ and low levels of the hierarchy. In particular, we obtain sum-of-squares proofs for the (well-known) fact that there do not exist $d+2$ mutually unbiased bases in dimensions~$d=2,3,4,5,6,7,8$. Moreover, our numerical results indicate that a sum-of-squares refutation, in the above-mentioned framework, of the existence of more than $3$ MUBs in dimension $6$ requires polynomials of total degree at least~$12$.

arXiv:2111.05698•Nov 10, 2021•8 citations

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

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.

Information•Aug 19, 2026•2 citations
We determine the sharp total-support uncertainty for the standard complete set of mutually unbiased bases in every prime dimension at least five, proving that the minimum is (T_s(p)=p^2-p+2). This resolves all prime dimensions left open by Fiorentino and Weigert, beginning with dimension eleven, and gives a uniform analytic determination of the optimal lower bound in dimension seven, where the earlier determination was partly numerical. The main new ingredient is a sharp zero-count theorem for arbitrary complex Fourier data supported on the finite parabola. A cyclotomic reduction and truncated local expansion produce a first nonzero finite-field jet that is affine in the transverse variable, reducing the planar zero count to a one-dimensional multiplicity problem. We then classify all extremizing projective states and derive an exact enumeration formula. In dimension seven, this gives analytic four-point extremizers and exactly (12348) such rays, completing the analytic description and count left open in the earlier work.
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.
Abstract Given a narrow signal over the real line, there is a limit to the localisation of its Fourier transform. In spaces of prime dimensions, Tao derived a sharp state-independent uncertainty relation which holds for the support sizes of a pure qudit state in two bases related by a discrete Fourier transform. We generalise Tao’s uncertainty relation to complete sets of mutually unbiased (MU) bases in spaces of prime dimensions. The bound we obtain appears to be sharp for dimension three only. Analytic and numerical results for prime dimensions up to nineteen suggest that the bound cannot be saturated in general. For prime dimensions two to seven we construct sharp bounds on the support sizes in <?CDATA (d+1)(d+1)(d+1)?> ( d + 1 ) MU bases and identify some of the states achieving them.
A set of k orthonormal bases of Cd is called mutually unbiased if |⟨e,f⟩|2=1/d whenever e and f are basis vectors in distinct bases. A natural question is for which pairs (d,k) there exist k mutually unbiased bases in dimension d . The (well-known) upper bound k≤d+1 is attained when d is a power of a prime. For all other dimensions it is an open problem whether the bound can be attained. Navascués, Pironio, and Acín showed how to reformulate the existence question in terms of the existence of a certain C∗ -algebra. This naturally leads to a noncommutative polynomial optimization problem and an associated hierarchy of semidefinite programs. The problem has a symmetry coming from the wreath product of Sd and Sk .We exploit this symmetry (analytically) to reduce the size of the semidefinite programs making them (numerically) tractable. A key step is a novel explicit decomposition of the Sd≀Sk -module C([d]×[k])t into irreducible modules. We present numerical results for small d,k and low levels of the hierarchy. In particular, we obtain sum-of-squares proofs for the (well-known) fact that there do not exist d+2 mutually unbiased bases in dimensions d=2,3,4,5,6,7,8 . Moreover, our numerical results indicate that a sum-of-squares refutation, in the above-mentioned framework, of the existence of more than 3 MUBs in dimension 6 requires polynomials of total degree at least 12 .
Which pure states give uniform outcomes in several mutually unbiased measurements, and when can they form another measurement basis? We distinguish common unbiased states, their orthonormal completion, and further extension. For a displayed phase-deformed Fourier pair in dimension 2m2m2m, a clock symmetry and skew antiunitary complete every prescribed common unbiased state to an explicit orthonormal basis. In dimension six, an amplitude-profile obstruction proves strong unextendibility of a given mutually unbiased triple when its original third-basis rays are invariant under the ternary clock. We give an exact nonproduct example and an application to a companion whose columns are localized at single Fourier frequencies. For every exact Hadamard matrix in a specified closed entrywise neighborhood of a fixed reference matrix, the coordinate and Hadamard bases have exactly 48 common unbiased rays but no third measurement basis, with a quantitative lower bound on the squared Gram defect of every six-column candidate. We also study auxiliary complex equations for common states, retaining algebraic multiplicities. For a flat unitary of order six with all 3×33\times33×3 minors nonzero, the projective ray scheme is finite; each singular two-minor contributes two reduced isolated boundary points, and the affine coordinate algebra is finite-dimensional over C\mathbb{C}C. In every order, a critical-algebra identity preserves multiplicities; in dimension six it gives finiteness for a fixed phase fibre. Specialization over a discrete valuation ring controls complete reciprocal-orthogonal collections. A nonphysical Tao/Potts collection separates algebraic from physical solutions. These results do not determine the global maximum number of mutually unbiased bases or classify all triples.
A set of kkk orthonormal bases of Cd\mathbb C^dCd is called mutually unbiased if ∣⟨e,f⟩∣2=1/d|\langle e,f\rangle |^2 = 1/d∣⟨e,f⟩∣2=1/d whenever eee and fff are basis vectors in distinct bases. A natural question is for which pairs (d,k)(d,k)(d,k) there exist~kkk mutually unbiased bases in dimension ddd. The (well-known) upper bound k≤d+1k \leq d+1k≤d+1 is attained when~ddd is a power of a prime. For all other dimensions it is an open problem whether the bound can be attained. Navascués, Pironio, and Acín showed how to reformulate the existence question in terms of the existence of a certain C∗C^*C∗-algebra. This naturally leads to a noncommutative polynomial optimization problem and an associated hierarchy of semidefinite programs. The problem has a symmetry coming from the wreath product of SdS_dSd​ and SkS_kSk​. We exploit this symmetry (analytically) to reduce the size of the semidefinite programs making them (numerically) tractable. A key step is a novel explicit decomposition of the Sd≀SkS_d \wr S_kSd​≀Sk​-module C([d]×[k])t\mathbb C^{([d]\times [k])^t}C([d]×[k])t into irreducible modules. We present numerical results for small d,kd,kd,k and low levels of the hierarchy. In particular, we obtain sum-of-squares proofs for the (well-known) fact that there do not exist d+2d+2d+2 mutually unbiased bases in dimensions~d=2,3,4,5,6,7,8d=2,3,4,5,6,7,8d=2,3,4,5,6,7,8. Moreover, our numerical results indicate that a sum-of-squares refutation, in the above-mentioned framework, of the existence of more than 333 MUBs in dimension 666 requires polynomials of total degree at least~121212.
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.