DOI码：10.1007/s12652-020-02840-z
所属单位：软件学院
论文名称：An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
发表刊物：Journal of Ambient Intelligence and Humanized Computing
摘要：Finding a minimum is an essential part of mathematical models, and it plays an important role in some optimization problems. Durr and Hoyer proposed a quantum searching algorithm (DHA), with a certain probability of success, to achieve quadratic speed than classical ones. In this paper, we propose an optimized quantum minimum searching algorithm with sure-success probability, which utilizes Grover-Long searching to implement the optimal exact searching, and the dynamic strategy to reduce the iterations of our algorithm. Besides, we optimize the oracle circuit to reduce the number of gates by the simplified rules. The performance evaluation including the theoretical success rate and computational complexity shows that our algorithm has higher accuracy and efficiency than DHA algorithm. Finally, a simulation experiment based on Cirq is performed to verify its feasibility.
论文类型：期刊论文
文献类型：J
卷号：12
期号：11
页面范围：10425-10434
是否译文：否
发表时间：2021-01-19
收录刊物：SCI