132 research outputs found
Quantum expanders and growth of group representations
Let be a finite dimensional unitary representation of a group with
a generating symmetric -element set . Fix \vp>0. Assume that
the spectrum of is
included in [-1, 1-\vp] (so there is a spectral gap \ge \vp). Let
be the number of distinct irreducible representations of dimension
that appear in . Then let R_{n,\vp}'(N)=\sup r'_N(\pi) where the
supremum runs over all with {n,\vp} fixed. We prove that there are
positive constants \delta_\vp and c_\vp such that, for all sufficiently
large integer (i.e. with depending on \vp) and for all
, we have \exp{\delta_\vp nN^2} \le R'_{n,\vp}(N)\le \exp{c_\vp
nN^2}. The same bounds hold if, in , we count only the number of
distinct irreducible representations of dimension exactly .Comment: Main addition: A remark due to Martin Kassabov showing that the
numbers R(N) grow faster than polynomial. v3: Minor clarification
Efficient Quantum Tensor Product Expanders and k-designs
Quantum expanders are a quantum analogue of expanders, and k-tensor product
expanders are a generalisation to graphs that randomise k correlated walkers.
Here we give an efficient construction of constant-degree, constant-gap quantum
k-tensor product expanders. The key ingredients are an efficient classical
tensor product expander and the quantum Fourier transform. Our construction
works whenever k=O(n/log n), where n is the number of qubits. An immediate
corollary of this result is an efficient construction of an approximate unitary
k-design, which is a quantum analogue of an approximate k-wise independent
function, on n qubits for any k=O(n/log n). Previously, no efficient
constructions were known for k>2, while state designs, of which unitary designs
are a generalisation, were constructed efficiently in [Ambainis, Emerson 2007].Comment: 16 pages, typo in references fixe
Ramanujan Complexes and bounded degree topological expanders
Expander graphs have been a focus of attention in computer science in the
last four decades. In recent years a high dimensional theory of expanders is
emerging. There are several possible generalizations of the theory of expansion
to simplicial complexes, among them stand out coboundary expansion and
topological expanders. It is known that for every d there are unbounded degree
simplicial complexes of dimension d with these properties. However, a major
open problem, formulated by Gromov, is whether bounded degree high dimensional
expanders, according to these definitions, exist for d >= 2. We present an
explicit construction of bounded degree complexes of dimension d = 2 which are
high dimensional expanders. More precisely, our main result says that the
2-skeletons of the 3-dimensional Ramanujan complexes are topological expanders.
Assuming a conjecture of Serre on the congruence subgroup property, infinitely
many of them are also coboundary expanders.Comment: To appear in FOCS 201
Random Unitaries Give Quantum Expanders
We show that randomly choosing the matrices in a completely positive map from
the unitary group gives a quantum expander. We consider Hermitian and
non-Hermitian cases, and we provide asymptotically tight bounds in the
Hermitian case on the typical value of the second largest eigenvalue. The key
idea is the use of Schwinger-Dyson equations from lattice gauge theory to
efficiently compute averages over the unitary group.Comment: 14 pages, 1 figur
Recommended from our members
Expanders with Symmetry: Constructions and Applications
Expanders are sparse yet well-connected graphs with numerous theoretical and practical uses. Symmetry is a valuable structure for expanders as it enables efficient algorithms and a richer set of applications. This thesis studies expanders with symmetry, giving new constructions and applications. We extend expander construction techniques to work with symmetry and give explicit constructions of expanders with varying quality of expansion and symmetries of various groups. In particular, we construct graphs with large Abelian group symmetries via the technique of \textit{graph lifts}. We also give a generic amplification procedure that converts a weak expander to an almost optimal one while preserving symmetries. This procedure is obtained by generalizing prior amplification techniques that work for Cayley graphs over Abelian groups to Cayley graphs over any finite group. In particular, we obtain almost-Ramanujan expanders over every non-abelian finite simple group. We then explore the utility of having both symmetry and expansion simultaneously. We obtain explicit quantum LDPC codes of almost linear distance and \textit{good} classical quasi-cyclic codes with varying circulant sizes using prior results and our constructions of graphs with Abelian symmetries. We show how our generic amplification machinery boosts various structured expander-like objects: \textit{quantum expanders}, \textit{dimension expanders}, and \textit{monotone expanders}. Finally, we prove a structural result about expanding Cayley graphs, showing that they satisfy a \enquote{degree-2} variant of the \textit{expander mixing lemma}. As an application of this, we give a randomness-efficient query algorithm for \textit{homomorphism testing} of unitary-valued functions on finite groups and a derandomized version of the celebrated Babai--Nikolov--Pyber (BNP) lemma
- …