Comment on ''Mutually unbiased bases, orthogonal Latin squares, and hidden-variable models''
Journal Article
·
· Physical Review. A
- School of Mathematical and Geospatial Sciences, RMIT University, GPO Box 2476V, Melbourne, 3001 (Australia)
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)].
- OSTI ID:
- 21541417
- Journal Information:
- Physical Review. A, Journal Name: Physical Review. A Journal Issue: 3 Vol. 83; ISSN 1050-2947; ISSN PLRAAN
- Country of Publication:
- United States
- Language:
- English
Similar Records
Reply to ''Comment on 'Mutually unbiased bases, orthogonal Latin squares, and hidden-variable models'''
Mean king's problem with mutually unbiased bases and orthogonal Latin squares
Solution to the mean king's problem with mutually unbiased bases for arbitrary levels
Journal Article
·
Tue Mar 15 00:00:00 EDT 2011
· Physical Review. A
·
OSTI ID:21541418
Mean king's problem with mutually unbiased bases and orthogonal Latin squares
Journal Article
·
Sun May 15 00:00:00 EDT 2005
· Physical Review. A
·
OSTI ID:20717742
Solution to the mean king's problem with mutually unbiased bases for arbitrary levels
Journal Article
·
Mon May 15 00:00:00 EDT 2006
· Physical Review. A
·
OSTI ID:20787188