A min-entropy uncertainty relation for finite size cryptography

Apart from their foundational significance, entropic uncertainty relations play a central role in proving the security of quantum cryptographic protocols. Of particular interest are thereby relations in terms of the smooth min-entropy for BB84 and six-state encodings. Previously, strong uncertainty relations were obtained which are valid in the limit of large block lengths. Here, we prove a new uncertainty relation in terms of the smooth min-entropy that is only marginally less strong, but has the crucial property that it can be applied to rather small block lengths. This paves the way for a practical implementation of many cryptographic protocols. As part of our proof we show tight uncertainty relations for a family of Renyi entropies that may be of independent interest.Comment: 5+6 pages, 1 figure, revtex. new version changed author's name from Huei Ying Nelly Ng to Nelly Huei Ying Ng, for consistency with other publication

Disentanglement cost of quantum states.

We show that the minimal rate of noise needed to catalytically erase the entanglement in a bipartite quantum state is given by the regularized relative entropy of entanglement. This offers a solution to the central open question raised in [Groisman et al., Phys. Rev. A 72, 032317 (2005)PLRAAN1050-294710.1103/PhysRevA.72.032317] and complements their main result that the minimal rate of noise needed to erase all correlations is given by the quantum mutual information. We extend our discussion to the tripartite setting where we show that an asymptotic rate of noise given by the regularized relative entropy of recovery is sufficient to catalytically transform the state to a locally recoverable version of the state

Conditional decoupling of quantum information

Insights from quantum information theory show that correlation measures based on quantum entropy are fundamental tools that reveal the entanglement structure of multipartite states. In that spirit, Groisman, Popescu, and Winter [Phys. Rev. A 72, 032317 (2005)PLRAAN1050-294710.1103/PhysRevA.72.032317] showed that the quantum mutual information I(A;B) quantifies the minimal rate of noise needed to erase the correlations in a bipartite state of quantum systems AB. Here, we investigate correlations in tripartite systems ABE. In particular, we are interested in the minimal rate of noise needed to apply to the systems AE in order to erase the correlations between A and B given the information in system E, in such a way that there is only negligible disturbance on the marginal BE. We present two such models of conditional decoupling, called deconstruction and conditional erasure cost of tripartite states ABE. Our main result is that both are equal to the conditional quantum mutual information I(A;B|E) - establishing it as an operational measure for tripartite quantum correlations

Quasi-polynomial time algorithms for free quantum games in bounded dimension

We give a converging semidefinite programming hierarchy of outer approximations for the set of quantum correlations of fixed dimension and derive analytical bounds on the convergence speed of the hierarchy. In particular, we give a semidefinite program of size $\exp(\mathcal{O}\big(T^{12}(\log^2(AT)+\log(Q)\log(AT))/\epsilon^2\big))$ to compute additive $\epsilon$-approximations on the values of two-player free games with $T\times T$-dimensional quantum assistance, where $A$ and $Q$ denote the numbers of answers and questions of the game, respectively. For fixed dimension $T$, this scales polynomially in $Q$ and quasi-polynomially in $A$, thereby improving on previously known approximation algorithms for which worst-case run-time guarantees are at best exponential in $Q$ and $A$. For the proof, we make a connection to the quantum separability problem and employ improved multipartite quantum de Finetti theorems with linear constraints. We also derive an informationally complete measurement which minimises the loss in distinguishability relative to the quantum side information - which may be of independent interest

The XMM-Newton survey of the ELAIS-S1 field II: optical identifications and multiwavelength catalogue of X-ray sources

We present optical identifications and a multi-band catalogue of a sample of 478 X-ray sources in the XMM and Chandra surveys of the central 0.6 deg^2 of the ELAIS-S1 field. The optical/infrared counterpart of each X-ray source was identified using R and IRAC 3.6 um bands. This method was complemented by the precise positions obtained through Chandra observations. Approximately 94% of the counterparts are detected in the R band, while the remaining are blank fields in the optical down to R~24.5, but have a near-infrared counterpart detected by IRAC within 6 arcsec from the XMM centroid. The multi-band catalogue contains photometry in ten photometric bands (B to the MIPS 24 um). We determined redshift and classification for 237 sources (~50% of the sample) brighter than R=24. We classified 47% of the sources with spectroscopic redshift as broad-line active galactic nuclei (BL AGNs) with z=0.1-3.5, while sources without broad-lines are about 46% of the spectroscopic sample and are found up to z=2.6. We identified 11 type 2 QSOs among the sources with X/O>8, with z=0.9-2.6, high 2-10 keV luminosity (log(L2-10keV)>=43.8 erg/s) and hard X-ray colors suggesting large absorbing columns at the rest frame (logN_H up to 23.6 cm^-2). BL AGNs show on average blue optical-to-near-infrared colors, softer X-ray colors and X-ray-to-optical colors typical of optically selected AGNs. Conversely, narrow-line sources show redder optical colors, harder X-ray flux ratio and span a wider range of X-ray-to-optical colors. On average the SEDs of high-luminosity BL AGNs resemble the power-law typical of unobscured AGNs. The SEDs of NOT BL AGNs are dominated by the galaxy emission in the optical/near-infrared, and show a rise in the mid-infrared which suggests the presence of an obscured active nucleus.Comment: 15 pages, A&A accepted, affiliations correcte

An improved and fast UHPLC-PDA methodology for determination of L-ascorbic and dehydroascorbic acids in fruits and vegetables. Evaluation of degradation rate during storage

This study provides a versatile validated method to determine the total vitamin C content, as the sum of the contents of L-ascorbic acid (L-AA) and dehydroascorbic acid (DHAA), in several fruits and vegetables and its degradability with storage time. Seven horticultural crops from two different origins were analyzed using an ultra-high-performance liquid chromatographic-photodiode array (UHPLC-PDA) system, equipped with a new trifunctional high strength silica (100% silica particle) analytical column (100 mm × 2.1 mm, 1.7 μm particle size) using 0.1% (v/v) formic acid as mobile phase, in isocratic mode. This new stationary phase, specially designed for polar compounds, overcomes the problems normally encountered in HPLC and is suitable for the analysis of large batches of samples without L-AA degradation. In addition, it proves to be an excellent alternative to conventional C18 columns for the determination of L-AA in fruits and vegetables. The method was fully validated in terms of linearity, detection (LOD) and quantification (LOQ) limits, accuracy, and inter/intra-day precision. Validation experiments revealed very good recovery rate of 96.6 ± 4.4% for L-AA and 103.1 ± 4.8 % for total vitamin C, good linearity with r(2)-values >0.999 within the established concentration range, excellent repeatability (0.5%), and reproducibility (1.6%) values. The LOD of the method was 22 ng/mL whereas the LOQ was 67 ng/mL. It was possible to demonstrate that L-AA and DHAA concentrations in the different horticulture products varied oppositely with time of storage not always affecting the total amount of vitamin C during shelf-life. Locally produced fruits have higher concentrations of vitamin C, compared with imported ones, but vegetables showed the opposite trend. Moreover, this UHPLC-PDA methodology proves to be an improved, simple, and fast approach for determining the total content of vitamin C in various food commodities, with high sensitivity, selectivity, and resolving power within 3 min of run analysis.info:eu-repo/semantics/publishedVersio