Quantum Latin squares of order 6m6m with all possible cardinalities

preprint2026arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.