53 research outputs found
Recommended from our members
The Kadison-Singer problem
In quantum mechanics, unlike in classical mechanics, one cannot make precise predictions about how a system will behave. Instead, one is concerned with mere probabilities. Consequently, it is a very important task to determine the basic probabilities associated with a given system. In this snapshot we will present a recent uniqueness result concerning these probabilities
Is the Algorithmic Kadison-Singer Problem Hard?
We study the following problem: let be
some constant, and be vectors such that
for any and for any with . The
problem asks to find some , such that it holds
for all with that or
report no if such doesn't exist. Based on the work of Marcus et al. and
Weaver, the problem can be seen as the algorithmic
Kadison-Singer problem with parameter .
Our first result is a randomised algorithm with one-sided error for the
problem such that (1) our algorithm finds a valid set with probability at least , if such exists, or (2)
reports no with probability , if no valid sets exist. The algorithm has
running time O\left(\binom{m}{n}\cdot \mathrm{poly}(m, d)\right)~\mbox{ for
}~n = O\left(\frac{d}{\epsilon^2} \log(d)
\log\left(\frac{1}{c\sqrt{\alpha}}\right)\right), where is a
parameter which controls the error of the algorithm. This presents the first
algorithm for the Kadison-Singer problem whose running time is quasi-polynomial
in , although having exponential dependency on . Moreover, it shows that
the algorithmic Kadison-Singer problem is easier to solve in low dimensions.
Our second result is on the computational complexity of the
problem. We show that the
problem is -hard for general values of , and solving the
problem is as hard as solving the
\mathsf{NAE\mbox{-}3SAT} problem
Twice-Ramanujan Sparsifiers
We prove that every graph has a spectral sparsifier with a number of edges
linear in its number of vertices. As linear-sized spectral sparsifiers of
complete graphs are expanders, our sparsifiers of arbitrary graphs can be
viewed as generalizations of expander graphs.
In particular, we prove that for every and every undirected, weighted
graph on vertices, there exists a weighted graph
with at most \ceil{d(n-1)} edges such that for every , where and
are the Laplacian matrices of and , respectively. Thus,
approximates spectrally at least as well as a Ramanujan expander with
edges approximates the complete graph. We give an elementary
deterministic polynomial time algorithm for constructing
- β¦