Optimal phase change for a generalized Grover's algorithm

Abstract: We study the generalized Grover's algorithm with an arbitrary amplitude vector to find the optimal phase change for maximizing the gain in probability for the target of each iteration. In the classic setting of Grover's algorithm with a real initial amplitude vector, we find that a phase change of $\pi$ stays optimal until the probability of observing the target is quite close to 1. We provide a formula for identifying this cut-off point based on the size of the data set. When the amplitude is truly complex, we find that the optimal phase change depends non-trivially on the complexity of the amplitude vector. We provide an optimization formula to identify the required optimal phase change.