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

International Journal of Theoretical Physics

Construction of Mutually Unbiased Bases Using Mutually Orthogonal Latin Squares

Yi-yang Song, Guijun Zhang, Lingshan Xu, Yuan-Hong Tao

Published Apr 14, 2020• 5 citations
Publisher
DOI
10.1007/s10773-020-04444-x

Related papers

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

Mutually unbiased bases, Latin squares and orthogonal pairs (群論とその周辺--RIMS研究集会報告集)

安男 綿谷

数理解析研究所講究録•Jul 1, 2007•0 citations

Mutually unbiased bases, Latin squares and orthogonal pairs(Group Theory and Related Topics)

Yasuo Watatani

•Jul 1, 2007•0 citations

Mutually unbiased bases, Latin squares and orthogonal pairs(Group Theory and Related Topics)

安男 綿谷

数理解析研究所講究録•Jul 1, 2007•0 citations

The correspondence between mutually unbiased bases and mutually orthogonal extraordinary supersquares

Iulia Ghiu, Cristian Ghiu

arXiv:1312.3236•Reports on Mathematical Physics•Feb 1, 2014•3 citations

New construction of mutually unbiased bases in square dimensions

Paweł Wocjan, T. Beth

We show that k=w+2 mutually unbiased bases can be constructed in any square dimension d=s^2 provided that there are w mutually orthogonal Latin squares of order s. The construction combines the design-theoretic objects (s,k)-nets (which can be constructed from w mutually orthogonal Latin squares of order s and vice versa) and generalized Hadamard matrices of size s. Using known lower bounds on the asymptotic growth of the number of mutually orthogonal Latin squares (based on number theoretic sieving techniques), we obtain that the number of mutually unbiased bases in dimensions d=s^2 is greater than s^{1/14.8} for all s but finitely many exceptions. Furthermore, our construction gives more mutually unbiased bases in many non-prime-power dimensions than the construction that reduces the problem to prime power dimensions.

arXiv:quant-ph/0407081•Quantum Information and Computation•May 1, 2005•106 citations
We show that k=w+2 mutually unbiased bases can be constructed in any square dimension d=s^2 provided that there are w mutually orthogonal Latin squares of order s. The construction combines the design-theoretic objects (s,k)-nets (which can be constructed from w mutually orthogonal Latin squares of order s and vice versa) and generalized Hadamard matrices of size s. Using known lower bounds on the asymptotic growth of the number of mutually orthogonal Latin squares (based on number theoretic sieving techniques), we obtain that the number of mutually unbiased bases in dimensions d=s^2 is greater than s^{1/14.8} for all s but finitely many exceptions. Furthermore, our construction gives more mutually unbiased bases in many non-prime-power dimensions than the construction that reduces the problem to prime power dimensions.