Structure and Dynamics Group

The simulation of a quantum search algorithm in an Ising spin chain is equivalent to solving a system of 2^L coupled first order differential equations with L being the number of qubits. The near-resonant approximation can be used to simplify the evolution of the states in the database. In this work, we compare the simulation of a quantum search algorithm using the exact evolution according to Schrödinger equation and using the near-resonant approximation. Our results show that the error of the near-resonant approximation is comparable to that of the exact evolution in terms of the fidelity measure. The advantage gained in having this small error at the near-resonant approximation is its faster execution time relative to the exact case.