arXiv subjects

Hong-Wei Li

Publications and source records attributed to Hong-Wei Li.

At least 37 records · Page 2Linked to original sources

arXiv2015

Quantum differential cryptanalysis to the block ciphers

Differential cryptanalysis is one of the most popular methods in attacking block ciphers. However, there still some limitations in traditional differential cryptanalysis. On the other hand, researches of quantum algorithms have made great progress nowadays. This paper proposes two methods to apply quantum algorithms in differential cryptanalysis, and analysis their efficiencies and success probabilities. One method is using quantum algorithm in the high probability differential finding period for every S-Box. The second method is taking the encryption as a whole, using quantum algorithm in this process.

quant-ph↗

arXiv2015

Randomness determines practical security of BB84 quantum key distribution

Unconditional security of the BB84 quantum key distribution protocol has been proved by exploiting the fundamental laws of quantum mechanics, but the practical quantum key distribution system maybe hacked by considering the imperfect state preparation and measurement respectively. Until now, different attacking schemes have been proposed by utilizing imperfect devices, but the general security analysis model against all of the practical attacking schemes has not been proposed. Here, we demonstrate that the general practical attacking schemes can be divided into the Trojan horse attack, strong randomness attack and weak randomness attack respectively. We prove security of BB84 protocol under randomness attacking models, and these results can be applied to guarantee the security of the practical quantum key distribution system.

quant-ph↗

arXiv2015

Robust quantum random number generator based on avalanche photodiodes

We propose and demonstrate a scheme to realize a high-efficiency truly quantum random number generator (RNG) at room temperature (RT). Using an effective extractor with simple time bin encoding method, the avalanche pulses of avalanche photodiode (APD) are converted into high-quality random numbers (RNs) that are robust to slow varying noise such as fluctuations of pulse intensity and temperature. A light source is compatible but not necessary in this scheme. Therefor the robustness of the system is effective enhanced. The random bits generation rate of this proof-of-principle system is 0.69 Mbps with double APDs and 0.34 Mbps with single APD. The results indicate that a high-speed RNG chip based on the scheme is potentially available with an integrable APD array.

quant-ph↗

arXiv2015

Experimental demonstration of quantum key distribution without monitoring of the signal disturbance

Quantum key distribution (QKD) enables two distant users, Alice and Bob, to share secret keys. In existing QKD protocols, an eavesdropper's intervention will inevitably disturb the quantum signals; thus, Alice and Bob must monitor the signal disturbance to place a bound on the potential information leakage. However, T. Sasaki et al. proposed a quite different protocol, named round-robin differential phase shift (RRDPS), in which the amount of eavesdropped information is bounded without monitoring the signal disturbance. Here, we present the first active implementation of the RRDPS protocol. In our experiment, Alice prepares packets of pulses, with each packet being a train with 65 pulses, and the global phase of each packet is randomized. Bob uses a 1-GHz, 1-64-bit actively controlled variable-delay interferometer to realize random switching of the different delays. Benefiting from the large pulse number of each packet, the high stability and low insertion loss of the interferometer, the system can distribute secret key over a distance of 90 km. Our results confirm the feasibility of performing practical QKD with this novel protocol.

quant-ph↗

arXiv2015

Semi-device-independent randomness expansion with partially free random sources

By proposing device-independent protocols, S. Pironio et al. [Nature 464, 1021-1024 (2010)] and R. Colbeck et al. [Nature Physics 8, 450-453 (2012)] proved that new randomness can be generated by using perfectly free random sources or partially free ones as seed. Subsequently, Li et al. [Phys. Rev. A 84, 034301 (2011)] studied this topic in the framework of semi-device-independent and proved that new randomness can be obtained from perfectly free random sources. Here we discuss whether and how partially free random sources bring us new randomness in semi-device-independent scenario. We propose a semi-device-independent randomness expansion protocol with partially free random sources, and obtain the condition that the partially free random sources should satisfy to generate new randomness. In the process of analysis, we acquire a new 2-dimensional quantum witness. Furthermore, we get the analytic relationship between the generated randomness and the 2-dimensional quantum witness violation.

quant-ph↗

arXiv2015

Detection efficiency and noise in semi-device independent randomness extraction protocol

In this paper, we analyze several critical issues in semi-device independent quantum information processing protocol. In practical experimental realization randomness generation in that scenario is possible only if the efficiency of the detectors used is above a certain threshold. Our analysis shows that the critical detection efficiency is 0.7071 in the symmetric setup, while in the asymmetric setup if one of the bases has perfect critical detection efficiency then the other one can be arbitrarily close to 0. We also analyze the semi-device independent random number generation efficiency based on different averages of guessing probability. To generate more randomness, the proper averaging method should be applied. Its choice depends on the value of a certain dimension witness. More importantly, the general analytical relationship between the maximal average guessing probability and dimension witness is given.

quant-ph↗

arXiv2015

