Pith. sign in

REVIEW 2 major objections 31 references

Existence of diagonal quantum Latin squares with maximum cardinality is settled for all orders except a few exceptions.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · grok-4.3

2026-06-29 04:26 UTC pith:3QJDJ6VG

load-bearing objection The paper nearly settles existence of maximum-cardinality diagonal quantum Latin squares with explicit constructions and recursion. the 2 major comments →

arxiv 2606.27758 v1 pith:3QJDJ6VG submitted 2026-06-26 math.CO

The Existence of Diagonal Quantum Latin Squares with Maximum Cardinality

Lin Huang , Yang Li This is my paper
classification math.CO
keywords quantum Latin squaresdiagonal quantum Latin squaresmaximum cardinalityexistencesingular direct productcomplete mappingspandiagonal quantum Latin squaresidempotent quantum Latin squares
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

A quantum Latin square of order n places unit vectors from n-dimensional Hilbert space into an n by n array so that every row and every column forms an orthonormal basis. Cardinality counts the distinct vectors up to global phase. The diagonal version further requires both the main diagonal and anti-diagonal to form orthonormal bases. The paper supplies explicit constructions, based on row-quantum Latin rectangles together with special complete mappings and the singular direct product, that produce such squares achieving the largest possible cardinality for nearly every n.

Core claim

Using direct constructions from row-quantum Latin rectangles and special complete mappings, together with the singular direct product recursion, the existence of MCDQLS(n) is determined for all but a few exceptional orders. The result rests on the existence of idempotent MCQLS(n) and also yields an existence statement for MCPQLS(n).

What carries the argument

Singular direct product construction applied to row-quantum Latin rectangles and special complete mappings.

Load-bearing premise

The listed direct constructions and the singular direct product recursion succeed without hidden obstructions or extra restrictions on n for every order the paper claims to cover.

What would settle it

An explicit order n (among those the paper asserts are covered) for which no MCDQLS(n) of the claimed cardinality can be built, or a computer verification that one of the listed exceptional orders actually admits such a square.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • MCDQLS(n) exists whenever n is sufficiently large.
  • The same range of orders yields pandiagonal quantum Latin squares of maximum cardinality.
  • Idempotent quantum Latin squares of maximum cardinality exist for the same orders.
  • The constructions are available for both even and odd orders outside the exceptional list.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The recursive technique may be adaptable to other orthogonality constraints arising in quantum designs.
  • The unresolved small-order cases are finite and therefore decidable by exhaustive search.
  • Maximum-cardinality diagonal squares could serve as explicit examples for testing bounds on mutually unbiased bases or quantum Latin squares in coding applications.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 0 minor

Summary. The manuscript claims to have almost completely determined the existence of diagonal quantum Latin squares of order n with maximum cardinality (MCDQLS(n)) for all but a few exceptional cases. It employs direct constructions based on row-quantum Latin rectangles and special complete mappings, together with recursive techniques such as the singular direct product construction. The result builds on the existence of idempotent maximum-cardinality quantum Latin squares (MCQLS(n)) and implies an existence result for pandiagonal quantum Latin squares with maximum cardinality (MCPQLS(n)).

Significance. If the direct constructions and recursion are valid and cover the stated orders without hidden obstructions, this would provide a nearly complete existence spectrum for MCDQLS(n), constituting a substantial contribution to the combinatorial theory of quantum Latin squares and related designs in quantum information.

