[2309.14153] An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Emerging Technologies

arXiv:2309.14153 (cs)
[Submitted on 25 Sep 2023]

Title:An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq

Authors:Wenjie Liu, Qingshan Wu, Jiahao Shen, Jiaojiao Zhao, Mohammed Zidan, Lian Tong
View PDF
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.
Comments: 15 pages, 8 figures. arXiv admin note: text overlap with arXiv:1908.07943 by other authors
Subjects: Emerging Technologies (cs.ET); Data Structures and Algorithms (cs.DS); Quantum Physics (quant-ph)
Cite as: arXiv:2309.14153 [cs.ET]
  (or arXiv:2309.14153v1 [cs.ET] for this version)
  https://doi.org/10.48550/arXiv.2309.14153
Journal reference: Journal of Ambient Intelligence and Humanized Computing,2021.12(11): p.10425-10434
Related DOI: https://doi.org/10.1007/s12652-020-02840-z

Submission history

From: Wen-Jie Liu [view email]
[v1] Mon, 25 Sep 2023 14:07:27 UTC (640 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.ET
< prev   |   next >
new | recent | 2023-09
Change to browse by:
cs
cs.DS
quant-ph

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)