The optimization of exact multi-target quantum search algorithm based on MindSpore
Shijin Zhong, Wei Li, Guangzhen Dai, Daohua Wu

TL;DR
This paper presents an optimized exact multi-target quantum search algorithm based on a modified Grover's algorithm, achieving 100% success rate with fewer gates and shallower circuits, implemented on the MindSpore framework.
Contribution
It introduces a more efficient diffusion operator for multi-target search, significantly reducing gate count and circuit depth while maintaining perfect success probability.
Findings
Reduces quantum gate count by at least 21.1%.
Lowers circuit depth by at least 11.4%.
Achieves 100% success probability in multi-target searches.
Abstract
Grover's search algorithm has attracted great attention due to its quadratic speedup over classical algorithms in unsorted database search problems. However, Grover's algorithm is inefficient in multi-target search problems, except in the case of 1/4 of the data in the database satisfying the search conditions. Long presented a modified version of Grover's search algorithm by introducing a phase-matching condition that can search for the target state with a zero theoretical failure rate. In this work, we present an optimized exact multi-target search algorithm based on the modified Grover's algorithm by transforming the canonical diffusion operator to a more efficient diffusion operator, which can solve the multi-target search problem with a 100% success rate while requiring fewer gate counts and shallower circuit depth. After that, the optimized multi-target algorithm for four…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Decision-Making Techniques
