Let p be a prime. For d∈N, let Qpd be the
standard d-dimensional p-adic Hilbert space. Let m∈N and
Symm(Qpd) be the p-adic Hilbert space of symmetric
m-tensors. We prove the following result. Let {τj}j=1n be a
collection in Qpd satisfying (i) ⟨τj,τj⟩=1 for all 1≤j≤n and (ii) there exists b∈Qp
satisfying ∑j=1n⟨x,τj⟩τj=bx for all x∈Qpd. 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 p-adic version of Welch bounds
obtained by Welch [\textit{IEEE Transactions on Information Theory, 1974}].
Inequality (1) differs from the non-Archimedean Welch bound obtained recently
by M. Krishna as one can not derive one from another. We formulate p-adic
Zauner conjecture.Comment: 10 Pages, 0 Figure