Phase matching in grover's algorithm

When the Grover's algorithm is applied to search an unordered database, the probability of getting correct results usually decreases with the increase of marked items. The reason for this phenomenon is analyzed in this Letter, the Grover iteration is studied, and a new phase matching is proposed. With application of the new phase matching, when the fraction of marked items is greater than 1/3, the probability of getting correct results is greater than 25/27 with only one Grover iteration. The validity of the new phase matching is verified by a search example.