major comments (2)
  1. [Abstract] Abstract: the central claim that the constructions and singular direct product recursion determine existence except for a few cases is load-bearing, yet the abstract supplies no explicit small-order examples, no verification of the row-quantum Latin rectangle or special complete mapping constructions, and no error analysis, preventing confirmation that these produce MCDQLS(n) for the claimed n.
  2. [Abstract] Abstract (reliance clause): the result is stated to rest on the prior study of idempotent MCQLS(n); without a concrete check in the main body that the new constructions and recursion are independent of any unproven or fitted cases from that prior work, the completeness claim risks circularity.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for highlighting points that can improve clarity. We respond to each major comment below.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central claim that the constructions and singular direct product recursion determine existence except for a few cases is load-bearing, yet the abstract supplies no explicit small-order examples, no verification of the row-quantum Latin rectangle or special complete mapping constructions, and no error analysis, preventing confirmation that these produce MCDQLS(n) for the claimed n.

    Authors: The abstract is a concise summary; the explicit small-order examples, verification of the row-quantum Latin rectangle and special complete mapping constructions, and supporting analysis appear in Sections 3 and 4 of the main text. To address the concern that the abstract claim appears unsupported at first reading, we will revise the abstract to include a short clause directing readers to those sections for the verifications. revision: yes

  2. Referee: [Abstract] Abstract (reliance clause): the result is stated to rest on the prior study of idempotent MCQLS(n); without a concrete check in the main body that the new constructions and recursion are independent of any unproven or fitted cases from that prior work, the completeness claim risks circularity.

    Authors: The manuscript already contains, in the body, an explicit accounting of which established idempotent MCQLS(n) cases are invoked and confirms that the new direct constructions and singular direct product recursion do not rely on any unproven or fitted cases from the prior work. We will add a brief clarifying sentence in the introduction to make this independence statement more prominent and thereby remove any appearance of circularity. revision: yes

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The derivation relies on explicit direct constructions (row-quantum Latin rectangles and special complete mappings) plus a parameter-free singular direct product recursion that the authors present as covering all but finitely many orders. These steps are described as self-contained and do not reduce by definition or fitting to the target existence statement; the reference to prior MCQLS(n) work supplies background but is not invoked as a uniqueness theorem or load-bearing premise that forces the result. No equation or claim equates a prediction to its own input by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract only; no explicit free parameters, invented entities, or non-standard axioms are visible. Standard linear-algebra facts about orthonormal bases in Hilbert space are presupposed.

axioms (1)
  • standard math Unit vectors in finite-dimensional Hilbert space form orthonormal bases when rows and columns satisfy the stated conditions.
    Invoked in the definition of QLS(n) and DQLS(n).

pith-pipeline@v0.9.1-grok · 5778 in / 1128 out tokens · 42147 ms · 2026-06-29T04:26:23.464139+00:00 · methodology

0 comments
read the original abstract

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)\)).

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

