Pith. sign in

REVIEW 3 major objections 6 minor 1 cited by

Quantum Latin squares with all possible cardinalities

T0 review · 3 major / 6 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For every m ≥ 2 and every integer c from 4m to (4m)^2, except 4m+1, some quantum Latin square of order 4m has exactly c distinct vectors.

desk verdict A real result—full cardinality spectrum for QLS(4m)—with a fixable gap: the proof leans on unverified overlap counts and a range-union typo. read the letter →

arxiv 2507.05642 v1 pith:7O566G5H submitted 2025-07-08 quant-ph

Ying Zhang , Xin Wang , Lijun Ji This is my paper · ORCID
classification quant-ph MSC 05B1581P68
keywords quantumLatinsquarecardinalitysub-QLS(4)orthonormalbasistensorproductconstructionorder4munitaryerrorbases
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proves that for every m ≥ 2 the cardinality spectrum of quantum Latin squares of order 4m is exactly the interval $[4m,16m^2]$ with the single value $4m+1$ removed. A quantum Latin square is an $n \times n$ array of unit vectors whose rows and columns are orthonormal bases, and its cardinality is the number of distinct vectors (up to global phase), so the result says every admissible size of “quantum content” occurs for these orders. The proof is a block construction: entries of a classical Latin square of order $m$ are replaced by carefully chosen $4\times 4$ quantum Latin squares, and the total number of distinct vectors is controlled by summing the numbers of new vectors that each block contributes. Since the impossibility of cardinality $n+1$ is already known, this closes the question for all orders divisible by 4.

What carries the argument

The carrying object is the sub-QLS$(4)$: a $4\times 4$ quantum Latin square in $\mathcal{H}_2^{\otimes 2}$ used as a building block. The argument depends on two families of such blocks: the squares $H_0,\dots,H_8$, whose intersections with fixed squares are exactly $\ell \in \{2,\dots,8\}$ elements, and the maximal-cardinality squares $W_0,\dots,W_4$ and $W_{2k-1,2k}$, whose pairwise intersections are listed in assertions (P1)–(P4). The key counting mechanism is the tensor-product substitution $|a_{i,j}\rangle \otimes X_{i,j}$: since different $|k\rangle$ factors live in orthogonal subspaces, the total cardinality is a sum over blocks, and choosing blocks with controlled overlaps turns the range of attainable sums into the interval $[4m,16m^2] \setminus \{4m+1\}$.

What would settle it

Perform an exact arithmetic check of the 16-vector sets defining $W_0,W_1,W_2,W_3,W_4$ and $H_\ell$ for $\ell = 0,\dots,8$, counting pairs of vectors equal up to global phase; the asserted counts are (P1)–(P4) and the stated numbers of new elements for each $H_\ell$. If any of these finite intersection counts differs, the cardinality formulas for order 8 and the upper range of Theorem 1.1 collapse.

Watch

Extended reading notes

Core claim

The central claim, Theorem 1.1, is that for any integer $m \geq 2$ and any $c \in [4m,16m^2] \setminus \{4m+1\}$, there exists a QLS$(4m)$ in $\mathcal{H}_m \otimes \mathcal{H}_2^{\otimes 2}$ with cardinality $c$. The construction starts from the classical Latin square $a_{i,j} = j-i \bmod m$ and replaces each entry $|a_{i,j}\rangle$ by $|a_{i,j}\rangle \otimes X_{i,j}$, where $X_{i,j}$ is one of a finite list of explicit QLS$(4)$s. Because the subspaces $|k\rangle \otimes \mathcal{H}_2^{\otimes 2}$ are mutually orthogonal, the cardinality of the resulting $4m \times 4m$ array is the sum of the cardinalities of its $m^2$ blocks, provided the blocks have no unintended shared vectors. The blocks drawn from $H_0,\dots,H_8$ (Lemma 2.1) and $W_0,\dots,W_4$ (Equation (9)) are chosen so that each contributes a prescribed number of new vectors; Lemma 3.2 carries out the count for order 8, and the same blocks are arranged along the diagonals of the order-$m$ Latin square to cover the whole range. Lemma 3.1's prohibition of cardinality $n+1$ makes the exclusion $4m+1$ necessary, so the theorem gives the complete possible set.

Load-bearing premise

