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

Discrete Mathematics

A novel construction of quantum Latin square with maximum cardinality

Yajuan Zang, Meihui Zheng, Zihong Tian, Xiuling Shan

Published Mar 20, 2026• 1 citation
Publisher
DOI
10.1016/j.disc.2026.115126

Related papers

Quantum Latin squares with maximal cardinality

Yuyuan Zhang, Haitao Cao

Discrete Mathematics•Nov 4, 2025•2 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•0 citations

A larger quantum alphabet

Roberto Osellame

Nature•Jun 1, 2017•2 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•0 citations

Constructing quantum codes

Hao Chen

Frontiers of Computer Science in China•Jun 1, 2008•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
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.