In a Hilbert space of dimension $d$, how do I calculate the largest number $N(\epsilon, d)$ of vectors $\{V_i\}$ which satisfies the following properties. Here $\epsilon$ is small but finite compared to 1.

$$\left\langle V_i\middle|V_i\right\rangle = 1$$

$$\left|\middle\langle V_i\middle|V_j\middle\rangle\right| \leq \epsilon, i \neq j$$

Some examples are as follows.

  1. $N(0, d)$ = d

  2. $N\left(\frac{1}{2}, 2\right)$ = 3, this can be seen by explicit construction of vectors using the Bloch sphere.

  3. $N\left(\frac{1}{\sqrt{2}}, 2\right) = 6$, again using the same logic.

How do I obtain any general formula for $N(\epsilon, d)$. Even an approximate form for $N(\epsilon, d)$ in the large $d$ and small $\epsilon$ limit works fine for me.


3 Answers 3


There is no general exact formula for $N(\epsilon, d)$ and some special cases (for example SIC-POVM) is an area of active research.

However there is a Welch bound that gives $\epsilon^2 \ge \frac{n-d}{d(n-1)}, n=N(\epsilon, d)$ and hence bounds $N(\epsilon, d)$ from above.


This seems like it should be a known mathematical property of Hilbert spaces, but I can't immediately lay my hand on any such result. In lieu of that, this is very far from an answer to your question, but it perhaps indicates the difficulty of (some of) what you're asking...

First, perhaps we can clarify your problem statement. I assume you mean $$ |\langle V_i|V_j\rangle|\leq\epsilon,i\neq j? $$ This would be consistent with your statement that $N(1/\sqrt{2},2)=6$ because here you're be talking about the eigenvectors of the X,Y and Z Pauli operators. But Since you have both $|0\rangle$ and $|1\rangle$, for example, their overlaps are 0, not $1/\sqrt{2}$.

Assuming this is the statement that you wanted...

There is the concept of Mutually Unbiased Bases. Essentially, this is attempting to evaluate $N(1/\sqrt{d},d)$. (Strictly, it is a lower bound.) In the case that $d$ is the power of a prime, then there are $d+1$ mutually unbiased bases, meaning a set of $d(d+1)$ vectors. However, if $d$ cannot be written in this form, there are only bounds on the number of bases. For example, $d=6$, an answer is suspected but not known.

Of course, this doesn't rule out the possibility of getting the sort of limits you're after, but suggests that exact evaluation for arbitrary parameter values might be problematic. That said, you might want to clarify what you mean by the small $\epsilon$ limit - you've already given the answer for $\epsilon=0$, so that must be the small $\epsilon$ limit.

You might be able to get some mileage out of this paper. It's related to mutually unbiased bases, but gives some other bounds as well which might be adapted to your purposes.

  • $\begingroup$ Thanks for pointing out the typo. I am taking a look at your references, which seem quite helpful on first look. $\endgroup$
    – user2669
    Commented Jul 18, 2019 at 7:44

This is quite old now, but for the benefit of people coming across this post there is a good discussion of this problem on Terence Tao's blog: https://terrytao.wordpress.com/2013/07/18/a-cheap-version-of-the-kabatjanskii-levenstein-bound-for-almost-orthogonal-vectors/

See also a very similar question at https://mathoverflow.net/questions/158575/more-than-n-approximately-orthonormal-vectors-in-rn

  • $\begingroup$ This is a "link-only" answer. I recommend to go into detail. $\endgroup$ Commented Oct 11, 2023 at 11:09
  • $\begingroup$ As it’s currently written, your answer is unclear. Please edit to add additional details that will help others understand how this addresses the question asked. You can find more information on how to write good answers in the help center. $\endgroup$
    – Community Bot
    Commented Oct 11, 2023 at 11:09

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.