The proof relies on unproved computational overlap statements, in particular (P1)–(P4) after Equation (9), which assert that $W_0,W_1,W_2,W_3,W_4$ share exactly the specified numbers of entries and that the other $W$-blocks introduce no accidental overlaps; if any of those intersection counts is incorrect, the block-sum cardinality formulas in Lemma 3.2 and Theorem 1.1 could fail.

Editorial extensions

If this is right

  • For $n = 4m$, the set of attainable cardinalities is exactly $[n,n^2] \setminus \{n+1\}$; no other gaps exist for these orders.
  • All constructed squares live in $\mathcal{H}_m \otimes \mathcal{H}_2^{\otimes 2}$, so the full cardinality spectrum is realized using only one $m$-dimensional space tensored with two qubit spaces.
  • Because Lemma 3.1 rules out $n+1$ for every order $n$, the result is the strongest possible statement for orders divisible by 4.
  • The block-substitution method yields concrete explicit QLS$(4m)$s for each cardinality, not merely an existence proof by counting arguments.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • For composite orders other than multiples of 4, the same block-substitution strategy would yield the cardinality spectrum if one can find a $q\times q$ quantum Latin square with controlled overlaps between its translates; the paper's conclusion says this is precisely the difficulty.
  • Assertions (P1)–(P4) are finite exact claims about explicit vectors, so a short computer verification or an algebraic proof would turn the 'it has been checked' step into a fully explicit part of the argument.
  • The final union display deletes $c = 16m^2 - 16m + 25$ from the second interval; taken literally this would omit $c = 121$ for $m=3$ and $c=217$ for $m=4$, although the paper's own sum formulas realize those values, so the deletion looks like a typographical slip.
  • Because every block is written with real coordinates, the construction shows the same cardinality range is attainable if one restricts to real Hilbert-space quantum Latin squares.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The manuscript studies the set of possible cardinalities of quantum Latin squares (QLS) of order 4m. The main result, Theorem 1.1, states that for every integer m≥2 and every integer c in [4m,16m²]\{4m+1}, there exists a QLS(4m) with exactly c distinct vectors. The proof is constructive: it builds QLS(8) with all cardinalities in [8,64]\{9} using carefully selected 4×4 blocks with controlled overlap (Lemmas 2.1, 3.2), and then obtains QLS(4m) by 'blowing up' a classical Latin square of order m with these 4×4 blocks (Theorem 1.1). The paper also proves the impossibility of cardinality n+1 for any order n (Lemma 3.1).

Significance. The result, if fully established, would determine the complete set of possible cardinalities for all QLS of order 4m (m≥2), since n+1 is provably impossible and the theorem covers all other values. The construction is explicit and the paper is generally well organized. The main theorem is attractive and would settle a natural question in the theory of quantum Latin squares. However, the proof as written contains several unproved computational overlap assertions (P1)-(P4) and 'easy to check' distinctness claims, plus an arithmetic error in the final range union; these must be repaired before the result can be considered rigorous. The manuscript does provide explicit matrices and formulas, so the missing checks are verifiable in principle.

