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:1012.3147

Some attempts at proving the non-existence of a full set of mutually unbiased bases in dimension 6

Guo Chuan Thiang

Published Dec 14, 2010• 3 citations
arXivHTMLPDF

Abstract

Complete sets of mutually unbiased bases are only known to exist in prime-power dimensions. We will describe a few approaches to the problem proving the (non)-existence of four mutually unbiased bases in dimension 6. These will include the notions of Grassmannian distance, quadratic matrix programming, semidefinite relaxations to polynomial programming, as well as various tools from algebraic geometry.

DOI
10.48550/arxiv.1012.3147

Related papers

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

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 and Orthogonal Latin Squares -- version 3

Stefan Joka

In this paper, we prove that the existence of a complete set of mutually unbiased bases (MUBs) in N-dimensional Hilbert space implies the existence of a complete set of mutually orthogonal Latin squares (MOLSs) of order N. In particular, we prove that a complete set of MUBs does not exist in dimension six (the first dimension which is not a power of prime).

quant-pharXiv:2511.03537•Nov 6, 2025•0 citations

Mutually unbiased bases and semi-definite programming

Stephen Brierley, Stefan Weigert

A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and on Gröbner bases. A third algorithmic approach is presented: the non-existence of more than three mutually unbiased bases in composite dimensions can be decided by a global optimization method known as semidefinite programming. The method is used to confirm that the spectral matrix cannot be part of a complete set of seven mutually unbiased bases in dimension six.

arXiv:1006.0093•Journal of Physics Conference Series•Nov 1, 2010•43 citations

Mutually Unbiased Bases in Composite Dimensions – A Review

Daniel McNulty, Stefan Weigert

Maximal sets of mutually unbiased bases are useful throughout quantum physics, both in a foundational context and for applications. To date, it remains unknown if complete sets of mutually unbiased bases exist in Hilbert spaces of dimensions different from a prime power, i.e. in composite dimensions such as six or ten. Fourteen mathematically equivalent formulations of the existence problem are presented. We comprehensively summarise analytic, computer-aided and numerical results relevant to the case of composite dimensions. Known modifications of the existence problem are reviewed and potential solution strategies are outlined.

arXiv:2410.23997•Quantum•Apr 1, 2026•34 citations

On SIC-POVMs and MUBs in Dimension 6

Markus Grassl

We provide a partial solution to the problem of constructing mutually unbiased bases (MUBs) and symmetric informationally complete POVMs (SIC-POVMs) in non-prime-power dimensions. An algebraic description of a SIC-POVM in dimension six is given. Furthermore it is shown that several sets of three mutually unbiased bases in dimension six are maximal, i.e., cannot be extended.

arXiv:quant-ph/0406175•Jun 23, 2004•218 citations
Complete sets of mutually unbiased bases are only known to exist in prime-power dimensions. We will describe a few approaches to the problem proving the (non)-existence of four mutually unbiased bases in dimension 6. These will include the notions of Grassmannian distance, quadratic matrix programming, semidefinite relaxations to polynomial programming, as well as various tools from algebraic geometry.
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.
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 .
A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and on Gröbner bases. A third algorithmic approach is presented: the non-existence of more than three mutually unbiased bases in composite dimensions can be decided by a global optimization method known as semidefinite programming. The method is used to confirm that the spectral matrix cannot be part of a complete set of seven mutually unbiased bases in dimension six.
Maximal sets of mutually unbiased bases are useful throughout quantum physics, both in a foundational context and for applications. To date, it remains unknown if complete sets of mutually unbiased bases exist in Hilbert spaces of dimensions different from a prime power, i.e. in composite dimensions such as six or ten. Fourteen mathematically equivalent formulations of the existence problem are presented. We comprehensively summarise analytic, computer-aided and numerical results relevant to the case of composite dimensions. Known modifications of the existence problem are reviewed and potential solution strategies are outlined.