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

arXiv:2607.12933

Large sets of mutually orthogonal quantum Latin squares

Simeon Ball, Robin Simoens

math.COquant-phSubmitted Jul 14, 2026• Announced Jul 15, 2026• 0 citations• Revised Jul 27, 2026 (v2)
v1 · Jul 14, 2026v2 · Jul 27, 2026
arXivHTMLPDF

Abstract

How large can a set of mutually orthogonal quantum Latin squares (MOQLS) get? We show that a set of n - 2 MOQLS of order n is necessarily classical and construct large non-classical sets of MOQLS of orders that are prime powers, improving both the previously known lower and upper bounds.
Comments
Correction of Theorem 6

Related papers

Orthogonality for Quantum Latin Isometry Squares

Benjamin Musto, Jamie Vicary

Goyeneche et al recently proposed a notion of orthogonality for quantum Latin squares, and showed that orthogonal quantum Latin squares yield quantum codes. We give a simplified characterization of orthogonality for quantum Latin squares, which we show is equivalent to the existing notion. We use this simplified characterization to give an upper bound for the number of mutually orthogonal quantum Latin squares of a given size, and to give the first examples of orthogonal quantum Latin squares that do not arise from ordinary Latin squares. We then discuss quantum Latin isometry squares, generalizations of quantum Latin squares recently introduced by Benoist and Nechita, and define a new orthogonality property for these objects, showing that it also allows the construction of quantum codes. We give a new characterization of unitary error bases using these structures.

arXiv:1804.04042•Electronic Proceedings in Theoretical Computer Science•Jan 31, 2019•19 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 orthogonal Latin squares from the inner products of vectors in mutually unbiased bases

Joanne L. Hall, Asha Rao

Mutually unbiased bases (MUBs) are important in quantum information theory. While constructions of complete sets of d + 1 MUBs in 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 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, Dakić 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.

Journal of Physics A Mathematical and Theoretical•Mar 10, 2010•9 citations

Thirty-Six Quantum Officers Are Entangled

Simeon Ball, Robin Simoens

