Simulation of Grover's algorithm with spatially-dependent coupling constant


We simulate Grover's algorithm in an Ising spin chain quantum computer with spatially-dependent coupling constant. The simulation shows that the tendency of two distinct states to transition from the same initial state is reduced. The fidelity with the ideal result and the probability of finding the target state are also investigated.