We consider the simulation of Grover{\textquoteright}s algorithm in an Ising nuclear spin chain computer with first- and second-nearest neighbor interaction. We calculate the fidelity, a measure of the accuracy of the state, as a function of π/2- and π-pulses and investigate the precision of the success probability of the target state. The fidelity is constrained by the set working precision of the computer system, hence we simulate the algorithm using different working precisions. A reduction of precision is also observed as you increase the number of iterations that restricts the size of the database to effectively simulate the algorithm. The amount of decrease is dependent on the decomposition of pulses.

},
author = {Neris D Ilano and Cristine Villagonzalo and Ronald S. Banzon}
}