Searcharxiv⌕ Search

arXiv subjects

Feihu Xu

Publications and source records attributed to Feihu Xu.

78 records · Page 5Linked to original sources

Practical aspects of measurement-device-independent quantum key distribution

A novel protocol - measurement-device-independent quantum key distribution (MDI-QKD) - removes all attacks from the detection system, the most vulnerable part in QKD implementations. In this paper, we present an analysis for practical aspects of MDI-QKD. To evaluate its performance, we study various error sources by developing a general system model. We find that MDI-QKD is highly practical and thus can be easily implemented with standard optical devices. Moreover, we present a simple analytical method with only two (general) decoy states for the finite decoy-state analysis. This method can be used directly by experimentalists to demonstrate MDI-QKD. By combining the system model with the finite decoy-state method, we present a general framework for the optimal choice of the intensities of the signal and decoy states. Furthermore, we consider a common situation, namely asymmetric MDI-QKD, in which the two quantum channels have different transmittances. We investigate its properties and discuss how to optimize its performance. Our work is of interest not only to experiments demonstrating MDI-QKD but also to other non-QKD experiments involving quantum interference.

quant-ph↗

Long distance measurement-device-independent quantum key distribution with entangled photon sources

We present a practical method that can make quantum key distribution (QKD), for the first time, both ultra-long-distance and immune to all attacks in the detection system. This method is an important extension of the measurement-device-independent QKD (MDI-QKD) - MDI-QKD with entangled photon sources in the middle. By proposing a general model and simulating an entanglement based QKD experiment, we find that MDI-QKD with one entangled photon source in the middle can practically tolerate 77 dB combined loss (367km standard telecom fiber) in the asymptotic limit, and it can still tolerate 60 dB combined loss (286km standard telecom fiber) in the finite-key case with state-of-the-art detectors. Our general model can also be applied to other non-QKD experiments involving entangled photon sources and Bell state measurements.

quant-ph↗

Experimental Demonstration of Polarization Encoding Measurement-Device-Independent Quantum Key Distribution

We demonstrate the first implementation of polarization encoding measurement-device-independent quantum key distribution (MDI-QKD), which is immune to all detector side-channel attacks. Active phase randomization of each individual pulse is implemented to protect against attacks on imperfect sources. By optimizing the parameters in the decoy state protocol, we show that it is feasible to implement polarization encoding MDI-QKD over large optical fiber distances. A 1600-bit secure key is generated between two parties separated by 10 km of telecom fibers. Our work suggests the possibility of building a MDI-QKD network, in which complicated and expensive detection system is placed in a central node and users connected to it can perform confidential communication by preparing polarization qubits with compact and low-cost equipment. Since MDI-QKD is highly compatible with the quantum network, our work brings the realization of quantum internet one step closer.

quant-ph↗

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.

quant-ph↗

Ultrafast quantum random number generation based on quantum phase fluctuations

A quantum random number generator (QRNG) can generate true randomness by exploiting the fundamental indeterminism of quantum mechanics. Most approaches to QRNG employ single-photon detection technologies and are limited in speed. Here, we propose and experimentally demonstrate an ultrafast QRNG at a rate over 6 Gb/s based on the quantum phase fluctuations of a laser operating near threshold. Moreover, we consider a potential adversary who has partial knowledge on the raw data and discuss how one can rigorously remove such partial knowledge with post-processing. We quantify the quantum randomness through min-entropy by modeling our system, and employ two extractors, Trevisan's extractor and Toeplitz-hashing, to distill the randomness, which is information-theoretically provable. The simplicity and high-speed of our experimental setup show the feasibility of a robust, low-cost, high-speed QRNG.

quant-ph↗

Experimental demonstration of phase-remapping attack in a practical quantum key distribution system

Unconditional security proofs of various quantum key distribution (QKD) protocols are built on idealized assumptions. One key assumption is: the sender (Alice) can prepare the required quantum states without errors. However, such an assumption may be violated in a practical QKD system. In this paper, we experimentally demonstrate a technically feasible "intercept-and-resend" attack that exploits such a security loophole in a commercial "plug & play" QKD system. The resulting quantum bit error rate is 19.7%, which is below the proven secure bound of 20.0% for the BB84 protocol. The attack we utilize is the phase-remapping attack (C.-H. F. Fung, et al., Phys. Rev. A, 75, 32314, 2007) proposed by our group.

quant-ph↗