Directional `superradiant' collisions: bosonic amplification of atom pairs emitted from an elongated Bose-Einstein condensate

We study spontaneous directionality in the bosonic amplification of atom pairs emitted from an elongated Bose-Einstein condensate (BEC), an effect analogous to `superradiant' emission of atom-photon pairs. Using a simplified model, we make analytic predictions regarding directional effects for both atom-atom and atom-photon emission. These are confirmed by numerical mean-field simulations, demonstrating the the feasibility of nearly perfect directional emission along the condensate axis. The dependence of the emission angle on the pump strength for atom-atom pairs is significantly different than for atom-photon pairs

Parametric LTL on Markov Chains

This paper is concerned with the verification of finite Markov chains against parametrized LTL (pLTL) formulas. In pLTL, the until-modality is equipped with a bound that contains variables; e.g., $\Diamond_{\le x}\ \varphi$ asserts that $\varphi$ holds within $x$ time steps, where $x$ is a variable on natural numbers. The central problem studied in this paper is to determine the set of parameter valuations $V_{\prec p} (\varphi)$ for which the probability to satisfy pLTL-formula $\varphi$ in a Markov chain meets a given threshold $\prec p$, where $\prec$ is a comparison on reals and $p$ a probability. As for pLTL determining the emptiness of $V_{> 0}(\varphi)$ is undecidable, we consider several logic fragments. We consider parametric reachability properties, a sub-logic of pLTL restricted to next and $\Diamond_{\le x}$, parametric B\"uchi properties and finally, a maximal subclass of pLTL for which emptiness of $V_{> 0}(\varphi)$ is decidable.Comment: TCS Track B 201

Reconstruction of photon statistics using low performance photon counters

The output of a photodetector consists of a current pulse whose charge has the statistical distribution of the actual photon numbers convolved with a Bernoulli distribution. Photodetectors are characterized by a nonunit quantum efficiency, i.e. not all the photons lead to a charge, and by a finite resolution, i.e. a different number of detected photons leads to a discriminable values of the charge only up to a maximum value. We present a detailed comparison, based on Monte Carlo simulated experiments and real data, among the performances of detectors with different upper limits of counting capability. In our scheme the inversion of Bernoulli convolution is performed by maximum-likelihood methods assisted by measurements taken at different quantum efficiencies. We show that detectors that are only able to discriminate between zero, one and more than one detected photons are generally enough to provide a reliable reconstruction of the photon statistics for single-peaked distributions, while detectors with higher resolution limits do not lead to further improvements. In addition, we demonstrate that, for semiclassical states, even on/off detectors are enough to provide a good reconstruction. Finally, we show that a reliable reconstruction of multi-peaked distributions requires either higher quantum efficiency or better capability in discriminating high number of detected photons.Comment: 8 pages, 3 figure

Partially Ordered Two-way B\"uchi Automata

We introduce partially ordered two-way B\"uchi automata and characterize their expressive power in terms of fragments of first-order logic FO[<]. Partially ordered two-way B\"uchi automata are B\"uchi automata which can change the direction in which the input is processed with the constraint that whenever a state is left, it is never re-entered again. Nondeterministic partially ordered two-way B\"uchi automata coincide with the first-order fragment Sigma2. Our main contribution is that deterministic partially ordered two-way B\"uchi automata are expressively complete for the first-order fragment Delta2. As an intermediate step, we show that deterministic partially ordered two-way B\"uchi automata are effectively closed under Boolean operations. A small model property yields coNP-completeness of the emptiness problem and the inclusion problem for deterministic partially ordered two-way B\"uchi automata.Comment: The results of this paper were presented at CIAA 2010; University of Stuttgart, Computer Scienc

Coherently Controlled Nanoscale Molecular Deposition

Quantum interference effects are shown to provide a means of controlling and enhancing the focusing a collimated neutral molecular beam onto a surface. The nature of the aperiodic pattern formed can be altered by varying laser field characteristics and the system geometry.Comment: 13 pages (inculding 4 figures), LaTeX (Phys. Rev. Lett., 2000, in Press

Formation of Two Component Bose Condensate During the Chemical Potential Curve Crossing

In this article we study the formation of the two modes Bose-Einstein condensate and the correlation between them. We show that beyond the mean field approximation the dissociation of a molecular condensate due to the chemical potential curve crossing leads to the formation of two modes condensate. We also show that these two modes are correlated in a two mode squeezed state.Comment: 10 page

Iterative maximum-likelihood reconstruction in quantum homodyne tomography

I propose an iterative expectation maximization algorithm for reconstructing a quantum optical ensemble from a set of balanced homodyne measurements performed on an optical state. The algorithm applies directly to the acquired data, bypassing the intermediate step of calculating marginal distributions. The advantages of the new method are made manifest by comparing it with the traditional inverse Radon transformation technique

Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs

Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various martingale-based methods for over- and under-approximating reachability probabilities. Based on the existing works that stretch across different communities (formal verification, control theory, etc.), we offer a unifying account. In particular, we emphasize the role of order-theoretic fixed points---a classic topic in computer science---in the analysis of probabilistic programs. This leads us to two new martingale-based techniques, too. We give rigorous proofs for their soundness and completeness. We also make an experimental comparison using our implementation of template-based synthesis algorithms for those martingales