arXiv subjects

M. Curty

Publications and source records attributed to M. Curty.

6 recordsLinked to original sources

arXiv2019

Proof-of-principle experimental demonstration of twin-field type quantum key distribution

The twin-field (TF) quantum key distribution (QKD) protocol and its variants are highly attractive because they can beat the well-known rate-loss limit (i.e., the PLOB bound) for QKD protocols without quantum repeaters. In this paper, we perform a proof-of-principle experimental demonstration of TF-QKD based on the protocol proposed by Curty et al. which removes from the original TF-QKD scheme the need for post-selection on the matching of a global phase, and can deliver nearly an order of magnitude higher secret key rate. Furthermore, we overcome the major difficulty in the practical implementation of TF-QKD, namely, the need to stabilize the phase of the quantum state over kilometers of fiber. A Sagnac loop structure is utilized to ensure excellent phase stability between the different parties. Using decoy states, we demonstrate secret-key generation rates that beat the PLOB bound when the channel loss is above 40 dB.

quant-ph↗

arXiv2017

Experimental measurement-device-independent quantum digital signatures

We propose and experimentally implement a novel reconfigurable quantum key distribution (QKD) scheme, where the users can switch in real time between conventional QKD and the recently-introduced measurement-device-independent (MDI) QKD. Through this setup, we demonstrate the distribution of quantum keys between three remote parties connected by only two quantum channels, a previously unattempted task. Moreover, as a prominent application, we extract the first quantum digital signature (QDS) rates from a network that uses a measurement-device-independent link. In so doing, we introduce an efficient protocol to distil multiple signatures from the same block of data, thus reducing the statistical fluctuations in the sample and increasing the final QDS rate.

quant-ph↗

arXiv2014

Quantum key distribution with untrusted detectors

Side-channel attacks currently constitute the main challenge for quantum key distribution (QKD) to bridge theory with practice. So far two main approaches have been introduced to address this problem, (full) device-independent QKD and measurement-device-independent QKD. Here we present a third solution that might exceed the performance and practicality of the previous two in circumventing detector side-channel attacks, which arguably is the most hazardous part of QKD implementations. Our proposal has, however, one main requirement: the legitimate users of the system need to ensure that their labs do not leak any unwanted information to the outside. The security in the low-loss regime is guaranteed, while in the high-loss regime we already prove its robustness against some eavesdropping strategies.

quant-ph↗

arXiv2014

Ultra-fast quantum randomness generation by accelerated phase diffusion in a pulsed laser diode

We demonstrate a high bit-rate quantum random number generator by interferometric detection of phase diffusion in a gain-switched DFB laser diode. Gain switching at few-GHz frequencies produces a train of bright pulses with nearly equal amplitudes and random phases. An unbalanced Mach-Zehnder interferometer is used to interfere subsequent pulses and thereby generate strong random-amplitude pulses, which are detected and digitized to produce a high-rate random bit string. Using established models of semiconductor laser field dynamics, we predict a regime of high visibility interference and nearly complete vacuum-fluctuation-induced phase diffusion between pulses. These are confirmed by measurement of pulse power statistics at the output of the interferometer. Using a 5.825 GHz excitation rate and 14-bit digitization, we observe 43 Gbps quantum randomness generation.

quant-ph↗

arXiv2011

True random numbers from amplified quantum vacuum

Random numbers are essential for applications ranging from secure communications to numerical simulation and quantitative finance. Algorithms can rapidly produce pseudo-random outcomes, series of numbers that mimic most properties of true random numbers while quantum random number generators (QRNGs) exploit intrinsic quantum randomness to produce true random numbers. Single-photon QRNGs are conceptually simple but produce few random bits per detection. In contrast, vacuum fluctuations are a vast resource for QRNGs: they are broad-band and thus can encode many random bits per second. Direct recording of vacuum fluctuations is possible, but requires shot-noise-limited detectors, at the cost of bandwidth. We demonstrate efficient conversion of vacuum fluctuations to true random bits using optical amplification of vacuum and interferometry. Using commercially-available optical components we demonstrate a QRNG at a bit rate of 1.11 Gbps. The proposed scheme has the potential to be extended to 10 Gbps and even up to 100 Gbps by taking advantage of high speed modulation sources and detectors for optical fiber telecommunication devices.

quant-ph↗

arXiv2004

Complete hierarchies of efficient approximations to problems in entanglement theory

We investigate several problems in entanglement theory from the perspective of convex optimization. This list of problems comprises (A) the decision whether a state is multi-party entangled, (B) the minimization of expectation values of entanglement witnesses with respect to pure product states, (C) the closely related evaluation of the geometric measure of entanglement to quantify pure multi-party entanglement, (D) the test whether states are multi-party entangled on the basis of witnesses based on second moments and on the basis of linear entropic criteria, and (E) the evaluation of instances of maximal output purities of quantum channels. We show that these problems can be formulated as certain optimization problems: as polynomially constrained problems employing polynomials of degree three or less. We then apply very recently established known methods from the theory of semi-definite relaxations to the formulated optimization problems. By this construction we arrive at a hierarchy of efficiently solvable approximations to the solution, approximating the exact solution as closely as desired, in a way that is asymptotically complete. For example, this results in a hierarchy of novel, efficiently decidable sufficient criteria for multi-particle entanglement, such that every entangled state will necessarily be detected in some step of the hierarchy. Finally, we present numerical examples to demonstrate the practical accessibility of this approach.

quant-ph↗