major comments (3)
  1. [Section 3, after Eq. (9)] The claims (P1)-(P4) are stated as "It has been checked" with no derivation. These exact intersection sizes are load-bearing: they lead to the existence of QLS(4)s with 12, 14, 15 new elements relative to W0, to the cardinality-57 construction, and to the second range in Theorem 1.1. Note also that (P1) must be read as exactly one common element (|11⟩) for the cardinality calculations to work, although the text writes only "have a common element". Please supply a rigorous case check, e.g., an appendix listing the 16 vectors of each W_i and the intersections, or a verifiable computer algebra script.
  2. [Section 3, Lemma 3.2 and Theorem 1.1] The assertions that W_{5,6}, W_{7,8}, and the family W_{2i+3,2i+4} have all their elements distinct from the reference blocks (H_ℓ, and later W_0,...,W_4, H'_ℓ) are essential for the counting formulas, but are backed only by "it is easy to check" and a one-line argument in Lemma 2.3. Since the parameters a=2k−1, b=2k produce entries with square-root factors, distinctness is not immediate from coefficient inspection; a complete proof or an explicit verification for all relevant k is needed. Without it, the cardinality formulas in the two ranges of Theorem 1.1 lack support.
  3. [Section 3, proof of Theorem 1.1, final paragraph] The union computation contains an extra exclusion t=25: the second range was derived with missing values t∈{1,3,5,7,9,11,13}, yet the final union subtracts 16m²−16m+t also for t=25. Taken literally, this would leave c=121 (m=3) and c=217 (m=4) uncovered, even though the second-range construction achieves those values (for m=3, s=25 is 15+8+2 from the allowed set {0,2,4,6,8,12,14,15,16}). Removing 25 from the exclusion list repairs the union; for m=3 the explicit QLS(12) with cardinality 105 fills the remaining gap. This correction is necessary for the proof of Theorem 1.1.
minor comments (6)
  1. [Section 2, Lemma 2.2] Lemma 2.2 is cited from the preprint [12] without proof; since it is used to construct W0 and Wa,b, a short proof or attribution to a published source would improve self-containedness.
  2. [Section 2, Eq. (1)] Equation (1) is difficult to read in the current typesetting; the matrix entries should be separated more clearly.
  3. [Section 3, Lemma 3.2] The phrase "there are two QSL(4)s" should be "QLS(4)s"; similar "QSL" typos appear elsewhere.
  4. [Section 3, Lemma 3.2] The statement that W5,6 has 16 elements not in W0 "since the coefficients ... are irrational" is too terse; please spell out why no rational vector from W0 can coincide with an irrational-coefficient vector from W5,6.
  5. [Section 3, Theorem 1.1] The notation X_{0,j} is used both for the actual block chosen in row 0 and as an option for later rows; this is confusing and should be renamed.
  6. [Section 2, Lemma 2.3] The proof of Lemma 2.3 says "since k−t≠0, 1+kt≠0 and 1−kt≠0, all 32 elements ... are distinct"; this is not a complete argument and should be expanded.

Circularity Check

0 steps flagged · score 2.0 of 10

No definitional circularity: the main theorem is a constructive count of explicit QLS(4m) arrays, and the only self-citation is a parameter-free tensor-product lemma that does not contain the target result.

full rationale

The central claim (Theorem 1.1) is established by explicitly displaying QLS(4)s and QLS(8)s and counting their distinct entries: Lemma 2.1 constructs H_l by explicit orthonormal matrices, Lemma 3.2 builds QLS(8)s from tensor blocks and sums the overlaps, and the proof of Theorem 1.1 repeats this block substitution over a classical Latin square. The only self-citation is Lemma 2.2, cited from the co-author's preprint [12]. That lemma states a general tensor-product construction (c1 c2 cardinality) with stated assumptions that do not include the all-cardinality theorem; moreover, the W matrices it generates are also verified directly in the text by displaying the orthonormal Yi,a,b and Xi blocks. Thus the main construction does not reduce to the cited result. The unproved overlap assertions (P1)-(P4) and the 'easy to check' disjointness of the W_{2i+3,2i+4} from the other blocks are genuinely load-bearing computational facts, and if any count is wrong the cardinality formulas would break; this is a verification gap, not a circular reduction, because the counts are finite exact computations about explicit rational and irrational vectors rather than assumptions of the conclusion. The extra exclusion t=25 in the final union is an arithmetic slip, not a circular step. Overall the derivation is independent; score 2 reflects only the minor self-citation.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

There are no fitted parameters or invented physical entities. The real parameters in the constructions (a, b, x, y) are generic variables, and the rational constants (e.g., 3/5, 4/5, 5/13) are chosen for explicit orthonormal matrices, not fitted to data. The central claim rests on borrowed Lemma 2.2 and unproved computational overlap checks.

assumptions (3)
  • domain assumption Lemma 2.2 from [12]: the tensor product of an m x n and an n x m row-quantum Latin rectangle, via the index rule |w_{i,j;k,l}> = |u_{i,j+k}> tensor |v_{j,i+l}>, yields a QLS(mn) with cardinality c1*c2.
    Invoked in Section 3 (Lemma 3.2 and Theorem 1.1) without proof in this paper. It is cited to [12], a preprint by co-author Y. Zhang, so it is a self-cited borrowed result.
  • ad hoc to paper The overlap counts (P1)-(P4): W0 and W1 share exactly one element; W0 and W2 share exactly four; W0 and W3 share exactly two; W2 and W4 share exactly six.
    Stated after Equation (9) with 'It has been checked' but no derivation or code is provided. These counts are load-bearing for the cardinality formulas in Lemma 3.2 and Theorem 1.1.
  • domain assumption The distinctness assertions in Lemma 2.1: the listed H_l have exactly l distinct elements not in H0 or H1.
    The proof gives tables and some subspace reasoning, but the final counts for l=2..8 are summarized as 'same discuss counts' without full detail. These counts are used throughout the constructions.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantum Latin squares with all possible cardinalities." pith.science (2026). https://pith.science/paper/7O566G5H

@misc{pith2026250705642,
  author       = {Pith},
  title        = {Pith review of: Quantum Latin squares with all possible cardinalities},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7O566G5H}},
  note         = {Machine review of arXiv:2507.05642}
}
abstract

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 $\theta$ such that $|u\rangle=e^{i\theta}|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 paper, we use sub-QLS$(4)$s to prove that for any integer $m\geq 2$ and any integer $c\in [4m,16m^2]\setminus \{4m+1\}$, there is a QLS$(4m)$ with cardinality $c$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. New Cardinalities for Quantum Latin Squares of Order Six

    math.CO 2026-07 unverdicted novelty 6.0 of 10

    Explicit six-by-six quantum Latin squares with 19, 21, 23, 25, and 27 distinct states are constructed, completing the order-six cardinality list through 28.

