The saturation conjecture (after A. Knutson and T. Tao)

In this exposition we give a simple and complete treatment of A. Knutson and T. Tao's recent proof (http://front.math.ucdavis.edu/math.RT/9807160) of the saturation conjecture, which asserts that the Littlewood-Richardson semigroup is saturated. The main tool is Knutson and Tao's hive model for Berenstein-Zelevinsky polytopes. In an appendix of W. Fulton it is shown that the hive model is equivalent to the original Littlewood-Richardson rule.Comment: Latex document, 12 pages, 24 figure

Distributed Robustness Analysis of Interconnected Uncertain Systems Using Chordal Decomposition

Large-scale interconnected uncertain systems commonly have large state and uncertainty dimensions. Aside from the heavy computational cost of solving centralized robust stability analysis techniques, privacy requirements in the network can also introduce further issues. In this paper, we utilize IQC analysis for analyzing large-scale interconnected uncertain systems and we evade these issues by describing a decomposition scheme that is based on the interconnection structure of the system. This scheme is based on the so-called chordal decomposition and does not add any conservativeness to the analysis approach. The decomposed problem can be solved using distributed computational algorithms without the need for a centralized computational unit. We further discuss the merits of the proposed analysis approach using a numerical experiment.Comment: 3 figures. Submitted to the 19th IFAC world congres

Robust Stability Analysis of Sparsely Interconnected Uncertain Systems

In this paper, we consider robust stability analysis of large-scale sparsely interconnected uncertain systems. By modeling the interconnections among the subsystems with integral quadratic constraints, we show that robust stability analysis of such systems can be performed by solving a set of sparse linear matrix inequalities. We also show that a sparse formulation of the analysis problem is equivalent to the classical formulation of the robustness analysis problem and hence does not introduce any additional conservativeness. The sparse formulation of the analysis problem allows us to apply methods that rely on efficient sparse factorization techniques, and our numerical results illustrate the effectiveness of this approach compared to methods that are based on the standard formulation of the analysis problem.Comment: Provisionally accepted to appear in IEEE Transactions on Automatic Contro

Efficient atomic clocks operated with several atomic ensembles

Atomic clocks are typically operated by locking a local oscillator (LO) to a single atomic ensemble. In this article we propose a scheme where the LO is locked to several atomic ensembles instead of one. This results in an exponential improvement compared to the conventional method and provides a stability of the clock scaling as $(\alpha N)^{-m/2}$ with $N$ being the number of atoms in each of the $m$ ensembles and $\alpha$ is a constant depending on the protocol being used to lock the LOComment: 10 pages, 8 figure

Measurement induced entanglement and quantum computation with atoms in optical cavities

We propose a method to prepare entangled states and implement quantum computation with atoms in optical cavities. The internal state of the atoms are entangled by a measurement of the phase of light transmitted through the cavity. By repeated measurements an entangled state is created with certainty, and this entanglement can be used to implement gates on qubits which are stored in different internal degrees of freedom of the atoms. This method, based on measurement induced dynamics, has a higher fidelity than schemes making use of controlled unitary dynamics.Comment: 4 pages including 2 figures. v2+3: minor change

Specializations of Grothendieck polynomials

We prove a formula for double Schubert and Grothendieck polynomials specialized to two rearrangements of the same set of variables. Our formula generalizes the usual formulas for Schubert and Grothendieck polynomials in terms of RC-graphs, and it gives immediate proofs of many other important properties of these polynomials.Comment: 4 pages, 1 figur

An efficient quantum memory based on two-level atoms

We propose a method to implement a quantum memory for light based on ensembles of two-level atoms. Our protocol is based on controlled reversible inhomogeneous broadening (CRIB), where an external field first dephases the atomic polarization and thereby stores an incoming light pulse into collective states of the atomic ensemble, and later a reversal of the applied field leads to a rephasing of the atomic polarization and a reemission of the light. As opposed to previous proposals for CRIB based quantum memories we propose to only apply the broadening for a short period after most of the pulse has already been absorbed by the ensemble. We show that with this procedure there exist certain modes of the incoming light field which can be stored with an efficiency approaching 100% in the limit of high optical depth and long coherence time of the atoms. These results demonstrate that it is possible to operate an efficient quantum memory without any optical control fields