We develop an approach to solving numerically the time-dependent Schrodinger equation when it includes source terms and time-dependent potentials. The approach is based on the generalized Crank-Nicolson method supplemented with an Euler-MacLaurin exp
ansion for the time-integrated nonhomogeneous term. By comparing the numerical results with exact solutions of analytically solvable models, we find that the method leads to precision comparable to that of the generalized Crank-Nicolson method applied to homogeneous equations. Furthermore, the systematic increase in precision generally permits making estimates of the error.
Phase matching has been studied for the Grover algorithm as a way of enhancing the efficiency of the quantum search. Recently Li and Li found that a particular form of phase matching yields, with a single Grover operation, a success probability great
er than 25/27 for finding the equal-amplitude superposition of marked states when the fraction of the marked states stored in a database state is greater than 1/3. Although this single operation eliminates the oscillations of the success probability that occur with multiple Grover operations, the latter oscillations reappear with multiple iterations of Li and Lis phase matching. In this paper we introduce a multi-phase matching subject to a certain matching rule by which we can obtain a multiple Grover operation that with only a few iterations yields a success probability that is almost constant and unity over a wide range of the fraction of marked items. As an example we show that a multi-phase operation with six iterations yields a success probability between 99.8% and 100% for a fraction of marked states of 1/10 or larger.
