Search

The detection of variations of fundamental constants of the Standard Model would provide us with compelling evidence of new physics, and could lift the veil on the nature of dark matter and dark energy. In this work, we discuss how a network of atomic and molecular clocks can be used to look for such variations with unprecedented sensitivity over a wide range of time scales. This is precisely the goal of the recently launched QSNET project: A network of clocks for measuring the stability of fundamental constants. QSNET will include state-of-the-art atomic clocks, but will also develop next-generation molecular and highly charged ion clocks with enhanced sensitivity to variations of fundamental constants. We describe the technological and scientific aims of QSNET and evaluate its expected performance. We show that in the range of parameters probed by QSNET, either we will discover new physics, or we will impose new constraints on violations of fundamental symmetries and a range of theories beyond the Standard Model, including dark matter and dark energy models.

Organic semiconductors are a promising platform for ambient polaritonics. Several applications, such as polariton routers, and many-body condensed matter phenomena are currently hindered due to the ultra-short polariton lifetimes in organics. Here, we employ a single-shot dispersion imaging technique, using 4 nanosecond long non-resonant excitation pulses, to study polariton lasing in a $\lambda/2$ planar organic microcavity filled with BODIPY-Br dye molecules. At a power threshold density of $1.5 MW/cm^{2}$, we observe the transition to a quasi-steady state, 1.2 ns long-lived, single-mode polariton lasing and the concomitant superlinear increase of photoluminescence, spectral line-narrowing, and energy blueshift

We introduce and study a new search-type problem with ($n+1$)-robots on a disk. The searchers (robots) all start from the center of the disk, have unit speed, and can communicate wirelessly. The goal is for a distinguished robot (the queen) to reach and evacuate from an exit that is hidden on the perimeter of the disk in as little time as possible. The remaining $n$ robots (servants) are there to facilitate the queen's objective and are not required to reach the hidden exit. We provide upper and lower bounds for the time required to evacuate the queen from a unit disk. Namely, we propose an algorithm specifying the trajectories of the robots which guarantees evacuation of the queen in time always better than $2 + 4(\sqrt{2}-1) \frac{\pi}{n}$ for $n \geq 4$ servants. We also demonstrate that for $n \geq 4$ servants the queen cannot be evacuated in time less than $2+\frac{\pi}{n}+\frac{2}{n^2}$., Comment: 20 pages, 5 figures. This is the full version of the paper with the same title accepted in the 25th International Colloquium on Structural Information and Communication Complexity (SIROCCO'18)