ﻻ يوجد ملخص باللغة العربية
In this paper, we propose a scheme for implementing the nonadiabatic holonomic quantum computation (NHQC+) of two Rydberg atoms by using invariant-based reverse engineering (IBRE). The scheme is based on Forster resonance induced by strong dipole-dipole interaction between two Rydberg atoms, which provides a selective coupling mechanism to simply the dynamics of system. Moreover, for improving the fidelity of the scheme, the optimal control method is introduced to enhance the gate robustness against systematic errors. Numerical simulations show the scheme is robust against the random noise in control fields, the deviation of dipole-dipole interaction, the Forster defect, and the spontaneous emission of atoms. Therefore, the scheme may provide some useful perspectives for the realization of quantum computation with Rydberg atoms.
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors as well as high-speed realization. Several schemes of its implementation have been put forward based on various physical systems
The main obstacles to the realization of high-fidelity quantum gates are the control errors arising from inaccurate manipulation of a quantum system and the decoherence caused by the interaction between the quantum system and its environment. Nonadia
Nonadiabatic holonomic quantum computation (NHQC) provides a method to implement error resilient gates and that has attracted considerable attention recently. Since it was proposed, three-level {Lambda} systems have become the typical building block
The main challenges in achieving high-fidelity quantum gates are to reduce the influence of control errors caused by imperfect Hamiltonians and the influence of decoherence caused by environment noise. To overcome control errors, a promising proposal
We explain how to combine holonomic quantum computation (HQC) with fault tolerant quantum error correction. This establishes the scalability of HQC, putting it on equal footing with other models of computation, while retaining the inherent robustness the method derives from its geometric nature.