Simulation of Grover’s algorithm with position-variation of the ancilla qubit

<div>We simulate Grover’s quantum search algorithm in an Ising spin chain quantum computer with nearest and second-nearest neighbor interactions. We determine the optimum Rabi frequency that satisfies the 2πk method by selecting a high fidelity value in the frequency scan for each database size. Also, we vary the position of the ancilla qubit and investigate the effect on the fidelity for different sizes of the database. The behavior of the fidelity as a function of the number of Grover iterations during the algorithm is considered.