There exist pairs of orthogonal Latin squares of any order n except if n=2 or n=6 [Bose et al., Further results on the construction of mutually orthogonal latin squares and the falsity of Euler's conjecture, Can. J. Math. 12, 189 (1960)CJMAAB0008-414X10.4153/CJM-1960-016-5]. In particular, the problem of Euler's thirty-six officers does not have a solution. However, it has a "quantum solution": there exist so-called entangled quantum Latin squares of order 6 [Rather et al., Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem, Phys. Rev. Lett. 128, 080507 (2022)PRLTAO0031-900710.1103/PhysRevLett.128.080507]. We prove that mutually orthogonal quantum Latin squares of order 6 do not exist if entanglement is not allowed.

Physical Review Letters•Jun 15, 2026•0 citations

Mutually Unbiased Bases and Orthogonal Latin Squares

Tomasz Paterek, Borivoje Dakić, Časlav Brukner

On first sight, the number of mutually unbiased bases (MUBs) in d dimensions and the number of mutually orthogonal Latin squares (MOLS) of order d seem to be closely related. A careful look however reveals the connections cannot be really strong. In this talk a few similarities and differences between MUBs and MOLS are presented. The first similarity involves their maximal numbers. There are at most d + 1 MUBs and also d + 1 squares in an augmented set of MOLS. This number is attained if d is a power of a prime and we give an algorithm which relates MUBs and MOLS in these dimensions [1]. Another similarity follows from considerations of composite d. One can think about a Hilbert space of a composite dimension as describing several subsystems of prime-power dimensions. Since we can always build MUBs in the global space as tensor products of MUBs for the subspaces, there are at least M + 1 of them for the whole system, where M is the smallest prime-power factor of d. A similar construction exists for MOLS: squares of composite orders can be built as direct products of squares of prime-power orders. The corresponding lower bound on the number of MOLS is called the MacNeish’s bound. In general, both the MacNeish’s bound and the number of MUBs which follows from the tensor product construction are known not to be tight. However, the simplest example today involves dimension d = 676 for MUBs [2], whereas MacNeish’s bound is not tight already for d = 10. We therefore checked whether the connection [1] also works for d = 10, and found it no longer links all MOLS to MUBs [3]. The general results of Ref. [4] reveal in this context that the connection fails whenever MacNeish’s bound is not tight. The last (apparent) similarity to be presented is related to incomplete sets of MOLS and MUBs. There is a Latin square of order 4 which does not have an orthogonal mate (so called bachelor Latin square) and connection [1] links it with a set of MUBs which also cannot be extended. It might be tempting to conjecture that every unextendible augmented set of MOLS has a corresponding unextendible set of MUBs. We already disproved such conjecture for the connection [1] and now we briefly describe that there is no other connection for which the conjecture would hold true. One can see this in at least two ways [5]. The first involves bachelor Latin square of order 5. It was recently shown that bachelor Latin squares exist for all orders d > 3 [6]. If there is a strong relation between MOLS and MUBs, there should correspondingly exist a set of 3 MUBs in all dimensions d > 3. To the contrary, it is known that for d = 5 every set of 3 MUBs can be extended to a complete set of 6 MUBs [7]. The second way is more dramatic. It turns out that for d = 6 there exists a set of two MUBs which cannot be extended any further (and six is the smallest dimension in which this happens). Since an augmented set of MOLS contains at least 3 elements, the strong relation is excluded. For more arguments against a close connection between MOLS and MUBs see Ref. [8].

•Apr 14, 2008•0 citations

Constructing Mutually Unbiased Bases from Quantum Latin Squares

Benjamin Musto

We introduce orthogonal quantum Latin squares, which restrict to traditional orthogonal Latin squares, and investigate their application in quantum information science. We use quantum Latin squares to build maximally entangled bases, and show how a pair of mutually unbiased maximally entangled bases can be constructed in square dimension from orthogonal quantum Latin squares. We also compare our construction to an existing construction due to Beth and Wocjan and show that ours is strictly more general.

arXiv:1605.08919•Electronic Proceedings in Theoretical Computer Science•Jan 1, 2017•26 citations
Goyeneche et al recently proposed a notion of orthogonality for quantum Latin squares, and showed that orthogonal quantum Latin squares yield quantum codes. We give a simplified characterization of orthogonality for quantum Latin squares, which we show is equivalent to the existing notion. We use this simplified characterization to give an upper bound for the number of mutually orthogonal quantum Latin squares of a given size, and to give the first examples of orthogonal quantum Latin squares that do not arise from ordinary Latin squares. We then discuss quantum Latin isometry squares, generalizations of quantum Latin squares recently introduced by Benoist and Nechita, and define a new orthogonality property for these objects, showing that it also allows the construction of quantum codes. We give a new characterization of unitary error bases using these structures.
Mutually unbiased bases (MUBs) are important in quantum information theory. While constructions of complete sets of d + 1 MUBs in 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 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, Dakić 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.
There exist pairs of orthogonal Latin squares of any order n except if n=2 or n=6 [Bose et al., Further results on the construction of mutually orthogonal latin squares and the falsity of Euler's conjecture, Can. J. Math. 12, 189 (1960)CJMAAB0008-414X10.4153/CJM-1960-016-5]. In particular, the problem of Euler's thirty-six officers does not have a solution. However, it has a "quantum solution": there exist so-called entangled quantum Latin squares of order 6 [Rather et al., Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem, Phys. Rev. Lett. 128, 080507 (2022)PRLTAO0031-900710.1103/PhysRevLett.128.080507]. We prove that mutually orthogonal quantum Latin squares of order 6 do not exist if entanglement is not allowed.
On first sight, the number of mutually unbiased bases (MUBs) in d dimensions and the number of mutually orthogonal Latin squares (MOLS) of order d seem to be closely related. A careful look however reveals the connections cannot be really strong. In this talk a few similarities and differences between MUBs and MOLS are presented. The first similarity involves their maximal numbers. There are at most d + 1 MUBs and also d + 1 squares in an augmented set of MOLS. This number is attained if d is a power of a prime and we give an algorithm which relates MUBs and MOLS in these dimensions [1]. Another similarity follows from considerations of composite d. One can think about a Hilbert space of a composite dimension as describing several subsystems of prime-power dimensions. Since we can always build MUBs in the global space as tensor products of MUBs for the subspaces, there are at least M + 1 of them for the whole system, where M is the smallest prime-power factor of d. A similar construction exists for MOLS: squares of composite orders can be built as direct products of squares of prime-power orders. The corresponding lower bound on the number of MOLS is called the MacNeish’s bound. In general, both the MacNeish’s bound and the number of MUBs which follows from the tensor product construction are known not to be tight. However, the simplest example today involves dimension d = 676 for MUBs [2], whereas MacNeish’s bound is not tight already for d = 10. We therefore checked whether the connection [1] also works for d = 10, and found it no longer links all MOLS to MUBs [3]. The general results of Ref. [4] reveal in this context that the connection fails whenever MacNeish’s bound is not tight. The last (apparent) similarity to be presented is related to incomplete sets of MOLS and MUBs. There is a Latin square of order 4 which does not have an orthogonal mate (so called bachelor Latin square) and connection [1] links it with a set of MUBs which also cannot be extended. It might be tempting to conjecture that every unextendible augmented set of MOLS has a corresponding unextendible set of MUBs. We already disproved such conjecture for the connection [1] and now we briefly describe that there is no other connection for which the conjecture would hold true. One can see this in at least two ways [5]. The first involves bachelor Latin square of order 5. It was recently shown that bachelor Latin squares exist for all orders d > 3 [6]. If there is a strong relation between MOLS and MUBs, there should correspondingly exist a set of 3 MUBs in all dimensions d > 3. To the contrary, it is known that for d = 5 every set of 3 MUBs can be extended to a complete set of 6 MUBs [7]. The second way is more dramatic. It turns out that for d = 6 there exists a set of two MUBs which cannot be extended any further (and six is the smallest dimension in which this happens). Since an augmented set of MOLS contains at least 3 elements, the strong relation is excluded. For more arguments against a close connection between MOLS and MUBs see Ref. [8].
We introduce orthogonal quantum Latin squares, which restrict to traditional orthogonal Latin squares, and investigate their application in quantum information science. We use quantum Latin squares to build maximally entangled bases, and show how a pair of mutually unbiased maximally entangled bases can be constructed in square dimension from orthogonal quantum Latin squares. We also compare our construction to an existing construction due to Beth and Wocjan and show that ours is strictly more general.