An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
Abstract
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.
Cite
@article{arxiv.2309.14153,
title = {An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq},
author = {Wenjie Liu and Qingshan Wu and Jiahao Shen and Jiaojiao Zhao and Mohammed Zidan and Lian Tong},
journal= {arXiv preprint arXiv:2309.14153},
year = {2024}
}
Comments
15 pages, 8 figures. arXiv admin note: text overlap with arXiv:1908.07943 by other authors