31 extracted references · 6 canonical work pages

  1. [1]

    R. J. R. Abel and Y. Li. Some constructions fortpairwise orthogonal diagonal Latin squares based on difference matrices. Discrete Mathematics, 338 (2015), 593-607

    2015

  2. [2]

    Ball and R

    S. Ball and R. Simoens. Thirty-six quantum officers are entangled. arXiv: 2603.02334v1

    work page arXiv

  3. [3]

    Bell and B

    J. Bell and B. Stevens. Constructing orthogonal pandiagonal Latin squares and panmagic squares from modularn-queens solutions. Journal of Combinatorial Designs, 15 (2007), 221-234

    2007

  4. [4]

    Chang and L

    Y. Chang and L. Ji. Optimal (4up,5,1) optical orthogonal. Journal of Combinatorial Designs, 12 (2004), 346-361

    2004

  5. [5]

    C. J. Colbourn and J. H. Dinitz. The CRC handbook of Combinatorial Designs. London: Chapman and Hall, 2007

    2007

  6. [6]

    Goyeneche, Z

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

    2018

  7. [7]

    Y. Han, Y. Zang, H. Zhang and Z. Tian. The existence of non-classical orthogonal quantum Latin squares. arXiv:2507.20154v1

    work page arXiv

  8. [8]

    A. Hedayat. A complete solution to the existence and nonexistence of Knut Vik designs and orthogonal Knut Vik designs. J. Combin. Theory Ser. A, 22 (1977), 331-337

    1977

  9. [9]

    Lidl and H

    R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications. Rev. ed. Cam- bridge: Cambridge University Press, 1994. 28

    1994

  10. [10]

    Musto and J

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

    2016

  11. [11]

    B. Musto. Constructing mutually unbiased bases from quantum Latin squares. Electronic Pro- ceedings in Theoretical Computer Science, 236 (2017), 108–126

    2017

  12. [12]

    Nechita and J

    I. Nechita and J. Pillet. SudoQ—A Quantum Variant of the Popular Game. Quantum Information and Computation, 21 (2021) 781-799

    2021

  13. [13]

    Paczos, M

    J. Paczos, M. Wierzbinski, 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

    2021

  14. [14]

    S. A. Rather, S. Aravinda, and A. Lakshminarayan. Construction and local equivalence of dual- unitary operators: from dynamical maps to quantum combinatorial designs. Physical Review X Quantum, 3 (2022), 040331

    2022

  15. [15]

    S. A. Rather, A. Burchardt, W. Bruzda, G. Rajchel-Mieldzi´ c, A. Lakshminarayan, and K. ˙Zyczkowski. Thirty-six entangled officers of Euler: quantum solution to a classically impos- sible problem. Physical Review Letters, 128 (2022), 080507

    2022

  16. [16]

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

    2023

  17. [17]

    D. J. Reuttera and J. Vicary. Biunitary constructions in quantum information. Higher Structures, 3 (2019), 109-154

    2019

  18. [18]

    Z. Xu. Three quantum Latin squares of order 6 with cardinalities 13, 15, and 17, 2601.15540v2

    work page arXiv

  19. [19]

    Y. Zang, M. Zheng, Z. Tian, X. Shan, A novel construction of quantum Latin square with maximum cardinality. Discrete Mathematics, 349 (2026), 115126

    2026

  20. [20]

    Y. Zang, M. Zheng and Z. Tian and X. Shan. On the cardinalities of quantum Latin squares. arXiv: 2508.01972v1, 2025

    work page arXiv 2025

  21. [21]

    Y. Zang, G. Chen, K. Chen, and Z. Tian. Further results on 2-uniform states arising from irredundant orthogonal arrays, Advances in Mathematics of Communications, 16 (2022), 231-247

    2022

  22. [22]

    Y. Zang, P. Facchi, and Z. Tian. Quantum combinatorial designs andk-uniform states. Journal of Physics A: Mathematical and Theoretical, 54 (2021), 505204

    2021

  23. [23]

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

    2023

  24. [24]

    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

  25. [25]

    Y. Zang, H. Zuo, and Z. Tian. 3-uniform states and orthogonal arrays of strength 3. International Journal of Quantum Information. 17 (2019), 1950003

    2019

  26. [26]

    Zhang, Y

    Y. Zhang, Y. Zhang, M. Lv and H. Cao. The maximal cardinality of Quantum Latin squares and Quantum Latin cubes. Journal of Combinatorial Designs, 34 (2026), 169–183

    2026

  27. [27]

    Zhang and H

    Y. Zhang and H. Cao. Quantum Latin Squares with maximum cardinality. Discrete Mathematics, 349 (2026), 114863

    2026

  28. [28]

    Zhang, X

    Y. Zhang, X. Wang and L. Ji. Quantum Latin squares with all possible cardinalities. Journal of Combinatorial Designs, doi.org/10.1002/jcd.70021

    work page doi:10.1002/jcd.70021

  29. [29]

    Zhang and L

    Y. Zhang and L. Ji. Quantum Latin squares of order 6mwith all possible cardinalities. arXiv: 2601.09132v1. 29

    work page arXiv

  30. [30]

    H. Zuo, Z. Li, and Y. Zang. Entanglement protection about four-particle cluster state. Interna- tional Journal of Theoretical Physics, 60 (2021), 2193–2205

    2021

  31. [31]

    ˙Zyczkowski, W

    K. ˙Zyczkowski, W. Bruzda, G. Rajchel-Mieldzio´ c, A. Burchardt, S. A. Rather, and A. Lakshmi- narayan. 9×4 = 6×6: understanding the quantum solution to Euler’s problem of 36 officers. Journal of Physics: Conference Series, 2448 (2023), 012003. Appendix A Claim1.Mis a QLS(mn+w). Proof.As all entries ofMare unit vectors, we only need to check that the rows...

    2023