Abstract
The authors put forward an approach to the realization of nonadiabatic geometric quantum computation, by which a universal set of nonadiabatic geometric gates can be realized with any desired evolution paths. This approach makes it possible to realize geometric quantum computation with an economical evolution time, so that the influence of environment noises on the quantum gates can be minimized further
Highlights
Quantum computation is believed more effective than classical computation in solving some problems, such as factoring large integers [1] and searching unsorted data [2]
Since geometric phases are only dependent on the evolution path of a quantum system but independent of the evolution details, quantum gates based on geometric phases are robust against some control errors [4,5,6,7,8,9,10]
To realize nonadiabatic geometric quantum computation, it is necessary to ensure that the quantum system undergoes a cyclic evolution and the dynamical phases are removed from the total phases
Summary
Quantum computation is believed more effective than classical computation in solving some problems, such as factoring large integers [1] and searching unsorted data [2]. To realize nonadiabatic geometric quantum computation, it is necessary to ensure that the quantum system undergoes a cyclic evolution and the dynamical phases are removed from the total phases. To satisfy these requirements, the evolution paths in the previous works were mainly restricted to some special forms such as early multiple loops [17,33,34] and the widely used orange-slice-shaped loops [36,37,38,39,40,41,42]. Schemes and makes it possible to minimize the evolution time so the influence of environment noises on the quantum gates can be reduced
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
