Noisy pre-processing facilitating a photonic realisation of device-independent quantum key distribution

Device-independent quantum key distribution provides security even when the equipment used to communicate over the quantum channel is largely uncharacterized. An experimental demonstration of device-independent quantum key distribution is however challenging. A central obstacle in photonic implementations is that the global detection efficiency, i.e., the probability that the signals sent over the quantum channel are successfully received, must be above a certain threshold. We here propose a method to significantly relax this threshold, while maintaining provable device-independent security. This is achieved with a protocol that adds artificial noise, which cannot be known or controlled by an adversary, to the initial measurement data (the raw key). Focusing on a realistic photonic setup using a source based on spontaneous parametric down conversion, we give explicit bounds on the minimal required global detection efficiency.Comment: 5+16 pages, 4 figure

Postprocessing for quantum random number generators: entropy evaluation and randomness extraction

Quantum random-number generators (QRNGs) can offer a means to generate information-theoretically provable random numbers, in principle. In practice, unfortunately, the quantum randomness is inevitably mixed with classical randomness due to classical noises. To distill this quantum randomness, one needs to quantify the randomness of the source and apply a randomness extractor. Here, we propose a generic framework for evaluating quantum randomness of real-life QRNGs by min-entropy, and apply it to two different existing quantum random-number systems in the literature. Moreover, we provide a guideline of QRNG data postprocessing for which we implement two information-theoretically provable randomness extractors: Toeplitz-hashing extractor and Trevisan's extractor.Comment: 13 pages, 2 figure

Improved DIQKD protocols with finite-size analysis

The security of finite-length keys is essential for the implementation of device-independent quantum key distribution (DIQKD). Presently, there are several finite-size DIQKD security proofs, but they are mostly focused on standard DIQKD protocols and do not directly apply to the recent improved DIQKD protocols based on noisy preprocessing, random key measurements, and modified CHSH inequalities. Here, we provide a general finite-size security proof that can simultaneously encompass these approaches, using tighter finite-size bounds than previous analyses. In doing so, we develop a method to compute tight lower bounds on the asymptotic keyrate for any such DIQKD protocol with binary inputs and outputs. With this, we show that positive asymptotic keyrates are achievable up to depolarizing noise values of $9.33\%$, exceeding all previously known noise thresholds. We also develop a modification to random-key-measurement protocols, using a pre-shared seed followed by a "seed recovery" step, which yields substantially higher net key generation rates by essentially removing the sifting factor. Some of our results may also improve the keyrates of device-independent randomness expansion.Comment: Improved threshold with more data points, discussion of conjecture in [SGP+21], correction regarding results of [MDR+19

Symbolic Software for the Painleve Test of Nonlinear Ordinary and Partial Differential Equations

The automation of the traditional Painleve test in Mathematica is discussed. The package PainleveTest.m allows for the testing of polynomial systems of ordinary and partial differential equations which may be parameterized by arbitrary functions (or constants). Except where limited by memory, there is no restriction on the number of independent or dependent variables. The package is quite robust in determining all the possible dominant behaviors of the Laurent series solutions of the differential equation. The omission of valid dominant behaviors is a common problem in many implementations of the Painleve test, and these omissions often lead to erroneous results. Finally, our package is compared with the other available implementations of the Painleve test.Comment: Published in the Journal of Nonlinear Mathematical Physics (http://www.sm.luth.se/math/JNMP/), vol. 13(1), pp. 90-110 (Feb. 2006). The software can be downloaded at either http://www.douglasbaldwin.com or http://www.mines.edu/fs_home/wherema

Device-Independent Quantum Key Distribution

Cryptographic key exchange protocols traditionally rely on computational conjectures such as the hardness of prime factorisation to provide security against eavesdropping attacks. Remarkably, quantum key distribution protocols like the one proposed by Bennett and Brassard provide information-theoretic security against such attacks, a much stronger form of security unreachable by classical means. However, quantum protocols realised so far are subject to a new class of attacks exploiting implementation defects in the physical devices involved, as demonstrated in numerous ingenious experiments. Following the pioneering work of Ekert proposing the use of entanglement to bound an adversary's information from Bell's theorem, we present here the experimental realisation of a complete quantum key distribution protocol immune to these vulnerabilities. We achieve this by combining theoretical developments on finite-statistics analysis, error correction, and privacy amplification, with an event-ready scheme enabling the rapid generation of high-fidelity entanglement between two trapped-ion qubits connected by an optical fibre link. The secrecy of our key is guaranteed device-independently: it is based on the validity of quantum theory, and certified by measurement statistics observed during the experiment. Our result shows that provably secure cryptography with real-world devices is possible, and paves the way for further quantum information applications based on the device-independence principle.Comment: 5+1 pages in main text and methods with 4 figures and 1 table; 37 pages of supplementary materia

Nuclear Physics from Lattice QCD

We review recent progress toward establishing lattice Quantum Chromodynamics as a predictive calculational framework for nuclear physics. A survey of the current techniques that are used to extract low-energy hadronic scattering amplitudes and interactions is followed by a review of recent two-body and few-body calculations by the NPLQCD collaboration and others. An outline of the nuclear physics that is expected to be accomplished with Lattice QCD in the next decade, along with estimates of the required computational resources, is presented.Comment: 56 pages, 39 pdf figures. Final published versio

From:E to Z and back again: Reversible photoisomerisation of an isolated charge-tagged azobenzene

Substituted azobenzenes serve as chromophores and actuators in a wide range of molecular photoswitches. Here, tandem ion mobility spectrometry coupled with laser excitation is used to investigate the photoisomerisation of selected E and Z isomers of the charge-tagged azobenzene, methyl orange. Both isomers display a weak S1(nπ∗) photoisomerisation response in the blue part of the spectrum peaking at 440 nm and a more intense S2(ππ∗) photoisomerisation response in the near-UV with maxima at 370 and 310 nm for the E and Z isomers, respectively. The 60 nm separation between the S2(ππ∗) photo-response maxima for the two isomers allows them to be separately addressed in the gas phase and to be reversibly photoisomerised using different colours of light. This is an essential characteristic of an ideal photoswitch. The study demonstrates that a sequence of light pulses at different stages in an ion mobility spectrometer can be deployed to generate and probe isomers that cannot be electrosprayed directly from solution or produced through collisions in the ion source

Different Verbal Learning Strategies in Autism Spectrum Disorder: Evidence from the Rey Auditory Verbal Learning Test

The Rey Auditory Verbal Learning Test, which requires the free recall of the same list of 15 items over 5 trials, was administered to a group of highfunctioning adolescents and adults with autism spectrum disorder (PDD) and a group of matched typical individuals. Overall levels of free recall were comparable in the two groups, as were the rates of learning over trials. Both groups also subjectively organised their recall to a similar extent. However, the serial position curve of the PDD participants, although similar to that of the comparison group on the first trial, became flatter on subsequent trials and was characterised by a slower growth in the primacy effect. Growth in the middle and recency portions of the curve was comparable in both groups. The findings are discussed in the light of current models of serial position effects and their implications for memory in ASD