Abstract We initiate a systematic study of triplets of mutually unbiased bases (MUBs). We show that each MUB-triplet in
Cd C d is characterized by a
d×d×d d × d × d object that we call a Hadamard cube . We describe the basic properties of Hadamard cubes and show how a MUB-triplet can be reconstructed from such a cube, up to unitary equivalence. We also present an algebraic identity which is conjectured to hold for all MUB-triplets in dimension 6. If true, it would imply the long-standing conjecture of Zauner that the maximum number of MUBs in dimension 6 is three.
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 collection of pairwise mutually unbiased bases (in short: MUB) in d > 1 d>1 dimensions may consist of at most d + 1 d+1 bases. Such “complete” collections are known to exist in C d \mathbb {C}^d when d d is a power of a prime. However, in general, little is known about the maximum number N ( d ) N(d) of bases that a collection of MUB in C d \mathbb {C}^d can have. In this work it is proved that a collection of d d MUB in C d \mathbb {C}^d can always be completed. Hence N ( d ) ≠ d N(d)\neq d , and when d > 1 d>1 we have a dichotomy: either N ( d ) = d + 1 N(d)=d+1 (so that there exists a complete collection of MUB) or N ( d ) ≤ d − 1 N(d)\leq d-1 . In the course of the proof an interesting new characterization is given for a linear subspace of
The study of Mutually Unbiased Bases continues to be developed vigorously, and presents several challenges in the Quantum Information Theory. Two orthonormal bases in
Cd,BandB′ are said mutually unbiased if
∀b∈B,b′∈B′ the scalar product
b⋅b′ has modulus
d−1/2. In particular this property has been introduced in order to allow an optimization of the measurement-driven quantum evolution process of any state
ψ∈Cd when measured in the mutually unbiased bases
B_jofCd. At present it is an open problem to find the maximal umber of mutually Unbiased Bases when
d is not a power of a prime number. \noindent In this article, we revisit the problem of finding Mutually Unbiased Bases (MUB's) in any dimension
d. The method is very elementary, using the simple unitary matrices introduced by Schwinger in 1960, together with their diagonalizations. The Vandermonde matrix based on the
d-th roots of unity plays a major role. This allows us to show the existence of a set of 3 MUB's in any dimension, to give conditions for existence of more than 3 MUB's for
d even or odd number, and to recover the known result of existence of
d+1 MUB's for
d a prime number. Furthermore the construction of these MUB's is very explicit. As a by-product, we recover results about Gauss Sums, known in number theory, but which have apparently not been previously derived from MUB properties.