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

Physical Review A

Comment on “Mutually unbiased bases, orthogonal Latin squares, and hidden-variable models”

Joanne L. Hall, Asha Rao

Published Mar 30, 2011• 4 citations
Publisher

Abstract

In a recent article Paterek, Daki\ifmmode \acute{c}\else \'{c}\fi{}, 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)].

DOI
10.1103/physreva.83.036101

Related papers

Reply to “Comment on ‘Mutually unbiased bases, orthogonal Latin squares, and hidden-variable models’ ”

Tomasz Paterek, Borivoje Dakić, Časlav Brukner

In this Reply to the preceding Comment by Hall and Rao [Phys. Rev. A 83, 036101 (2011)], we motivate terminology of our original paper and point out that further research is needed in order to (dis)prove the claimed link between every orthogonal Latin square of order being a power of a prime and a mutually unbiased basis.

Physical Review A•Mar 30, 2011•1 citation

Construction of Mutually Unbiased Bases Using Mutually Orthogonal Latin Squares

Yi-yang Song, Guijun Zhang, Lingshan Xu +1 more

International Journal of Theoretical Physics•Apr 14, 2020•5 citations

Mutually orthogonal Latin squares and mutually unbiased bases in dimensions of odd prime power

Asha Rao, Diane M. Donovan, Joanne L. Hall

Cryptography and Communications•May 31, 2010•10 citations

On the connection between mutually unbiased bases and orthogonal Latin squares

Tomasz Paterek, M Pawłowski, M Grassl +1 more

We offer a piece of evidence that the problems of finding the number of mutually unbiased bases (MUB) and mutually orthogonal Latin squares (MOLS) might not be equivalent. We study a particular procedure that has been shown to relate the two problems and generates complete sets of MUB in power-of-prime dimensions and three MUB in dimension six. For these cases, every square from an augmented set of MOLS has a corresponding MUB. We show that this no longer holds for certain composite dimensions.

arXiv:0910.1439•Physica Scripta•Sep 1, 2010•21 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, Latin squares and orthogonal pairs(Group Theory and Related Topics)

Yasuo Watatani

•Jul 1, 2007•0 citations
In a recent article Paterek, Daki\ifmmode \acute{c}\else '{c}\fi{}, 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)].