.png){kind=icon}
.png){kind=icon}
Return
Near-Deterministic Quantum Search Algorithm Without Phase Design
.png){kind=icon}
PRE
AI
DOI：10.1002/qute.202400557.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Grover's algorithm solves the unstructured search problem. Grover's algorithm can find the target state with certainty only if searching one out of four. Designing the deterministic search algorithm can avoid any repetition of the algorithm, especially when Grover's algorithm is a subroutine in other algorithms. Grover's algorithm can be deterministic if the phase of the oracle or the diffusion operator is delicately designed. The precision of the phases could be a problem. A near-deterministic quantum search algorithm without the phase design is proposed. The algorithm has the same oracle and diffusion operators as Grover's algorithm. One additional component is the rescaled diffusion operator. It acts partially on the database. The success probability of Grover's algorithm is improved by the partial diffusion operator in two different ways. The possible cost is one or two more queries to the oracle. The deterministic search algorithm is also designed when searching one out of eight, sixteen, and thirty-two.
Keywords:
quantum search algorithm
quantum partial search algorithm
quantum deterministic search algorithm
Journal
A
IF:
4.3
Papers:
449
Citations:
3.2K
View more organizations