An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
arXiv:2309.14153 · doi:10.1007/s12652-020-02840-z
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.
arXiv comment15 pages, 8 figures. arXiv admin note: text overlap with arXiv:1908.07943 by other authors
References in corpus (18)
- Quantum secret sharing
- Quantum machine learning in feature Hilbert spaces
- Tight bounds on quantum searching
- Grover Algorithm with zero theoretical failure rate
- A Quantum Algorithm for Finding the Minimum
- Unconditionally verifiable blind computation
- Quantum Counting
- A different kind of quantum search
- Phase matching in quantum searching
- Grover's Quantum Search Algorithm for an Arbitrary Initial Amplitude Distribution
- Analysis of Generalized Grover's Quantum Search Algorithms Using Recursion Equations
- An Efficient and Secure Arbitrary N-Party Quantum Key Agreement Protocol Using Bell States
- Exactness of the Original Grover Search Algorithm
- A Novel Quantum Visual Secret Sharing Scheme
- Privacy-Preserving Quantum Two-Party Geometric Intersection
- Quantum Searchable Encryption for Cloud Data Based on Full-Blind Quantum Computation
- Quantum-Based Feature Selection for Multi-classification Problem in Complex Systems with Edge Computing
- A Quantum-based Database Query Scheme for Privacy Preservation in Cloud Environment