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.19969

On the possible cardinalities of quantum Latin squares

Yuyuan Zhang, Mingzhen Lv, H Cao

Published Jul 22, 2026• 0 citations
arXivHTMLPDF

Abstract

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\,\}\).

DOI
10.48550/arxiv.2607.19969

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•1 citation

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•0 citations

Symmetric Quantum Latin Squares with Maximal Cardinality

Yiwen Zhang, Haitao Cao

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$.

arXiv:2609.24653•Sep 21, 2026•0 citations

On the cardinalities of quantum Latin squares

Yajuan Zang, Mei Chai Zheng, Zihong Tian +1 more

A quantum Latin square of order $v$, QLS($v$), is a $v\times v$ array in which each of entries is a unit column vector from the Hilbert space $\mathbb{C}^{v}$, such that every row and column forms an orthonormal basis of $\mathbb{C}^{v}$. The cardinality of a QLS($v$) is the number of its vectors distinct up to a global phase, which is the crucial indicator for distinguishing between classical QLSs and non-classical QLSs. In this paper, we investigate the possible cardinalities of a QLS($v$). As a result, we completely resolve the existence of a QLS($v$) with maximal cardinality for any $v\geq 4$. Moreover, based on Wilson's construction and Direct Product construction, we establish some possible cardinality range of a QLS($v$) for any $v\geq 4$.

arXiv:2508.01972•Aug 4, 2025•0 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 With all Possible Cardinalities

Ying Zhang, Xin Wang, Lijun Ji

ABSTRACT A quantum Latin square of order (denoted as QLS) is an array whose entries are unit column vectors from the ‐dimensional Hilbert space , such that each row and column forms an orthonormal basis. Two unit vectors are regarded as identical if there exists a real number such that ; otherwise, they are considered distinct. The cardinality of a QLS is the number of distinct vectors in the array. In this paper, we use sub‐QLSs to prove that for any integer , and any integer , there is a QLS with cardinality .

arXiv:2507.05642•Journal of Combinatorial Designs•May 2, 2026•0 citations
In this paper, we show that for any integer (v \ge 8) with (v \ne 9,11,23), a quantum Latin square of order vvv exists for every cardinality (c \in [v,,v^{2}] \setminus {,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.
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.
A quantum Latin square of order vvv, QLS(vvv), is a v×vv\times vv×v array in which each of entries is a unit column vector from the Hilbert space Cv\mathbb{C}^{v}Cv, such that every row and column forms an orthonormal basis of Cv\mathbb{C}^{v}Cv. The cardinality of a QLS(vvv) is the number of its vectors distinct up to a global phase, which is the crucial indicator for distinguishing between classical QLSs and non-classical QLSs. In this paper, we investigate the possible cardinalities of a QLS(vvv). As a result, we completely resolve the existence of a QLS(vvv) with maximal cardinality for any v≥4v\geq 4v≥4. Moreover, based on Wilson's construction and Direct Product construction, we establish some possible cardinality range of a QLS(vvv) for any v≥4v\geq 4v≥4.
ABSTRACT A quantum Latin square of order (denoted as QLS) is an array whose entries are unit column vectors from the ‐dimensional Hilbert space , such that each row and column forms an orthonormal basis. Two unit vectors are regarded as identical if there exists a real number such that ; otherwise, they are considered distinct. The cardinality of a QLS is the number of distinct vectors in the array. In this paper, we use sub‐QLSs to prove that for any integer , and any integer , there is a QLS with cardinality .