Xiang-Qun Fu

Decoherence in optimized quantum random-walk search algorithm

This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the optimized quantum random-walk search algorithm with decoherence is depicted through defining the shift operator which includes the possibility of broken links. For a given database size, we obtain the maximum success rate of the algorithm and the required number of iterations through numerical simulations and analysis when the algorithm is in the presence of decoherence. Then the computational complexity of the algorithm with decoherence is obtained. The results show that the ultimate effect of broken-link-type decoherence on the optimized quantum random-walk search algorithm is negative.

Universal blind quantum computation for hybrid system

As progress on the development of building quantum computer continues to advance, first-generation practical quantum computers will be available for ordinary users in the cloud style similar to IBM’s QuantumExperience nowadays. Clients can remotely access the quantum servers using some simple devices. In such a situation, it is of prime importance to keep the security of the client’s information. Blind quantum computation protocols enable a client with limited quantum technology to delegate her quantum computation to a quantum server without leaking any privacy. To date, blind quantum computation has been considered only for an individual quantum system. However, practical universal quantum computer is likely to be a hybrid system. Here, we take the first step to construct a framework of blind quantum computation for the hybrid system, which provides a more feasible way for scalable blind quantum computation.

Effects of systematic phase errors on optimized quantum random-walk search algorithm*

This paper researches how the systematic errors in phase inversions affect the success rate and the number of iterations in optimized quantum random-walk search algorithm. Through geometric description of this algorithm, the model of the algorithm with phase errors is established and the relationship between the success rate of the algorithm, the database size, the number of iterations and the phase error is depicted. For a given sized database, we give both the maximum success rate of the algorithm and the required number of iterations when the algorithm is in the presence of phase errors. Through analysis and numerical simulations, it shows that optimized quantum random-walk search algorithm is more robust than Grovers algorithm.

Statistical Analysis for Collision-free Boson Sampling

Boson sampling is strongly believed to be intractable for classical computers but solvable with photons in linear optics, which raises widespread concern as a rapid way to demonstrate the quantum supremacy. However, due to its solution is mathematically unverifiable, how to certify the experimental results becomes a major difficulty in the boson sampling experiment. Here, we develop a statistical analysis scheme to experimentally certify the collision-free boson sampling. Numerical simulations are performed to show the feasibility and practicability of our scheme, and the effects of realistic experimental conditions are also considered, demonstrating that our proposed scheme is experimentally friendly. Moreover, our broad approach is expected to be generally applied to investigate multi-particle coherent dynamics beyond the boson sampling.

Ground state cooling in a hybrid optomechanical system with a three-level atomic ensemble

Cooling mechanical resonators is of great importance for both fundamental study and applied science. We investigate the hybrid optomechanical cooling with a three-level atomic ensemble fixed in a strong excited optical cavity. By using the quantum noise approach, we find the upper bound of the noise spectrum and further present three optimal parameter conditions, which can yield a small heating coefficient, a large cooling coefficient, and thus a small final phonon number. Moreover, through the covariance matrix approach, results of numerical simulation are obtained, which are consistent with the theoretical expectations. It is demonstrated that our scheme can achieve ground state cooling in the highly unresolved sideband regime, within the current experimental technologies. Compared with the previous cooling methods, in our scheme, there are fewer constraints on the drive strength of atomic ensemble and number of atoms in the ensemble. In addition, the tolerable ranges of parameters for ground state cooling are extended. As a result, our scheme is very suitable for experiments and can be a guideline for the research of hybrid optomechanical cooling.

Optimized quantum random-walk search algorithm for multi-solution search

This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q. For a given q, we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value.