18 search results - page 1 / 4 » Quantum Expanders: Motivation and Construction |
TOC
2010
12 years 11 months ago
2010
: We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
COCO
2008
Springer
13 years 6 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
FOCS
2007
IEEE
13 years 10 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...