Undesired coupling to the surrounding environment destroys long-range correlations on
quantum processors and hinders the coherent evolution in the nominally available …

Quantum cryptography promises levels of security that are impossible to attain in a classical
world. Can this security be guaranteed to classical users of a quantum protocol, who may …

This is a survey of pseudorandomness, the theory of efficiently generating objects that" look
random" despite being constructed using little or no randomness. This theory has …

Quantum physics can be exploited to generate true random numbers, which have important
roles in many applications, especially in cryptography. Genuine randomness from the …

We show that derandomizing Polynomial Identity Testing is, essentially, equivalent to
proving circuit lower bounds for NEXP. More precisely, we prove that if one can test in …

The main contribution is a new type of graph product, which we call the zig-zag product.
Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its …

The multipath-rich wireless environment associated with typical wireless usage scenarios is
characterized by a fading channel response that is time-varying, location-sensitive, and …

We give an improved explicit construction of highly unbalanced bipartite expander graphs
with expansion arbitrarily close to the degree (which is polylogarithmic in the number of …

We introduce a new approach to constructing extractors. Extractors are algorithms that
transform a “weakly random” distribution into an almost uniform distribution. Explicit …

Traditional security mechanisms are mainly based on the distribution of shared secret keys.
Yet, this task is nontrivial in large wireless networks, because of mobility and scalability …