A quantum algorithm for approximating the influences of Boolean functions and its applications

We investigate the influences of variables on a Boolean function $f$ based on the quantum Bernstein-Vazirani algorithm. A previous paper (Floess et al. in Math. Struct. in Comp. Science 23: 386, 2013) has proved that if a $n$-variable Boolean function $f(x_1,\ldots,x_n)$ does not depend on an input variable $x_i$, using the Bernstein-Vazirani circuit to $f$ will always obtain an output $y$ that has a $0$ in the $i$th position. We generalize this result and show that after one time running the algorithm, the probability of getting a 1 in each position $i$ is equal to the dependence degree of $f$ on the variable $x_i$, i.e. the influence of $x_i$ on $f$. On this foundation, we give an approximation algorithm to evaluate the influence of any variable on a Boolean function. Next, as an application, we use it to study the Boolean functions with juntas, and construct probabilistic quantum algorithms to learn certain Boolean functions. Compared with the deterministic algorithms given by Floess et al., our probabilistic algorithms are faster.

cs.DS↗

arXiv2015

A quantum algorithm to approximate the linear structures of Boolean functions

We present a quantum algorithm for approximating the linear structures of a Boolean function $f$. Different from previous algorithms (such as Simon's and Shor's algorithms) which rely on restrictions on the Boolean function, our algorithm applies to every Boolean function with no promise. Here, our methods are based on the result of the Bernstein-Vazirani algorithm which is to identify linear Boolean functions and the idea of Simon's period-finding algorithm. More precisely, how the extent of approximation changes over the time is obtained, and meanwhile we also get some quasi linear structures if there exists. Next, we obtain that the running time of the quantum algorithm to thoroughly determine this question is related to the relative differential uniformity $δ_f$ of $f$. Roughly speaking, the smaller the $δ_f$ is, the less time will be needed.

quant-ph↗

arXiv2014

Mismatched-basis statistics enable quantum key distribution with uncharacterized qubit sources

In the postprocessing of quantum key distribution, the raw key bits from the mismatched-basis measurements, where two parties use different bases, are normally discarded. Here, we propose a postprocessing method that exploits measurement statistics from mismatched-basis cases, and prove that incorporating these statistics enables uncharacterized qubit sources to be used in the measurement-device-independent quantum key distribution protocol and the Bennett-Brassard 1984 protocol, a case which is otherwise impossible.

quant-ph↗

arXiv2014

Decoy state measurement-device-independent quantum key distribution based on the Clauser-Horne-Shimony-Holt inequality

The measurement-device-independent quantum key distribution (MDI-QKD) protocol is proposed to remove the detector side channel attacks, while its security relies on the assumption that the encoding systems are perfectly characterized. In contrast, the MDI-QKD protocol based on the Clauser-Horne-Shimony-Holt inequality (CHSH-MDI-QKD) weakens this assumption, which only requires the quantum state to be prepared in the two-dimensional Hilbert space and the devices are independent. In experimental realizations, the weak coherent state, which is always used in QKD systems due to the lack of an ideal single photon source, may be prepared in the high-dimensional space. In this paper, we investigate the decoy-state CHSH-MDI-QKD protocol with $s(3 \le s \le 5)$ intensities, including one signal state and $s-1$ decoy states, and we also consider the finite-size effect on the decoy-state CHSH-MDI-QKD protocol with five intensities. Simulation results show that this scheme is very practical.

quant-ph↗

arXiv2014

Field and long-term demonstration of a wide area quantum key distribution network

A wide area quantum key distribution (QKD) network deployed on communication infrastructures provided by China Mobile Ltd. is demonstrated. Three cities and two metropolitan area QKD networks were linked up to form the Hefei-Chaohu-Wuhu wide area QKD network with over 150 kilometers coverage area, in which Hefei metropolitan area QKD network was a typical full-mesh core network to offer all-to-all interconnections, and Wuhu metropolitan area QKD network was a representative quantum access network with point-to-multipoint configuration. The whole wide area QKD network ran for more than 5000 hours, from 21 December 2011 to 19 July 2012, and part of the network stopped until last December. To adapt to the complex and volatile field environment, the Faraday-Michelson QKD system with several stability measures was adopted when we designed QKD devices. Through standardized design of QKD devices, resolution of symmetry problem of QKD devices, and seamless switching in dynamic QKD network, we realized the effective integration between point-to-point QKD techniques and networking schemes.

quant-ph↗

arXiv2014

Properties of dimension witnesses and their semi-definite programming relaxations

In this paper we develop a method for investigating semi-device-independent randomness expansion protocols that was introduced in [Li et al., Phys. Rev. A $\mathbf{87}$, 020302(R) (2013)]. This method allows to lower-bound, with semi-definite programming, the randomness obtained from random number generators based on dimension witnesses. We also investigate the robustness of some randomness expanders using this method. We show the role of an assumption about the trace of the measurement operators and a way to avoid it. The method is also generalized to systems of arbitrary dimension, and for a more general form of dimension witnesses, than it the previous paper. Finally, we introduce a procedure of dimension witness reduction, which can be used to obtain from an existing witness a new one with higher amount of certifiable randomness. The presented methods finds an application for experiments [Ahrens et al., Phys. Rev. Lett. $\mathbf{112}$, 140401 (2014)].

