[en] In a recent article Paterek, Dakic, and Brukner [Phys. Rev. A 79, 012109 (2009)] show an algorithm for generating mutually unbiased bases from sets of orthogonal Latin squares. They claim that this algorithm works for every set of orthogonal Latin squares. We show that the algorithm only works for particular sets of orthogonal Latin squares. Furthermore, the algorithm is a more readable version of work previously published [Phys. Rev. A 70, 062101 (2004)].

[en] Mutually unbiased bases (MUBs) are important in quantum information theory. While constructions of complete sets of d + 1 MUBs in C^d are known when d is a prime power, it is unknown if such complete sets exist in non-prime power dimensions. It has been conjectured that complete sets of MUBs only exist in C^d if a maximal set of mutually orthogonal Latin squares (MOLS) of side length d also exists. There are several constructions (Roy and Scott 2007 J. Math. Phys. 48 072110; Paterek, Dakic and Brukner 2009 Phys. Rev. A 79 012109) of complete sets of MUBs from specific types of MOLS, which use Galois fields to construct the vectors of the MUBs. In this paper, two known constructions of MUBs (Alltop 1980 IEEE Trans. Inf. Theory 26 350-354; Wootters and Fields 1989 Ann. Phys. 191 363-381), both of which use polynomials over a Galois field, are used to construct complete sets of MOLS in the odd prime case. The MOLS come from the inner products of pairs of vectors in the MUBs.