Security of continuous-variable quantum key distribution against general attacks

We prove the security of Gaussian continuous-variable quantum key distribution against arbitrary attacks in the finite-size regime. The novelty of our proof is to consider symmetries of quantum key distribution in phase space in order to show that, to good approximation, the Hilbert space of interest can be considered to be finite-dimensional, thereby allowing for the use of the postselection technique introduced by Christandl, Koenig and Renner (Phys. Rev. Lett. 102, 020504 (2009)). Our result greatly improves on previous work based on the de Finetti theorem which could not provide security for realistic, finite-size, implementations.Comment: 5 pages, plus 11 page appendi

Unconditional security proof of long-distance continuous-variable quantum key distribution with discrete modulation

We present a continuous-variable quantum key distribution protocol combining a discrete modulation and reverse reconciliation. This protocol is proven unconditionally secure and allows the distribution of secret keys over long distances, thanks to a reverse reconciliation scheme efficient at very low signal-to-noise ratio.Comment: 4 pages, 2 figure

Analysis of Imperfections in Practical Continuous-Variable Quantum Key Distribution

As quantum key distribution becomes a mature technology, it appears clearly that some assumptions made in the security proofs cannot be justified in practical implementations. This might open the door to possible side-channel attacks. We examine several discrepancies between theoretical models and experimental setups in the case of continuous-variable quantum key distribution. We study in particular the impact of an imperfect modulation on the security of Gaussian protocols and show that approximating the theoretical Gaussian modulation with a discrete one is sufficient in practice. We also address the issue of properly calibrating the detection setup, and in particular the value of the shot noise. Finally, we consider the influence of phase noise in the preparation stage of the protocol and argue that taking this noise into account can improve the secret key rate because this source of noise is not controlled by the eavesdropper.Comment: 4 figure

Optimal eavesdropping on QKD without quantum memory

We consider the security of the BB84, six-state and SARG04 quantum key distribution protocols when the eavesdropper doesn't have access to a quantum memory. In this case, Eve's most general strategy is to measure her ancilla with an appropriate POVM designed to take advantage of the post-measurement information that will be released during the sifting phase of the protocol. After an optimization on all the parameters accessible to Eve, our method provides us with new bounds for the security of six-state and SARG04 against a memoryless adversary. In particular, for the six-state protocol we show that the maximum QBER for which a secure key can be extracted is increased from 12.6% (for collective attacks) to 20.4% with the memoryless assumption.Comment: 7 pages, 3 figures. Analysis of six-state and SARG04 QKD protocols adde

Multidimensional reconciliation for continuous-variable quantum key distribution

We propose a method for extracting an errorless secret key in a continuous-variable quantum key distribution protocol, which is based on Gaussian modulation of coherent states and homodyne detection. The crucial feature is an eight-dimensional reconciliation method, based on the algebraic properties of octonions. Since the protocol does not use any postselection, it can be proven secure against arbitrary collective attacks, by using well-established theorems on the optimality of Gaussian attacks. By using this new coding scheme with an appropriate signal to noise ratio, the distance for secure continuous-variable quantum key distribution can be significantly extended.Comment: 8 pages, 3 figure

De Finetti theorem on the CAR algebra

The symmetric states on a quasi local C*-algebra on the infinite set of indices J are those invariant under the action of the group of the permutations moving only a finite, but arbitrary, number of elements of J. The celebrated De Finetti Theorem describes the structure of the symmetric states (i.e. exchangeable probability measures) in classical probability. In the present paper we extend De Finetti Theorem to the case of the CAR algebra, that is for physical systems describing Fermions. Namely, after showing that a symmetric state is automatically even under the natural action of the parity automorphism, we prove that the compact convex set of such states is a Choquet simplex, whose extremal (i.e. ergodic w.r.t. the action of the group of permutations previously described) are precisely the product states in the sense of Araki-Moriya. In order to do that, we also prove some ergodic properties naturally enjoyed by the symmetric states which have a self--containing interest.Comment: 23 pages, juornal reference: Communications in Mathematical Physics, to appea

Decision and function problems based on boson sampling

