General Quantum Meet-in-the-Middle Search Algorithm Based on Target Solution of Fixed Weight

Similar to the classical meet-in-the-middle algorithm, the storage and computation complexity are the key factors that decide the efficiency of the quantum meet-in-the-middle algorithm. Aiming at the target vector of fixed weight, based on the quantum meet-in-the-middle algorithm, the algorithm for searching all n-product vectors with the same weight is presented, whose complexity is better than the exhaustive search algorithm. And the algorithm can reduce the storage complexity of the quantum meet-in-the-middle search algorithm. Then based on the algorithm and the knapsack vector of the Chor-Rivest public-key crypto of fixed weight d, we present a general quantum meet-in-the-middle search algorithm based on the target solution of fixed weight, whose computational complexity is ∑_j^d=(0(√C_n-k+1^d-j)+O(C_k^jlogC_k^j)) with ∑_i=0^dC_kⁱ memory cost. And the optimal value of k is given. Compared to the quantum meet-in-the-middle search algorithm for knapsack problem and the quantum algorithm for searching a target solution of fixed weight, the computational complexity of the algorithm is lower. And its storage complexity is smaller than the quantum meet-in-the-middle-algorithm.     

Security of continuous-variable measurement-device-independent quantum key distribution with imperfect state preparation

The state preparation operation of continuous-variable measurement-device-independent quantum key distribution (CV-MDI-QKD) protocol may become imperfect in practical applications. We address the security of the CV-MDI-QKD protocol based on imperfect preparation of the coherent state under realistic conditions of lossy and noisy quantum channel. Specifically, we assume that the imperfection of Alice's and Bob's practical state preparations equal to the amplification of ideal modulators and lasers at both Alice's and Bob's sides by untrusted third-parties Fred and Gray employing phase-insensitive amplifiers (PIAs), respectively. The equivalent excess noise introduced by the imperfect state preparation is comprehensively and quantitatively calculated by adopting the gains of PIAs. Security analysis shows that CV-MDI-QKD is quite sensitive to the imperfection of practical state preparation, which inevitably deteriorates the performance and security of CV-MDI-QKD system. Moreover, a lower bound of the secret key rate is derived under arbitrary collective attacks, and the upper threshold of this imperfection tolerated by the system is obtained in the form of the specific gains of PIAs. In addition, the methods presented will improve and perfect the practical security of CV-MDI-QKD protocol.     

Security of decoy states QKD with finite resources against collective attacks

The number of transmitted signals in practical quantum key distribution (QKD) protocol is always finite. We discuss the security of decoy states QKD protocol with finite resources by considering the statistical fluctuation for the yield and error rate of the quantum state in different sources of pulses (signal sources and decoy sources). The number of exchanged quantum signals vs positive key generation rate is given with experiment results.     

Lower bounds for the security of modified coherent-one-way quantum key distribution against one-pulse-attack

Upper bounds for the security of coherent-one-way (COW) quantum key distribution protocols have been analyzed by considering the one-pulse-attack [Branciard C, Gisin N and Scarani V (BGS) New J.Phys. (2008) 10 013031]. However, their security analysis was based on long distance case, and the typical value of the transmission distance is larger than 50 km. Applying the sharp continuity for the von Neumann entropy and some basic inequalities, we provide lower bounds for the security of modified coherent-one-way quantum key distribution protocol against the most general one-pulse-attack by only considering photon number resolved detectors that will be used in the receiver's side. Comparing with BGS's security analysis, our security analysis can be satisfied with arbitrary distance case.     

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%     

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.     

A rapid and sensitive liquid chromatography/positive ion tandem mass spectrometry method for the determination of cimetropium in human plasma by liquid-liquid extraction

We have developed and validated a simple detection system with high-performance liquid chromatography (HPLC) with positive ion electrospray ionization tandem mass spectrometry (ESI-MS/MS) for determining cimetropium levels in human plasma using scopolamine butyl bromide as an internal standard (I.S.). The acquisition was performed in the multiple reaction monitoring (MRM) mode, by monitoring the transitions: m/z 357.9 > 103.1 for cimetropium and m/z 359.9 > 103.1 for butyl-scopolamine. The method involves a simple single-step liquid-liquid extraction with dichloromethane. The analyte was chromatographed on an YMC C18 reversed-phase chromatographic column by isocratic elution with 10 mM ammonium formate buffer-methanol (19:81, v/v; adjusted to pH 4.0 with formic acid). The results were linear over the studied range (0.2-100 ng ml(-1)), with r2 = 1.0000, and the total analysis time for each run was 2 min. Intra- and interassay precisions were 0.70-8.54% and 1.08-4.85%, respectively, and intra- and interassay accuracies were 97.56-108.23% and 97.48-103.91%, respectively. The lower limit of quantification (LLOQ) was 0.2 ng ml(-1). At this concentration, mean intra- and interassay precisions were 8.54% and 4.85%, respectively, and mean intra- and interassay accuracies were 97.56% and 98.91%, respectively. The mean recovery ranged from 62.71 +/- 4.06 to 64.23 +/- 2.32%. Cimetropium was found to be stable in plasma samples under typical storage and processing conditions. The devised assay was successfully applied to a pharmacokinetic study of cimetropium bromide administered as a single oral dose (150 mg) to healthy volunteers.     

Practical Security of High-Dimensional Quantum Key Distribution with Intensity Modulator Extinction

Quantum key distribution (QKD) has attracted much attention due to its unconditional security. High-dimensional quantum key distribution (HD-QKD) is a brand-new type of QKD protocol that has many excellent advantages. Nonetheless, practical imperfections in realistic devices that are not considered in the theoretical security proof may have an impact on the practical security of realistic HD-QKD systems. In this paper, we research the influence of a realistic intensity modulator on the practical security of HD-QKD systems with the decoy-state method and finite-key effects. We demonstrate that there is a certain impact in the secret key rate and the transmission distance when taking practical factors into security analysis.     

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.