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:2609.24653

Symmetric Quantum Latin Squares with Maximal Cardinality

Yiwen Zhang, Haitao Cao

Published Sep 21, 2026• 0 citations
arXivHTMLPDF

Abstract

In this paper, we prove that there exist a symmetric quantum Latin square with maximal cardinality of order $n$ for all $n\geq 6$, and a symmetric idempotent quantum Latin square with maximal cardinality of order $4k+2$ for all $k\geq 1$.

DOI
10.48550/arxiv.2609.24653

Related papers

The Maximal Cardinality of Quantum Latin Squares and Quantum Latin Cubes

Yuyuan Zhang, Yiwen Zhang, Mingzhen Lv +1 more

ABSTRACT In this paper, by extending the classical singular direct product construction to the quantum setting we resolve the existence problem for quantum Latin squares with maximal cardinality except for 11 possible exceptions. We also prove that there exists a quantum Latin cube of order with maximal cardinality for all positive integers , except when is a prime or , where are prime numbers and .

Journal of Combinatorial Designs•Dec 15, 2025•2 citations

On the possible cardinalities of quantum Latin squares

Yuyuan Zhang, Mingzhen Lv, H Cao

In this paper, we show that for any integer \(v \ge 8\) with \(v \ne 9,11,23\), a quantum Latin square of order $v$ exists for every cardinality \(c \in [v,\,v^{2}] \setminus \{\,v+1\,\}\).

arXiv:2607.19969•Jul 22, 2026•4 citations

Quantum Latin Hypercubes with Maximal Cardinality

Mingzhen Lv, Haitao Cao

We construct quantum Latin squares with maximal cardinality and quantum Latin hypercubes with maximal cardinality over the real field.

arXiv:2609.09695•Sep 9, 2026•0 citations

Quantum Latin squares of order $6m$ with all possible cardinalities

Ying Zhang, Lijun Ji

A quantum Latin square of order $n$ (denoted as QLS$(n)$) is an $n\times n$ array whose entries are unit column vectors from the $n$-dimensional Hilbert space $\mathcal{H}_n$, such that each row and column forms an orthonormal basis. Two unit vectors $|u\rangle, |v\rangle\in \mathcal{H}_n$ are regarded as identical if there exists a real number $θ$ such that $|u\rangle=e^{iθ}|v\rangle$; otherwise, they are considered distinct. The cardinality $c$ of a QLS$(n)$ is the number of distinct vectors in the array. In this note,we use sub-QLS$(6)$ to prove that for any integer $m\geq 2$ and any $c\in [6m,36m^2]\setminus \{6m+1\}$, there is a QLS$(6m)$ with cardinality $c$.

quant-pharXiv:2601.09132•Jan 15, 2026•9 citations

The Existence of Diagonal Quantum Latin Squares with Maximum Cardinality

黄琳, Yang Li

A quantum Latin square of order \(n\), denoted by \(\operatorname{QLS}(n)\), is an \(n \times n\) square whose entries are unit column vectors in the \(n\)-dimensional Hilbert space \(\mathcal{H}_n\), such that each row and each column forms an orthonormal basis of \(\mathcal{H}_n\). The cardinality of a QLS($n$) is the number of distinct vectors up to a global phase in the array. A \(\mathrm{QLS}(n)\) whose main diagonal and anti-diagonal each forms an orthonormal basis of \(\mathcal{H}_n\) is called a diagonal quantum Latin square (\(\mathrm{DQLS}(n)\)). In this paper, we focus on the existence of the \(\mathrm{DQLS}(n)\) with maximum cardinality ($\mathrm{MCDQLS}(n)$). By employing direct constructions based on row-quantum Latin rectangle and special complete mapping, together with the recursive techniques such as the singular direct product construction, We have almost completely determined the existence of \(\mathrm{MCDQLS}(n)\), except for a few exceptional cases. This result is based on the study of the existence of idempotent \(\mathrm{QLS}(n)\) with maximum cardinality (\(\mathrm{MCQLS}(n)\)), and implies an existence result for pandiagonal quantum Latin squares with maximum cardinality (\(\mathrm{MCPQLS}(n)\)).

arXiv:2606.27758•Jun 26, 2026•4 citations

Three Quantum Latin Squares of Order 6 with Cardinalities 13, 15, and 17

