The query model is one of the most basic computational
models. In contrast to the Turing machine model, fundamental
questions regarding the power of randomness and quantum computing
are relatively well-understood. For example, it is
well-known...
Quantum computers employ quantum circuits to implement
algorithms. They are composed of quantum gates that act on near
neighbors according to some spatial geometry. They are particular
instances of quantum cellular automata (QCA), the set of...
In the last forty years, the study of singularity formation has
mostly concerned model problems and focusing non linearities. In
this second lecture, we will try to give a unified overview on the
known mechanisms of singularity formation, with in...
Given i.i.d. samples drawn from an unknown distribution over a
large domain [N], approximating several basic quantities, such as
the distribution's support size and its Shannon Entropy, requires
at least roughly (N / \log N) samples [Valiant and...
Historians of Science and Medicine emphasize how the circulation
of human biological material for global science involves complex
exchange systems amongst foreign and local scientists. Here,
notions of the gift and reciprocity underpin the idiom of...
The 4th Clay Millenium problem has a very simple formulation:
may viscous incompressible fluids form a singularity in finite
time? The answer is no in dimension two as proved by Leray in 1932,
but the three dimensional problem is out of reach. More...
I will discuss some recent progress in analytic number theory
for polynomials over finite fields, giving strong new estimates for
the number of primes in arithmetic progressions, as well as for
sums of some arithmetic functions in arithmetic...
Recently P. Etingof, E. Frenkel, and D. Kazhdan, following
earlier contributions by R. Langlands and J. Teschner, described an
“analytic” approach to the geometric Langlands correspondence, in
which the main ingredients are quantum states and...