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
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
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 is nonadiabatic holonomic quantum computation, which has attracted much attention in both theories and experiments. While the merit of holonomic operations resisting control errors has been well exploited, an important issue following is how to shorten the evolution time needed for realizing a holonomic gate so as to avoid the influence of environment noise as much as possible. In this paper, we put forward a general approach of constructing Hamiltonians for nonadiabatic holonomic quantum computation, which makes it possible to minimize the evolution time and might open a new horizon for the realistic implementation of nonadiabatic holonomic quantum computation.
Nonadiabatic holonomic quantum computation uses non-Abelian geometric phases to implement a universal set of quantum gates that are robust against control imperfections and decoherence. Until now, a number of three-level-based schemes of nonadiabatic holonomic computation have been put forward, and several of them have been experimentally realized. However, all these works are based on the same class of nonadiabatic paths, which originates from the first nonadiabatic holonomic proposal. Here, we propose a universal set of nonadiabatic holonomic gates based on an extended class of nonadiabatic paths. We find that nonadiabatic holonomic gates can be realized with paths shorter than the known ones, which provides the possibility of realizing nonadiabatic holonomic gates with less exposure to decoherence. Furthermore, inspired by the form of this type of paths, we find a way to eliminate decoherence from nonadiabatic holonomic gates without resorting to redundancies.
Dynamical decoupling provides an effective method to protect nonadiabatic geometric quantum computation against environment-induced decoherence. Although some dynamical-decoupling-protected nonadiabatic geometric gates were proposed, they need to combine some other dynamical gates to perform universal quantum computation. In this paper we propose a scheme to realize a universal set of dynamical-decoupling-protected nonadiabatic geometric gates, which not only possesses the resilience to environment-induced decoherence but also allows us to perform universal quantum computation all by geometric operations.
In this paper, a flexible and effective scheme is proposed to realize nonadiabatic geometric quantum gates with the invariant based reverse engineering and the nonadiabatic holonomic quantum computation (NHQC+) presented in recent work [B.-J. Liu et al., Phys. Rev. Lett. 123, 100501 (2019)] for extensible geometric quantum computation. The scheme provides variabilities for most of control parameters, and can build up multiple evolution paths with different geometric phases acquired in a cycling evolution. As the computational basis can be covered by the evolution paths, the realization of the nonadiabatic geometric quantum computation is possible without auxiliary levels. Moreover, multiple types of nonadiabatic geometric quantum gates can also be easily constructed by only adjusting boundary conditions of control parameters with the method. To show the applications of the scheme, we discuss the implementations of nonadiabatic geometric quantum gates of spin qubits in a double-quantum-dot system with numerical simulations. The results indicate that the scheme possesses robustness against the errors and noise. Therefore, the scheme may offer some interesting perspectives for the realization of the nonadiabatic geometric quantum computation.
Quantum computation has been shown to be superior to classical computation in solving some problems, and therefore can substantially change our life. However, the realization of quantum computation is still challenging, even if quantum technologies have been improved significantly. Two main obstacles to the realization of practical quantum computation are control errors and decoherence. Control errors are caused by inaccurate manipulations of quantum systems and decoherence is caused by the inevitable interaction between the system and its environment. Geometric phases are only dependent on evolution paths of quantum systems but independent of the evolution details and therefore quantum computation based on geometric phases, i.e., geometric quantum computation, is robust against control errors, benefiting the realization of practical quantum computation. The early proposals of geometric quantum computation are based on adiabatic geometric phases. These proposals require quantum systems to undergo adiabatic evolution, which makes quantum systems evolve for a long time. To circumvent this, nonadiabatic geometric quantum computation based on nonadiabatic Abelian geometric phases was proposed soon after. In 2012, nonadiabatic holonomic quantum computation based on nonadiabatic non-Abelian geometric phases was proposed, which also circumvents long-time evolutions. Moreover, compared with nonadiabatic geometric quantum computation that uses the geometric phase as one parameter of a quantum gate, nonadiabatic holonomic quantum computation uses the holonomic matrix itself as a quantum gate. This makes nonadiabatic holonomic quantum computation possess whole-geometric property. Due to the merits of both geometric robustness and high-speed implementation without the limit of adiabatic evolution, nonadiabatic holonomic quantum computation has been attracting much attention. Until now, much progress has been achieved in the field of nonadiabatic holonomic quantum computation. On one hand, various methods have been proposed to design more efficient nonadiabatic holonomic gates. Nonadiabatic holonomic gates were first realized by using resonant laser fields to drive a three-level system. After this, the single-shot proposal and the single-loop proposal were proposed, allowing us to realize one-qubit gates by a shorter path and thereby reducing the exposure time of nonadiabatic holonomic gates to the environment. To further shorten the exposure time, the path-shortening protocol was put forward, where nonadiabatic holonomic gates can be realized based on a class of extended evolution paths that are shorter than the former ones. Recently, a general approach of constructing Hamiltonians for nonadiabatic holonomic quantum computation was put forward, by using which one can easily find a Hamiltonian making the quantum system evolve along a desired path so that nonadiabatic holonomic gates can be realized with an economical evolution time. On the other hand, various methods have been proposed to combine nonadiabatic holonomic gates and various decoherence-resilient methods, making the resulting schemes robust against both control errors and decoherence. The first proposal in this aspect is combining nonadiabatic holonomic gates and decoherence-free subspaces. Gradually, proposals combining nonadiabatic holonomic gates with noiseless subsystems, dynamical decoupling and surface codes were put forward. Last but not least, various proposals suitable for specific physical systems have been proposed and particularly various experimental platforms have been used to demonstrate nonadiabatic holonomic gates. This also significantly improves the development of nonadiabatic holonomic quantum computation. In this paper, we review the above research advances on nonadiabatic holonomic quantum computation, aiming to help readers understand the main developments of nonadiabatic holonomic quantum computation.
Abstract Quantum computation based on nonadiabatic geometric phases has attracted a broad range of interests, due to its fast manipulation and inherent noise resistance. However, it is limited to some special evolution paths, and the gate-times are typically longer than conventional dynamical gates, resulting in weakening of robustness and more infidelities of the implemented geometric gates. Here, we propose a path-optimized scheme for geometric quantum computation (GQC) on superconducting transmon qubits, where high-fidelity and robust universal nonadiabatic geometric gates can be implemented, based on conventional experimental setups. Specifically, we find that, by selecting appropriate evolution paths, the constructed geometric gates can be superior to their corresponding dynamical ones under different local errors. Numerical simulations show that the fidelities for single-qubit geometric phase, π /8 and Hadamard gates can be obtained as 99.93%, 99.95% and 99.95%, respectively. Remarkably, the fidelity for two-qubit control-phase gate can be as high as 99.87%. Therefore, our scheme provides a new perspective for GQC, making it more promising in the application of large-scale fault-tolerant quantum computation.