Ground state cooling of an optomechanical resonator with double quantum interference processes

We present a cooling scheme with a tripod configuration atomic ensemble trapped in an optomechanical cavity.With the employment of two different quantum interference processes,our scheme illustrates that it is possible to cool a resonator to its ground state in the strong cavity-atom coupling regime.Moreover,with the assistance of one additional energy level,our scheme takes a larger cooling rate to realize the ground state cooling.In addition,this scheme is a feasible candidate for experimental applications.     

Controlling a sine wave gating single-photon detector by exploiting its filtering loophole

GHz single-photon detector(SPD) is a crucial part in the practical high speed quantum key distribution(QKD) system.However, any imperfections in a practical QKD system may be exploited by an eavesdropper(Eve) to collect information about the key without being discovered. The sine wave gating SPD(SG-SPD) based on InGaAs/InP avalanche photodiode,one kind of practical high speed SPD, may also contain loopholes. In this paper, we study the principle and characteristic of the SG-SPD and find out the filtering loophole of the SG-SPD for the first time. What is more, the proof-of-principle experiment shows that Eve could blind and control Bob's SG-SPD by exploiting this loophole. We believe that giving enough attention to this loophole can improve the practical security of the existing QKD system.     

含有多目标的量子部分搜索——目标被非平均分配在两块中

Grover搜索是一种量子搜索方法,利用了量子叠加态的性质,通过一些操作的反复作用,而使目标态的几率幅变大,非目标态的几率幅变小,从而以较大的概率找到目标.与经典搜索方法相比,能够较快地从一个数据库中找到目标元.这是一种搜索到目标的全部信息的方法,但是在有些情况下,我们并不需要知道目标的全部信息,而只需要知道目标的部分信息,因而只需要找到含有目标的一部分数据库中的元素,这就是部分搜索.Grover和Radhakrishnan提出了一种部分搜索方法,称为Grover-Radhakrishnan Algorithm of Partial Search(GRK),所考虑的数据库只含有一个目标.在我们的文章中,我们研究了在含有多目标的数据库,且目标被随机分配在两块中时,GRK所需要的查询次数会有怎么样的变化.得到查询次数s和所分块数K、目标数t的关系.并且与平均分配的情况进行比较.     

Research on Quantum Searching Algorithms Based on Phase Shifts

One iterative in Grover＇s original quantum search algorithm consists of two Hadamard-Walsh transformations, a selective amplitude inversion and a diffusion amplitude inversion. We concentrate on the relation among the probability of success of the algorithm, the phase shifts, the number of target items and the number of iterations via replacing the two amplitude inversions by phase shifts of an arbitrary φ = ψ（0 ≤, ψ≤ 27r）. Then, according to the relation we find out the optimal phase shifts when the number of iterations is given. We present a new quantum search algorithm based on the optimal phase shifts of 1.018 after 0.57π√M/N iterations. The new algorithm can obtain either a single target item or multiple target items in the search space with the probability of success at least 93.43%     

Quantum Search Algorithm Based on Multi-Phase

The success probability of the Grover quantum search algorithm decreases quickly when the fraction of target items exceeds 1/4, where the phase plays a significant role. Therefore, we use multiple phases to complement each other. We obtain three useful properties and an important theorem of the success probability and design a systematic solution of the optimal phases for an arbitrary number of phases. Based on these results, we finally propose a multi-phase quantum search algorithm whose success probability rises with the increase of the number of phases with just a single iteration, and it tends to be 100% when the fraction of target items is over a lower limit.     

Finite-key analysis of practical time-bin high-dimensional quantum key distribution with afterpulse effect

High-dimensional quantum resources provide the ability to encode several bits of information on a single photon, which can particularly increase the secret key rate rate of quantum key distribution (QKD) systems. Recently, a practical four-dimensional QKD scheme based on time-bin quantum photonic state, only with two single-photon avalanche detectors as measurement setup, has been proven to have a superior performance than the qubit-based one. In this paper, we extend the results to our proposed eight-dimensional scheme. Then, we consider two main practical factors to improve its secret key bound. Concretely, we take the afterpulse effect into account and apply a finite-key analysis with the intensity fluctuations. Our secret bounds give consideration to both the intensity fluctuations and the afterpulse effect for the high-dimensional QKD systems. Numerical simulations show the bound of eight-dimensional QKD scheme is more robust to the intensity fluctuations but more sensitive to the afterpulse effect than the four-dimensional one.     

Time–energy high-dimensional one-side device-independent quantum key distribution

Compared with full device-independent quantum key distribution(DI-QKD), one-side device-independent QKD(1s DI-QKD) needs fewer requirements, which is much easier to meet. In this paper, by applying recently developed novel time–energy entropic uncertainty relations, we present a time–energy high-dimensional one-side device-independent quantum key distribution(HD-QKD) and provide the security proof against coherent attacks. Besides, we connect the security with the quantum steering. By numerical simulation, we obtain the secret key rate for Alice's different detection efficiencies. The results show that our protocol can performance much better than the original 1s DI-QKD. Furthermore, we clarify the relation among the secret key rate, Alice's detection efficiency, and the dispersion coefficient. Finally, we simply analyze its performance in the optical fiber channel.     

Passive decoy-state quantum key distribution for the weak coherent photon source with finite-length key

Passive decoy-state quantum key distribution systems, proven to be more desirable than active ones in some scenarios,also have the problem of device imperfections like finite-length keys. In this paper, based on the WCP source which can be used for the passive decoy-state method, we obtain the expressions of single-photon error rates, single-photon counts, and phase error rates. According to the information of smooth min-entropy, we calculate the key generation rate under the condition of finite-length key. Key generation rates with different numbers of pulses are compared by numerical simulations. From the results, it can be seen that the passive decoy-state method can have good results if the total number of pulses reaches 1010. We also simulate the passive decoy-state method with different probabilities of choosing a pulse for parameter estimation when the number of pulses is fixed.     

Realization of quantum Fourier transform over ZN

Since the difficulty in preparing the equal superposition state of amplitude is 1/√N, we construct a quantile transform of quantum Fourier transform （QFT） over ZN based on the elementary transforms, such as Hadamard transform and Pauli transform. The QFT over Z_N can then be realized by the quantile transform, and used to further design its quantum circuit and analyze the requirements for the quantum register and quantum gates. However, the transform needs considerable quantum computational resources and it is difficult to construct a high-dimensional quantum register. Hence, we investigate the design of t-bit quantile transform, and introduce the definition of t-bit semiclassical QFT over Z_N. According to probability amplitude, we prove that the transform can be used to realize QFT over ZN and further design its quantum circuit. For this transform, the requirements for the quantum register, the one-qubit gate, and two-qubit gate reduce obviously when compared with those for the QFT over Z_N.