.png){kind=icon}
.png){kind=icon}
Return
A general quantum minimum searching algorithm with high success rate and its implementation
.png){kind=icon}
PRE
AI
DOI：10.1007/s11433-022-2060-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Finding a minimum is a fundamental calculation in many quantum algorithms. However, challenges are faced in demonstrating it effectively in real quantum computers. In practice, the number of solutions is unknown, and there is no universal encoding method. Besides that, current quantum computers have limited resources. To alleviate these problems, this paper proposes a general quantum minimum searching algorithm. An adaptive estimation method is adopted to calculate the number of solutions, and a quantum encoding circuit for arbitrary databases is presented for the first time, which improves the universality of the algorithm and helps it achieve a nearly 100% success rate in a series of random databases. Moreover, gate complexity is reduced by our simplified Oracle, and the realizability of the algorithm is verified on a superconducting quantum computer. Our algorithm can serve as a subroutine for various quantum algorithms to promote their implementation in the Noisy Intermediate-Scale Quantum era. k]quantum minimum searching algorithm k]quantum circuit k]superconducting quantum computer k]quantum encoding
Keywords:
03
65
-w
67
-a
Lx
07
05
-t
Journal
S
IF:
7.5
Papers:
3.9K
Citations:
7.4K