An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914792367718400 |
|---|---|
| author | Liu, Wenjie Wu, Qingshan Shen, Jiahao Zhao, Jiaojiao Zidan, Mohammed Tong, Lian |
| author_facet | Liu, Wenjie Wu, Qingshan Shen, Jiahao Zhao, Jiaojiao Zidan, Mohammed Tong, Lian |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_14153 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq Liu, Wenjie Wu, Qingshan Shen, Jiahao Zhao, Jiaojiao Zidan, Mohammed Tong, Lian Emerging Technologies Data Structures and Algorithms Quantum Physics 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. |
| title | An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq |
| topic | Emerging Technologies Data Structures and Algorithms Quantum Physics |
| url | https://arxiv.org/abs/2309.14153 |