Robust three-qubit search algorithm in Rydberg atoms via geometric control

Abstract

Rydberg atoms possess long coherence time and inherent scalability, which makes it promising to implement quantum algorithms. An exact and robust quantum search algorithm (SA) is essential to some practical applications. Here we propose a multisolution three-qubit SA by employing quantum circuit and geometric operations, in which the target states can be successfully searched with the fidelity of at least 99.8$%$ and the geometric operators guarantee robustness against systematic errors. In particular, the geometric three-qubit gate operators employed reduce the implementation time and help to resist against the detrimental influence of decoherence. Moreover, our scheme can be straightforwardly extended to multiqubit cases. We have carried out numerical simulations based on the master equation to illustrate the superiority of our scheme. We consider that our study provides an alternative method for executing quantum SAs with high success probability.