# Non-Archimedean Welch Bounds and Non-Archimedean Zauner Conjecture

Source: [Non-Archimedean Welch Bounds and Non-Archimedean Zauner Conjecture](<https://www.sota2.com/research/paper/68fa59ac1e209131ce9b93c0>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-27T05:24:35.209Z

Authors: K. Mahesh Krishna

Published: 2022-08-28T06:12:50.000Z

## Abstract

Let $\\mathbb{K}$ be a non-Archimedean (complete) valued field satisfying \\begin{align\*} \\left\|\\sum\_{j=1}^{n}\\lambda\_j^2\\right\|=\\max\_{1\\leq j \\leq n}\|\\lambda\_j\|^2, \\quad \\forall \\lambda\_j \\in \\mathbb{K}, 1\\leq j \\leq n, \\forall n \\in \\mathbb{N}. \\end{align\*} For $d\\in \\mathbb{N}$, let $\\mathbb{K}^d$ be the standard $d$-dimensional non-Archimedean Hilbert space. Let $m \\in \\mathbb{N}$ and $\\text{Sym}^m(\\mathbb{K}^d)$ be the non-Archimedean Hilbert space of symmetric m-tensors. We prove the following result. If $\\{\\tau\_j\\}\_{j=1}^n$ is a collection in $\\mathbb{K}^d$ satisfying $\\langle \\tau\_j, \\tau\_j\\rangle =1$ for all $1\\leq j \\leq n$ and the operator $\\text{Sym}^m(\\mathbb{K}^d)\\ni x \\mapsto \\sum\_{j=1}^n\\langle x, \\tau\_j^{\\otimes m}\\rangle \\tau\_j^{\\otimes m} \\in \\text{Sym}^m(\\mathbb{K}^d)$ is diagonalizable, then \\begin{align} (1) \\quad \\quad \\quad \\max\_{1\\leq j,k \\leq n, j \\neq k}\\{\|n\|, \|\\langle \\tau\_j, \\tau\_k\\rangle\|^{2m} \\}\\geq \\frac{\|n\|^2}{\\left\|{d+m-1 \\choose m}\\right\| }. \\end{align} We call Inequality (1) as the non-Archimedean version of Welch bounds obtained by Welch \[\\textit{IEEE Transactions on Information Theory, 1974}\]. We formulate non-Archimedean Zauner conjecture.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2210.07062>)

[PDF](<https://arxiv.org/pdf/2210.07062.pdf>)
