Published November 15, 2026 | Version 1.1

Orthogonal bases of symmetric unitary matrices in odd dimensions and the mixed-unitary rank of the symmetric Werner–Holevo channel

Authors/Creators

  • 1. ROR icon Shanghai Jiao Tong University

Description

Let Sym_n denote the space of complex symmetric n×n matrices with the Hilbert–Schmidt inner product. Girard, Leung, Levick, Li, Paulsen, Poon and Watrous showed that the symmetric Werner–Holevo channel on M_n has minimal mixed-unitary rank binom(n+1,2) if and only if Sym_n admits an orthogonal basis consisting of unitary matrices. They established this for even n and for n=3, and conjectured it for all odd n; Levick and Rahaman settled the case of primes n≡7 (mod 8). We introduce a family of symmetric unitaries ("chirped circulants") for odd n and prove that, for this family, the pairwise orthogonality conditions reduce exactly to a square system of (n^2-1)/4 real equations in as many unknown phases. Using this reduction we give (i) a fully explicit basis for n=5, with all entries in an explicit degree-8 number field and an exact-arithmetic verification, and (ii) a computer-assisted proof, based on the Krawczyk operator evaluated in Arb ball arithmetic, that a symmetric unitary orthogonal basis exists for every odd n with 3≤n≤67. Consequently the conjecture of Girard et al. holds for all n≤68. We also record several obstructions to natural approaches for general odd n, and a further reduction for prime n.

Notes

This is a preprint and has not been peer-reviewed. The author used AI assistance (Codex (OpenAI) and Claude (Anthropic); specific version numbers were not recorded) in the literature search, in designing and running the computational experiments, in writing the accompanying verification and certification code, and in drafting the manuscript. The human author is solely responsible for verifying all results, for the correctness of the proofs and computations, and for the final text. AI is not an author. The paper (paper.pdf) is licensed under CC-BY-4.0 and the code archive (code.zip) under the MIT License.

Files

code.zip

Files (285.8 kB)

Name Size
md5:b33e1f70c6bbee1c9b25332b2cb2e697
124.3 kB Preview Download
md5:a9e6292ab58605d54ffc0ef7c29c6760
161.6 kB Preview Download

Additional details

Related works

Cites
Journal article: 10.1007/s00220-022-04412-y (DOI)
Preprint: arXiv:2003.14405 (arXiv)
Journal article: 10.1007/s11128-021-03312-9 (DOI)
Preprint: arXiv:2105.00975 (arXiv)