Trapped atoms in cavity QED: coupling quantized light and matter

On the occasion of the hundredth anniversary of Albert Einstein's annus mirabilis, we reflect on the development and current state of research in cavity quantum electrodynamics in the optical domain. Cavity QED is a field which undeniably traces its origins to Einstein's seminal work on the statistical theory of light and the nature of its quantized interaction with matter. In this paper, we emphasize the development of techniques for the confinement of atoms strongly coupled to high-finesse resonators and the experiments which these techniques enable

Cavity QED with Single Atoms and Photons

Recent experimental advances in the field of cavity quantum electrodynamics (QED) have opened new possibilities for control of atom-photon interactions. A laser with "one and the same atom" demonstrates the theory of laser operation pressed to its conceptual limit. The generation of single photons on demand and the realization of cavity QED with well defined atomic numbers N = 0, 1, 2,... both represent important steps toward realizing diverse protocols in quantum information science. Coherent manipulation of the atomic state via Raman transitions provides a new tool in cavity QED for in situ monitoring and control of the atom-cavity system. All of these achievements share a common point of departure: the regime of strong coupling. It is thus interesting to consider briefly the history of the strong coupling criterion in cavity QED and to trace out the path that research has taken in the pursuit of this goal

Stable marriage with general preferences

We propose a generalization of the classical stable marriage problem. In our model, the preferences on one side of the partition are given in terms of arbitrary binary relations, which need not be transitive nor acyclic. This generalization is practically well-motivated, and as we show, encompasses the well studied hard variant of stable marriage where preferences are allowed to have ties and to be incomplete. As a result, we prove that deciding the existence of a stable matching in our model is NP-complete. Complementing this negative result we present a polynomial-time algorithm for the above decision problem in a significant class of instances where the preferences are asymmetric. We also present a linear programming formulation whose feasibility fully characterizes the existence of stable matchings in this special case. Finally, we use our model to study a long standing open problem regarding the existence of cyclic 3D stable matchings. In particular, we prove that the problem of deciding whether a fixed 2D perfect matching can be extended to a 3D stable matching is NP-complete, showing this way that a natural attempt to resolve the existence (or not) of 3D stable matchings is bound to fail.Comment: This is an extended version of a paper to appear at the The 7th International Symposium on Algorithmic Game Theory (SAGT 2014

Observation of the Vacuum-Rabi Spectrum for One Trapped Atom

The transmission spectrum for one atom strongly coupled to the field of a high-finesse optical resonator is observed to exhibit a clearly resolved vacuum-Rabi splitting characteristic of the normal modes in the eigenvalue spectrum of the atom-cavity system. A new Raman scheme for cooling atomic motion along the cavity axis enables a complete spectrum to be recorded for an individual atom trapped within the cavity mode, in contrast to all previous measurements in cavity QED that have required averaging over many atoms.Comment: 5 pages with 4 figure

Cross Sections from 800 MeV Proton Irradiation of Terbium

A single terbium foil was irradiated with 800 MeV protons to ascertain the potential for production of lanthanide isotopes of interest in medical, astrophysical, and basic science research and to contribute to nuclear data repositories. Isotopes produced in the foil were quantified by gamma spectroscopy. Cross sections for 36 isotopes produced in the irradiation are reported and compared with predictions by the MCNP6 transport code using the CEM03.03, Bertini, and INCL+ABLA event generators. Our results indicate the need to accurately consider fission and fragmentation of relatively light target nuclei like terbium in the modeling of nuclear reactions at 800 MeV. The predictive power of the code was found to be different for each event generator tested but was satisfactory for most of the product yields in the mass region where spallation reactions dominate. However, none of the event generators' results are in complete agreement with measured data.Comment: 16 pages, 3 figures, 1 tables, only pdf, submitted to Nuclear Physics

Hydrogen-enhanced local plasticity in aluminum: an ab initio study

Dislocation core properties of Al with and without H impurities are studied using the Peierls-Nabarro model with parameters determined by ab initio calculations. We find that H not only facilitates dislocation emission from the crack tip but also enhances dislocation mobility dramatically, leading to macroscopically softening and thinning of the material ahead of the crack tip. We observe strong binding between H and dislocation cores, with the binding energy depending on dislocation character. This dependence can directly affect the mechanical properties of Al by inhibiting dislocation cross-slip and developing slip planarity.Comment: 4 pages, 3 figure

Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach

In this paper, we study the $k$-forest problem in the model of resource augmentation. In the $k$-forest problem, given an edge-weighted graph $G(V,E)$, a parameter $k$, and a set of $m$ demand pairs $\subseteq V \times V$, the objective is to construct a minimum-cost subgraph that connects at least $k$ demands. The problem is hard to approximate---the best-known approximation ratio is $O(\min\{\sqrt{n}, \sqrt{k}\})$. Furthermore, $k$-forest is as hard to approximate as the notoriously-hard densest $k$-subgraph problem. While the $k$-forest problem is hard to approximate in the worst-case, we show that with the use of resource augmentation, we can efficiently approximate it up to a constant factor. First, we restate the problem in terms of the number of demands that are {\em not} connected. In particular, the objective of the $k$-forest problem can be viewed as to remove at most $m-k$ demands and find a minimum-cost subgraph that connects the remaining demands. We use this perspective of the problem to explain the performance of our algorithm (in terms of the augmentation) in a more intuitive way. Specifically, we present a polynomial-time algorithm for the $k$-forest problem that, for every $\epsilon>0$, removes at most $m-k$ demands and has cost no more than $O(1/\epsilon^{2})$ times the cost of an optimal algorithm that removes at most $(1-\epsilon)(m-k)$ demands