Quantum Bell Inequalities from Macroscopic Locality

We propose a method to generate analytical quantum Bell inequalities based on the principle of Macroscopic Locality. By imposing locality over binary processings of virtual macroscopic intensities, we establish a correspondence between Bell inequalities and quantum Bell inequalities in bipartite scenarios with dichotomic observables. We discuss how to improve the latter approximation and how to extend our ideas to scenarios with more than two outcomes per setting.

Efficient excitation of a two level atom by a single photon in a propagating mode

State mapping between atoms and photons, and photon-photon interactions play an important role in scalable quantum information processing. We consider the interaction of a two-level atom with a quantized textit{propagating} pulse in free space and study the probability $P_e(t)$ of finding the atom in the excited state at any time $t$. This probability is expected to depend on (i) the quantum state of the pulse field and (ii) the overlap between the pulse and the dipole pattern of the atomic spontaneous emission. We show that the second effect is captured by a single parameter $Lambdain[0,8pi/3]$, obtained by weighting the dipole pattern with the numerical aperture. Then $P_e(t)$ can be obtained by solving time-dependent Heisenberg-Langevin equations. We provide detailed solutions for both single photon Fock state and coherent states and for various temporal shapes of the pulses.

Finite-key security against coherent attacks in quantum key distribution

The work by Christandl, Konig and Renner [Phys. Rev. Lett. 102, 020504 (2009)] provides in particular the possibility of studying unconditional security in the finite-key regime for all discrete-variable protocols. We spell out this bound from their general formalism. Then we apply it to the study of a recently proposed protocol [Laing et al., Phys. Rev. A 82, 012304 (2010)]. This protocol is meaningful when the alignment of Alices and Bobs reference frames is not monitored and may vary with time. In this scenario, the notion of asymptotic key rate has hardly any operational meaning, because if one waits too long time, the average correlations are smeared out and no security can be inferred. Therefore, finite-key analysis is necessary to find the maximal achievable secret key rate and the corresponding optimal number of signals.