Boson sampling is a mathematical problem that is strongly believed to be intractable for classical computers, whereas passive linear interferometers can produce samples efficiently. So far, the problem remains a computational curiosity, and the possible usefulness of boson-sampling devices is mainly limited to the proof of quantum supremacy. The purpose of this work is to investigate whether boson sampling can be used as a resource of decision and function problems that are computationally hard, and may thus have cryptographic applications. After the definition of a rather general theoretical framework for the design of such problems, we discuss their solution by means of a brute-force numerical approach, as well as by means of non-boson samplers. Moreover, we estimate the sample sizes required for their solution by passive linear interferometers, and it is shown that they are independent of the size of the Hilbert space.Comment: Close to the version published in PR

A balanced homodyne detector for high-rate Gaussian-modulated coherent-state quantum key distribution

We discuss excess noise contributions of a practical balanced homodyne detector in Gaussian-modulated coherent-state (GMCS) quantum key distribution (QKD). We point out the key generated from the original realistic model of GMCS QKD may not be secure. In our refined realistic model, we take into account excess noise due to the finite bandwidth of the homodyne detector and the fluctuation of the local oscillator. A high speed balanced homodyne detector suitable for GMCS QKD in the telecommunication wavelength region is built and experimentally tested. The 3dB bandwidth of the balanced homodyne detector is found to be 104MHz and its electronic noise level is 13dB below the shot noise at a local oscillator level of 8.5*10^8 photon per pulse. The secure key rate of a GMCS QKD experiment with this homodyne detector is expected to reach Mbits/s over a few kilometers.Comment: 22 pages, 11 figure

Feasibility of quantum key distribution through dense wavelength division multiplexing network

In this paper, we study the feasibility of conducting quantum key distribution (QKD) together with classical communication through the same optical fiber by employing dense-wavelength-division-multiplexing (DWDM) technology at telecom wavelength. The impact of the classical channels to the quantum channel has been investigated for both QKD based on single photon detection and QKD based on homodyne detection. Our studies show that the latter can tolerate a much higher level of contamination from the classical channels than the former. This is because the local oscillator used in the homodyne detector acts as a "mode selector" which can suppress noise photons effectively. We have performed simulations based on both the decoy BB84 QKD protocol and the Gaussian modulated coherent state (GMCS) QKD protocol. While the former cannot tolerate even one classical channel (with a power of 0dBm), the latter can be multiplexed with 38 classical channels (0dBm power each channel) and still has a secure distance around 10km. Preliminary experiment has been conducted based on a 100MHz bandwidth homodyne detector.Comment: 18 pages, 5 figure

Characterization of the effects of cross-linking of macrophage CD44 associated with increased phagocytosis of apoptotic PMN

Control of macrophage capacity for apoptotic cell clearance by soluble mediators such as cytokines, prostaglandins and lipoxins, serum proteins, and glucocorticoids may critically determine the rate at which inflammation resolves. Previous studies suggested that macrophage capacity for clearance of apoptotic neutrophils was profoundly altered following binding of CD44 antibodies. We have used a number of different approaches to further define the mechanism by which CD44 rapidly and specifically augment phagocytosis of apoptotic neutrophils. Use of Fab ’ fragments unequivocally demonstrated a requirement for cross-linking of macrophage surface CD44. The molecular mechanism of CD44-augmented phagocytosis was shown to be opsonin-independent and to be distinct from the Mer/protein S pathway induced by glucocorticoids and was not functional for clearance of apoptotic eosinophils. CD44-cross-linking also altered macrophage migration and induced cytoskeletal re-organisation together with phosphorylation of paxillin and activation of Rac2. Investigation of signal transduction pathways that might be critical for CD44 augmentation of phagocytosis revealed that Ca 2+ signalling, PI-3 kinase pathways and altered cAMP signalling were not involved, but did implicate a key role for tyrosine phosphorylation events. Finally, although CD44 antibodies were able to augment phagocytosis of apoptotic neutrophils by murine peritoneal and bone marrow-derived macrophages, we did not observe a difference in the clearance of neutrophils following induction of peritonitis with thioglycollate in CD44-deficient animals. Together, these data demonstrate that CD4