{"title":"Quantum Latin Squares With all Possible Cardinalities","authors":"Ying Zhang, Xin Wang, Lijun Ji","doi":"10.1002/jcd.70021","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>A quantum Latin square of order <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>n</mi>\n </mrow>\n </mrow>\n </semantics></math> (denoted as QLS<span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mi>n</mi>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>) is an <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>n</mi>\n \n <mo>×</mo>\n \n <mi>n</mi>\n </mrow>\n </mrow>\n </semantics></math> array whose entries are unit column vectors from the <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>n</mi>\n </mrow>\n </mrow>\n </semantics></math>-dimensional Hilbert space <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <msub>\n <mi>ℋ</mi>\n \n <mi>n</mi>\n </msub>\n </mrow>\n </mrow>\n </semantics></math>, such that each row and column forms an orthonormal basis. Two unit vectors <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo></mo>\n \n <mrow>\n <mo>∣</mo>\n \n <mi>u</mi>\n </mrow>\n \n <mo>〉</mo>\n </mrow>\n \n <mo>,</mo>\n \n <mrow>\n <mo></mo>\n \n <mrow>\n <mo>∣</mo>\n \n <mi>v</mi>\n </mrow>\n \n <mo>〉</mo>\n </mrow>\n \n <mo>∈</mo>\n \n <msub>\n <mi>ℋ</mi>\n \n <mi>n</mi>\n </msub>\n </mrow>\n </mrow>\n </semantics></math> are regarded as identical if there exists a real number <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>θ</mi>\n </mrow>\n </mrow>\n </semantics></math> such that <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo></mo>\n \n <mrow>\n <mo>∣</mo>\n \n <mi>u</mi>\n </mrow>\n \n <mo>〉</mo>\n </mrow>\n \n <mo>=</mo>\n \n <msup>\n <mi>e</mi>\n \n <mrow>\n <mi>i</mi>\n \n <mi>θ</mi>\n </mrow>\n </msup>\n \n <mrow>\n <mo></mo>\n \n <mrow>\n <mo>∣</mo>\n \n <mi>v</mi>\n </mrow>\n \n <mo>〉</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>; otherwise, they are considered distinct. The cardinality <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>c</mi>\n </mrow>\n </mrow>\n </semantics></math> of a QLS<span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mi>n</mi>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math> is the number of distinct vectors in the array. In this paper, we use sub-QLS<span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mn>4</mn>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>s to prove that for any integer <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>m</mi>\n \n <mo>≥</mo>\n \n <mn>2</mn>\n </mrow>\n </mrow>\n </semantics></math>, and any integer <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>c</mi>\n \n <mo>∈</mo>\n \n <mrow>\n <mo>[</mo>\n \n <mrow>\n <mn>4</mn>\n \n <mi>m</mi>\n \n <mo>,</mo>\n \n <mn>16</mn>\n \n <msup>\n <mi>m</mi>\n \n <mn>2</mn>\n </msup>\n </mrow>\n \n <mo>]</mo>\n </mrow>\n \n <mo>⧹</mo>\n \n <mrow>\n <mo>{</mo>\n \n <mrow>\n <mn>4</mn>\n \n <mi>m</mi>\n \n <mo>+</mo>\n \n <mn>1</mn>\n </mrow>\n \n <mo>}</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math>, there is a QLS<span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mn>4</mn>\n \n <mi>m</mi>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n </semantics></math> with cardinality <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>c</mi>\n </mrow>\n </mrow>\n </semantics></math>.</p>\n </div>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"34 8","pages":"378-387"},"PeriodicalIF":0.8000,"publicationDate":"2026-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Designs","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jcd.70021","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/5/2 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
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 .
n阶的量子拉丁平方(记为QLS (n))是ann × n数组,其元素是来自n维希尔伯特空间h的单位列向量N,使得每一行和每一列形成一个标准正交基。两个单位向量∣u >,∣v >∈h h n如果存在一个实数θ满足∣u> = e I θ∣V >;否则,它们被认为是不同的。QLS (n)的基数c是数组中不同向量的个数。 在本文中,我们利用子qls (4) s证明了对于任意整数m≥2,任意整数c∈[4m],16 m 2]⧹{4 m + 1},有一个基数为c的QLS (4 m)。
期刊介绍:
The Journal of Combinatorial Designs is an international journal devoted to the timely publication of the most influential papers in the area of combinatorial design theory. All topics in design theory, and in which design theory has important applications, are covered, including:
block designs, t-designs, pairwise balanced designs and group divisible designs
Latin squares, quasigroups, and related algebras
computational methods in design theory
construction methods
applications in computer science, experimental design theory, and coding theory
graph decompositions, factorizations, and design-theoretic techniques in graph theory and extremal combinatorics
finite geometry and its relation with design theory.
algebraic aspects of design theory.
Researchers and scientists can depend on the Journal of Combinatorial Designs for the most recent developments in this rapidly growing field, and to provide a forum for both theoretical research and applications. All papers appearing in the Journal of Combinatorial Designs are carefully peer refereed.