quant-ph↗

arXiv2014

Security of modified Ping-Pong protocol in noisy and lossy channel

The "Ping-Pong" (PP) protocol is a two-way quantum key protocol based on entanglement. In this protocol, Bob prepares one maximally entangled pair of qubits, and sends one qubit to Alice. Then, Alice performs some necessary operations on this qubit and sends it back to Bob. Although this protocol was proposed in 2002, its security in the noisy and lossy channel has not been proven. In this report, we add a simple and experimentally feasible modification to the original PP protocol, and prove the security of this modified PP protocol against collective attacks when the noisy and lossy channel is taken into account. Simulation results show that our protocol is practical.

quant-ph↗

arXiv2014

Proof-of-principle experiment of reference-frame-independent quantum key distribution with phase coding

We have demonstrated a proof-of-principle experiment of reference-frame-independent phase coding quantum key distribution (RFI-QKD) over an 80-km optical fiber. After considering the finite-key bound, we still achieve a distance of 50 km. In this scenario, the phases of the basis states are related by a slowly time-varying transformation. Furthermore, we developed and realized a new decoy state method for RFI-QKD systems with weak coherent sources to counteract the photon-number-splitting attack. With the help of a reference-frame-independent protocol and a Michelson interferometer with Faraday rotator mirrors, our system is rendered immune to the slow phase changes of the interferometer and the polarization disturbances of the channel, making the procedure very robust.

quant-ph↗

arXiv2014

Phase-encoded measurement device independent quantum key distribution with practical spontaneous parametric-down-conversion sources

Measurement-device-independent quantum key distribution (MDI-QKD) with weak coherent sources has been widely and meticulously analyzed. However, the analysis for MDI-QKD with spontaneous parametric-down-conversion sources (SPDCS) is incomplete. In this paper, by accounting for practical parameters of SPDCS with thermal distribution, we presents an investigation on the performances of MDI-QKD under the active three-intensity decoy protocol and the passive one-intensity decoy protocol respectively. Phase randomization, inherently prerequisite for decoy protocol, is taken into consideration for evaluating the overall quantum bit gain and quantum bit error rate. The numerical simulations show that MDI-QKD using SPDCS with practical decoy protocols can be demonstrated comparable to the asymptotical case with infinite decoy states and has apparent superiority both in transmission distance and key generation rate compared to the MDI-QKD using weak coherent sources. Our results also indicate that MDI-QKD using thermal distributed SPDCS with active three-intensity decoy protocol performs better than the one with passive one-intensity decoy protocol.

quant-ph↗

arXiv2014

Quantum key distribution based on quantum dimension and independent devices

In this paper, we propose a quantum key distribution (QKD) protocol based on only a two-dimensional Hilbert space encoding a quantum system and independent devices between the equipment for state preparation and measurement. Our protocol is inspired by the fully device-independent quantum key distribution (FDI-QKD) protocol and the measurement-device-independent quantum key distribution (MDI-QKD) protocol. Our protocol only requires the state to be prepared in the two dimensional Hilbert space, which weakens the state preparation assumption in the original MDI-QKD protocol. More interestingly, our protocol can overcome the detection loophole problem in the FDI-QKD protocol, which greatly limits the application of FDI-QKD. Hence our protocol can be implemented with practical optical components.

quant-ph↗

arXiv2014

Device and semi-device independent random numbers based on non-inequality paradox

In this work, we propose device independent true random numbers generation protocols based on non-inequality paradoxes such as Hardy's and Cabello's non-locality argument. The efficiency of generating randomness in our protocols are far better than any other proposed protocols certified by CHSH inequality or other non-locality test involving inequalities. Thus, highlighting non-inequality paradox as an important resource for device independent quantum information processing in particular generating true randomness. As a byproduct, we find that the non-local bound of the Cabello's argument with arbitrary dimension is the same as the one achieved in the qubits system. More interestingly, we propose a new dimension witness paradox based on the Cabello's argument, which can be used for constructing semi-device-independent true random numbers generation protocol.

quant-ph↗

arXiv2013

Measurement-device-independent quantum key distribution with uncharacterized qubit sources

Measurement-device-independent quantum key distribution (MDIQKD) is proposed to be secure against any possible detection attacks. The security of the original proposal relies on the assumption that the legitimate users can fully characterize the encoding systems including sources. Here, we propose a MDIQKD protocol where we allow uncharacterized encoding systems as long as qubit sources are used. A security proof of the MDIQKD protocol is presented that does not need the knowledge of the encoding states. Simulation results show that the scheme is practical.

quant-ph↗