Reference graph

Works this paper leans on

12 extracted references · 12 canonical work pages · cited by 1 Pith paper

  1. [1]

    P. W. Claeys, A. Lamacraft, and J. Vicary. From dual-unitary to biunitary: a 2-categorical model for exactly-solvable many-body quantum dynamics. Journal of Physics A: Mathematical and The- oretical, 57 (2024), 335301

    work page 2024

  2. [2]

    Goyeneche, Z

    D. Goyeneche, Z. Raissi, S. DiMartino, and K. ˙Zyczkowski, Entanglement and quantum combina- torial designs, Physical Review A, 97 (2018), 062326

    work page 2018

  3. [3]

    De Las Cuevas, T

    G. De Las Cuevas, T. Netzer, and L. Valentiner-Branth, Magic squares: Latin, semi-classical, and quantum, Journal of Mathematical Physics, 64 (2023), 022201

    work page 2023

  4. [4]

    Li and Y

    M. Li and Y. Wang, Masking quantum information in multipartite scenario, Physical Review A, 98 (2018), 062306

    work page 2018

  5. [5]

    Musto and J

    B. Musto and J. Vicary, Quantum Latin squares and unitary error bases, Quantum Information and Computation, 16 (2016), 1318-1332

    work page 2016

  6. [6]

    Nechita and J

    I. Nechita and J. Pillet, SudoQ–a quantum variant of the popular game, Quantum Information and Computation, 21 (2021), 781-799

    work page 2021

  7. [7]

    M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th An- niversary Edition, Cambridge: Cambridge University Press, 2010

    work page 2010

  8. [8]

    Paczos, M

    J. Paczos, M. Wierzbi´ nski, G. Rajchel-Mieldzio´ c, A. Burchardt, and K. ˙Zyczkowski, Genuinely quantum solutions of the game Sudoku and their cardinality. Physical Review A, 104 (2021), 042423

    work page 2021

Show all 12 references
  1. [9]

    S. A. Rather, N. Ramadas, V. Kodiyalam, and A. Lakshminarayan, Absolutely maximally entan- gled state equivalence and the construction of infinite quantum solutions to the problem of 36 officers of Euler, Physical Review A, 108 (2023), 032412

    2023

  2. [10]

    Y. Zang, Z. Tian, S. Fei, and H. Zuo, Quantum k-uniform states from quantum orthogonal arrays. International Journal of Theoretical Physics, 62 (2023), 73

    2023

  3. [11]

    Y. Zang, Z. Tian, H. Zuo, and S. Fei. Mutually unbiased maximally entangled bases from differ- ence matrices, Journal of Physics A: Mathematical and Theoretical, 55 (2022), 415204

    2022

  4. [12]

    Zhang and H

    Y. Zhang and H. Cao, The maximal cardinality of quantum Latin squares, Preprint. 9

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.