17
$\begingroup$

(also asked here, no replies)

A $(d,\lambda)$-quantum expander is a distribution $\nu$ over the unitary group $\mathcal{U}(d)$ with the property that: a) $|\mathrm{supp} \ \nu| =d$, b) $\Vert \mathbb{E}_{U \sim \nu} U \otimes U^{\dagger} - \mathbb{E}_{U \sim \mu_H} U \otimes U^{\dagger}\Vert_{\infty} \leq \lambda$, where $\mu_H$ is the Haar measure. If instead of distributions over unitaries we consider distributions over permutation matrices, it's not difficult to see that we recover the usual definition of a $d$-regular expander graph. For more background, see e.g.: Efficient Quantum Tensor Product Expanders and k-designs by Harrow and Low.

My question is - do quantum expanders admit any kind of geometric interpretation similar to classical expanders (where spectral gap $\sim$ isoperimetry/expansion of the underlying graph)? I don't define "geometric realization" formally, but conceptually, one could hope that purely spectral criterion can be translated to some geometric picture (which, in the classical case, is the source of mathematical richness enjoyed by expanders; mathematical structure of quantum expanders seem to be much more limited).

$\endgroup$
  • 8
    $\begingroup$ Maybe there's a simpler question lurking beneath ? There's a natural random walk associated with the Laplacian of a graph, and the eigenvalues of the latter tell you about the mixing of the former. It's this "geometric" view of random walks (in terms of heat diffusion) that helps us interpret expanders in the classical case. Is there a similar link between quantum random walks and properties of associated Hadamard matrices ? $\endgroup$ – Suresh Venkat Apr 8 '12 at 23:02
7
$\begingroup$

[This answer was copied from my answer on the now-defunct theoreticalphysics stackexchange site.] For classical expanders, the spectral definition can be expressed in terms of the second-smallest eigenvalue of the graph Laplacian, which can be thought of as the minimum of a quadratic form over all unit vectors orthogonal to the all-ones vector. If we restrict this minimization to vectors of the form (a,a,...,a, b,b, ..b), then this yields the edge expansion of the graph. here is a discussion. The rough equivalence of these two definitions is known as Cheeger's inequality.

This suggests that for the quantum case we should consider the action of the channel (formed by applying a random unitary from the expander) on projectors. A result analogous to Cheeger's inequality is derived in Appendix A of arXiv:0706.0556.

On the other hand, while this is mathematically analogous, we do still know of many fewer applications of quantum expanders than are known for classical expanders.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.