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

Primarily AI-generated textHuman understanding: some partsmath.FA — Functional Analysis

Contributed by Qiyuan Ma ↗

Version 1 / Nov 17, 2026 / CC BY 4.0

Abstract

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.

Provenance statement

AI assistance (Codex (OpenAI) and Claude (Anthropic); specific version numbers were not recorded) was used 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 submitting human author reports that some parts, but not all, have been checked and understood; the supplied materials do not specify which parts have or have not been checked. AI is not an author. Related preprint and code: https://zenodo.org/records/24246318.

References

  1. A. R. Calderbank, R. H. Hardin, E. M. Rains, P. W. Shor, and N. J. A. Sloane, A group-theoretic framework for the construction of packings in G rassmannian spaces , J. Algebraic Combin. 9 (1999), no. 2, 129--140.
  2. Mark Girard, Debbie Leung, Jeremy Levick, Chi-Kwong Li, Vern Paulsen, Yiu Tung Poon, and John Watrous, On the mixed-unitary rank of quantum channels , Comm. Math. Phys. 394 (2022), no. 2, 919--951, arXiv:2003.14405.arXiv
  3. Fredrik Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic , IEEE Trans. Comput. 66 (2017), no. 8, 1281--1292.
  4. R. Krawczyk, N ewton- A lgorithmen zur B estimmung von N ullstellen mit F ehlerschranken , Computing 4 (1969), no. 3, 187--201.
  5. Jeremy Levick and Mizanur Rahaman, An extension of B ravyi-- S molin's construction for UMEB s , Quantum Inf. Process. 20 (2021), no. 11, Paper No. 369, arXiv:2105.00975.arXiv
  6. Luftbahnfahrer, Existence of orthogonal basis of symmetric n×nn\times n matrices, where each matrix is unitary? , MathOverflow, question 316985, 2018, https://mathoverflow.net/questions/316985.link
  7. R. E. Moore, A test for existence of solutions to nonlinear systems , SIAM J. Numer. Anal. 14 (1977), no. 4, 611--615.
  8. Siegfried M. Rump, Verification methods: rigorous results using floating-point arithmetic , Acta Numer. 19 (2010), 287--449.
  9. The FLINT team , python-flint: P ython bindings for FLINT (incl.\ A rb), version 0.9.0 , https://github.com/flintlib/python-flint, PyPI package python-flint .link
  10. R. F. Werner and A. S. Holevo, Counterexample to an additivity conjecture for output purity of quantum channels , J. Math. Phys. 43 (2002), no. 9, 4353--4357.

Version history

  1. v1 · 8 pagesSubmitted by Qiyuan MaInitial depositCurrentNov 16, 2026