Quantum Latin squares of order $6m$ with all possible cardinalities
Ying Zhang, Lijun Ji

TL;DR
This paper demonstrates the existence of quantum Latin squares of order $6m$ with all possible cardinalities within a specific range, except one, expanding the understanding of their combinatorial structure.
Contribution
It introduces a method using sub-QLS(6) to construct quantum Latin squares of order $6m$ with nearly all possible cardinalities, filling gaps in their known configurations.
Findings
Existence of QLS(6m) with cardinalities in [6m,36m^2] except 6m+1
Construction method using sub-QLS(6)
Broad range of cardinalities achieved for QLS(6m)
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 note,we use sub-QLS to prove that for any integer and any , there is a QLS with cardinality .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Finite Group Theory Research · Limits and Structures in Graph Theory
