We show that the Farhi-Gutmann analog quantum search is a singular algorithm in the following sense:when the original driving Hamiltonian is perturbed slightly such that it is made of projections to the starting state...We show that the Farhi-Gutmann analog quantum search is a singular algorithm in the following sense:when the original driving Hamiltonian is perturbed slightly such that it is made of projections to the starting state and to the target state with different energies, the maximum fidelity (transition probability) between the searching state and thetarget state is strictly less than 1 over the entire evolution period, and the first time to achieve this maximum fidelity is of order √n/√1+cN, whose behavior depends crucially on whether c = 0 or not (here N is the total number of items, and the original Farhi-Gutmann case corresponds to c = 0). Moreover, when c ≠ 0 and N tends to infinity, the maximum fidelity tends to zero, and the first time to achieve the maximum fidelity tends to a positive constant! The condition for guaranteeing the algorithm's efficiency is determined explicitly.展开更多
文摘We show that the Farhi-Gutmann analog quantum search is a singular algorithm in the following sense:when the original driving Hamiltonian is perturbed slightly such that it is made of projections to the starting state and to the target state with different energies, the maximum fidelity (transition probability) between the searching state and thetarget state is strictly less than 1 over the entire evolution period, and the first time to achieve this maximum fidelity is of order √n/√1+cN, whose behavior depends crucially on whether c = 0 or not (here N is the total number of items, and the original Farhi-Gutmann case corresponds to c = 0). Moreover, when c ≠ 0 and N tends to infinity, the maximum fidelity tends to zero, and the first time to achieve the maximum fidelity tends to a positive constant! The condition for guaranteeing the algorithm's efficiency is determined explicitly.
