arXiv subjects

Wenyuan Wang

Publications and source records attributed to Wenyuan Wang.

61 records · Page 4Linked to original sources

arXiv2019

Asymmetric Protocols for Scalable High-Rate Measurement-Device-Independent Quantum Key Distribution Networks

Measurement-device-independent quantum key distribution (MDI-QKD) can eliminate detector side channels and prevent all attacks on detectors. The future of MDI-QKD is a quantum network that provides service to many users over untrusted relay nodes. In a real quantum network, the losses of various channels are different and users are added and deleted over time. To adapt to these features, we propose a type of protocols that allow users to independently choose their optimal intensity settings to compensate for different channel losses. Such protocol enables a scalable high-rate MDI-QKD network that can easily be applied for channels of different losses and allows users to be dynamically added/deleted at any time without affecting the performance of existing users.

quant-ph↗

arXiv2018

Recursive Geman-McClure method for implementing second-order Volterra filter

The second-order Volterra (SOV) filter is a powerful tool for modeling the nonlinear system. The Geman-McClure estimator, whose loss function is non-convex and has been proven to be a robust and efficient optimization criterion for learning system. In this paper, we present a SOV filter, named SOV recursive Geman-McClure, which is an adaptive recursive Volterra algorithm based on the Geman-McClure estimator. The mean stability and mean-square stability (steady-state excess mean square error (EMSE)) of the proposed algorithm is analyzed in detail. Simulation results support the analytical findings and show the improved performance of the proposed new SOV filter as compared with existing algorithms in both Gaussian and impulsive noise environments.

eess.SY↗

arXiv2018

Information theoretic security of quantum key distribution overcoming the repeaterless secret key capacity bound

Quantum key distribution is a way to distribute secret keys to distant users with information theoretic security and key rates suitable for real-world applications. Its rate-distance figure, however, is limited by the natural loss of the communication channel and can never surpass a theoretical limit known as point-to-point secret key capacity. Recently, a new type of quantum key distribution with an intermediate relay was proposed to overcome this limit (M. Lucamarini, Z. L. Yuan, J. F. Dynes and A. J. Shields, Nature, 2018). However, a standard application of the decoy state method limited the security analysis of this scheme to hold under restrictive assumptions for the eavesdropper. Hence, overcoming the point-to-point secret key capacity with an information-theoretic secure scheme is still an open question. Here, we propose a novel way to use decoy states to answer this question. The key idea is to switch between a Test mode and a Code mode, the former enabling the decoy state parameter estimation and the latter generating a key through a phase encoding protocol. This way, we confirm the scaling properties of the original scheme and overcome the secret key capacity at long distances. Our work plays a key role to unlock the potential of practical secure quantum communications.

quant-ph↗

arXiv2018

Asymptotics of convolution with the semi-regular-variation tail and its application to risk

In this paper, according to a certain criterion, we divide the exponential distribution class into three subclasses. One of them is closely related to the regular-variation-tailed distribution class, so it is called the semi-regular-variation-tailed distribution class. In the class, although all distributions are not convolution equivalent,they still have some good properties. We give the precise tail asymptotic expression of convolution of these distributions, and prove that the new class is closed under convolution. In addition, we do not need to require the corresponding random variables to be identically distributed. Finally, we apply these results to a discrete time risk model with stochastic returns, and obtain the precise asymptotic estimation of the finite time ruin probability.

math.PR↗

arXiv2017

Pre-fixed Threshold Real Time Selection Method in Free-space Quantum Key Distribution

Free-space Quantum key distribution (QKD) allows two parties to share a random key with unconditional security, between ground stations, between mobile platforms, and even in satellite-ground quantum communications. Atmospheric turbulence causes fluctuations in transmittance, which further affect the quantum bit error rate (QBER) and the secure key rate. Previous post-selection methods to combat atmospheric turbulence require a threshold value determined after all quantum transmission. In contrast, here we propose a new method where we pre-determine the optimal threshold value even before quantum transmission. Therefore, the receiver can discard useless data immediately, thus greatly reducing data storage requirement and computing resource. Furthermore, our method can be applied to a variety of protocols, including, for example, not only single-photon BB84, but also asymptotic and finite-size decoy-state BB84, which can greatly increase its practicality.

quant-ph↗

arXiv2017

Characterizing multi-photon quantum interference with practical light sources and threshold single-photon detectors

The experimental characterization of multi-photon quantum interference effects in optical networks is essential in many applications of photonic quantum technologies, which include quantum computing and quantum communication as two prominent examples. However, such characterization often requires technologies which are beyond our current experimental capabilities, and today's methods suffer from errors due to the use of imperfect sources and photodetectors. In this paper, we introduce a simple experimental technique to characterise multi-photon quantum interference by means of practical laser sources and threshold single-photon detectors. Our technique is based on well-known methods in quantum cryptography which use decoy settings to tightly estimate the statistics provided by perfect devices. As an illustration of its practicality, we use this technique to obtain a tight estimation of both the generalized Hong-Ou-Mandel dip in a beamsplitter with six input photons, as well as the three-photon coincidence probability at the output of a tritter.

quant-ph↗

arXiv2015

Experimental Quantum Fingerprinting

Quantum communication holds the promise of creating disruptive technologies that will play an essential role in future communication networks. For example, the study of quantum communication complexity has shown that quantum communication allows exponential reductions in the information that must be transmitted to solve distributed computational tasks. Recently, protocols that realize this advantage using optical implementations have been proposed. Here we report a proof of concept experimental demonstration of a quantum fingerprinting system that is capable of transmitting less information than the best known classical protocol. Our implementation is based on a modified version of a commercial quantum key distribution system using off-the-shelf optical components over telecom wavelengths, and is practical for messages as large as 100 Mbits, even in the presence of experimental imperfections. Our results provide a first step in the development of experimental quantum communication complexity.

quant-ph↗