Zhipeng Xu

We give three explicit quantum Latin squares of order $6$, with cardinalities $13$, $15$, and $17$. Throughout, vectors differing only by a global phase are counted as identical. The cardinality-$13$ construction is based on an orthogonal direct-sum decomposition $\C^6=\C^4\oplus\C^2$. The cardinality-$15$ and cardinality-$17$ constructions are based on two-dimensional Hadamard pairs supported on coordinate planes.

arXiv:2605.15540•May 15, 2026•2 citations
In this paper, we prove that there exist a symmetric quantum Latin square with maximal cardinality of order nnn for all n≥6n\geq 6n≥6, and a symmetric idempotent quantum Latin square with maximal cardinality of order 4k+24k+24k+2 for all k≥1k\geq 1k≥1.
In this paper, we show that for any integer v≥8v \ge 8v≥8 with v≠9,11,23v \ne 9,11,23v=9,11,23, a quantum Latin square of order vvv exists for every cardinality c∈[v, v2]∖{ v+1 }c \in [v,\,v^{2}] \setminus \{\,v+1\,\}c∈[v,v2]∖{v+1}.
Quantum Latin squares of order 6m6m6m with all possible cardinalities
A quantum Latin square of order nnn (denoted as QLS(n)(n)(n)) is an n×nn\times nn×n array whose entries are unit column vectors from the nnn-dimensional Hilbert space Hn\mathcal{H}_nHn​, such that each row and column forms an orthonormal basis. Two unit vectors ∣u⟩,∣v⟩∈Hn|u\rangle, |v\rangle\in \mathcal{H}_n∣u⟩,∣v⟩∈Hn​ are regarded as identical if there exists a real number θθθ such that ∣u⟩=eiθ∣v⟩|u\rangle=e^{iθ}|v\rangle∣u⟩=eiθ∣v⟩; otherwise, they are considered distinct. The cardinality ccc of a QLS(n)(n)(n) is the number of distinct vectors in the array. In this note,we use sub-QLS(6)(6)(6) to prove that for any integer m≥2m\geq 2m≥2 and any c∈[6m,36m2]∖{6m+1}c\in [6m,36m^2]\setminus \{6m+1\}c∈[6m,36m2]∖{6m+1}, there is a QLS(6m)(6m)(6m) with cardinality ccc.
A quantum Latin square of order nnn, denoted by QLS⁡(n)\operatorname{QLS}(n)QLS(n), is an n×nn \times nn×n square whose entries are unit column vectors in the nnn-dimensional Hilbert space Hn\mathcal{H}_nHn​, such that each row and each column forms an orthonormal basis of Hn\mathcal{H}_nHn​. The cardinality of a QLS(nnn) is the number of distinct vectors up to a global phase in the array. A QLS(n)\mathrm{QLS}(n)QLS(n) whose main diagonal and anti-diagonal each forms an orthonormal basis of Hn\mathcal{H}_nHn​ is called a diagonal quantum Latin square (DQLS(n)\mathrm{DQLS}(n)DQLS(n)). In this paper, we focus on the existence of the DQLS(n)\mathrm{DQLS}(n)DQLS(n) with maximum cardinality (MCDQLS(n)\mathrm{MCDQLS}(n)MCDQLS(n)). By employing direct constructions based on row-quantum Latin rectangle and special complete mapping, together with the recursive techniques such as the singular direct product construction, We have almost completely determined the existence of MCDQLS(n)\mathrm{MCDQLS}(n)MCDQLS(n), except for a few exceptional cases. This result is based on the study of the existence of idempotent QLS(n)\mathrm{QLS}(n)QLS(n) with maximum cardinality (MCQLS(n)\mathrm{MCQLS}(n)MCQLS(n)), and implies an existence result for pandiagonal quantum Latin squares with maximum cardinality (MCPQLS(n)\mathrm{MCPQLS}(n)MCPQLS(n)).
We give three explicit quantum Latin squares of order 666, with cardinalities 131313, 151515, and 171717. Throughout, vectors differing only by a global phase are counted as identical. The cardinality-131313 construction is based on an orthogonal direct-sum decomposition $\C^6=\C^4\oplus\C^2$. The cardinality-151515 and cardinality-171717 constructions are based on two-dimensional Hadamard pairs supported on coordinate planes.