A de Finetti representation theorem for infinite dimensional quantum systems and applications to quantum cryptography

According to the quantum de Finetti theorem, if the state of an N-partite system is invariant under permutations of the subsystems then it can be approximated by a state where almost all subsystems are identical copies of each other, provided N is sufficiently large compared to the dimension of the subsystems. The de Finetti theorem has various applications in physics and information theory, where it is for instance used to prove the security of quantum cryptographic schemes. Here, we extend de Finetti's theorem, showing that the approximation also holds for infinite dimensional systems, as long as the state satisfies certain experimentally verifiable conditions. This is relevant for applications such as quantum key distribution (QKD), where it is often hard - or even impossible - to bound the dimension of the information carriers (which may be corrupted by an adversary). In particular, our result can be applied to prove the security of QKD based on weak coherent states or Gaussian states against general attacks.Comment: 11 pages, LaTe

Multipartite Bound Information exists and can be activated

We prove the conjectured existence of Bound Information, a classical analog of bound entanglement, in the multipartite scenario. We give examples of tripartite probability distributions from which it is impossible to extract any kind of secret key, even in the asymptotic regime, although they cannot be created by local operations and public communication. Moreover, we show that bound information can be activated: three honest parties can distill a common secret key from different distributions having bound information. Our results demonstrate that quantum information theory can provide useful insight for solving open problems in classical information theory.Comment: four page

The Uncertainty Principle in the Presence of Quantum Memory

The uncertainty principle, originally formulated by Heisenberg, dramatically illustrates the difference between classical and quantum mechanics. The principle bounds the uncertainties about the outcomes of two incompatible measurements, such as position and momentum, on a particle. It implies that one cannot predict the outcomes for both possible choices of measurement to arbitrary precision, even if information about the preparation of the particle is available in a classical memory. However, if the particle is prepared entangled with a quantum memory, a device which is likely to soon be available, it is possible to predict the outcomes for both measurement choices precisely. In this work we strengthen the uncertainty principle to incorporate this case, providing a lower bound on the uncertainties which depends on the amount of entanglement between the particle and the quantum memory. We detail the application of our result to witnessing entanglement and to quantum key distribution.Comment: 5 pages plus 12 of supplementary information. Updated to match the journal versio

Valaciclovir for Chronic Hepatitis BVirus Infection after Lung Transplantation

Abstract. : We report on a chronic asymptomatic hepatitis B surface antigen (HBsAg) carrier who developed an increase in aminotransferase and HBsAg levels 1 year after lung transplantation. During treatment for cutaneous herpes simplex virus (HSV) infection with oral valaciclovir there was a marked decrease in replicating hepatitis B virus (HBV)-DNA and aminotransferase levels, which was sustained for 9 months by continuing low-dose valaciclovir. A second rise in aminotransferase levels again responded to a valaciclovir dose increase and the HBV-DNA levels declined further. Although we cannot exclude a spontaneous variation of the serologic parameters, our observation suggests that valaciclovir may represent a valuable therapeutic option in the treatment of chronic hepatitis B after lung transplantatio

Itinerant in-plane magnetic fluctuations and many-body correlations in Nax_xCoO2_2

Based on the {\it ab-initio} band structure for Na$_x$CoO$_2$ we derive the single-electron energies and the effective tight-binding description for the $t_{2g}$ bands using projection procedure. Due to the presence of the next-nearest-neighbor hoppings a local minimum in the electronic dispersion close to the $\Gamma$ point of the first Brillouin zone forms. Correspondingly, in addition to a large Fermi surface an electron pocket close to the $\Gamma$ point emerges at high doping concentrations. The latter yields the new scattering channel resulting in a peak structure of the itinerant magnetic susceptibility at small momenta. This indicates dominant itinerant in-plane ferromagnetic fluctuations above certain critical concentration $x_m$, in agreement with neutron scattering data. Below $x_m$ the magnetic susceptibility shows a tendency towards the antiferromagnetic fluctuations. We further analyze the many-body effects on the electronic and magnetic excitations using various approximations applicable for different $U/t$ ratio.Comment: 10 page

Lower and upper bounds on the secret key rate for QKD protocols using one--way classical communication

We investigate a general class of quantum key distribution (QKD) protocols using one-way classical communication. We show that full security can be proven by considering only collective attacks. We derive computable lower and upper bounds on the secret key rate of those QKD protocol involving only entropies of two--qubit density operators. As an illustration of our results, we determine new bounds for the BB84, the six-state, and the B92 protocol. We show that in all these cases the first classical processing that the legitimate partners should apply consists in adding noise. This is precisely why any entanglement based proof would generally fail here.Comment: minor changes, results for BB84 and B92 adde

Secure certification of mixed quantum states with application to two-party randomness generation

We investigate sampling procedures that certify that an arbitrary quantum state on $n$ subsystems is close to an ideal mixed state $\varphi^{\otimes n}$ for a given reference state $\varphi$, up to errors on a few positions. This task makes no sense classically: it would correspond to certifying that a given bitstring was generated according to some desired probability distribution. However, in the quantum case, this is possible if one has access to a prover who can supply a purification of the mixed state. In this work, we introduce the concept of mixed-state certification, and we show that a natural sampling protocol offers secure certification in the presence of a possibly dishonest prover: if the verifier accepts then he can be almost certain that the state in question has been correctly prepared, up to a small number of errors. We then apply this result to two-party quantum coin-tossing. Given that strong coin tossing is impossible, it is natural to ask "how close can we get". This question has been well studied and is nowadays well understood from the perspective of the bias of individual coin tosses. We approach and answer this question from a different---and somewhat orthogonal---perspective, where we do not look at individual coin tosses but at the global entropy instead. We show how two distrusting parties can produce a common high-entropy source, where the entropy is an arbitrarily small fraction below the maximum (except with negligible probability)