Abstract Quantum gates can be implemented adiabatically and nonadiabatically. Many schemes used at least two sequentially implemented gates to obtain an arbitrary one-qubit gate. Recently, it has been shown that nonadiabatic gates can be realized by single-shot implementation. It has also been shown that quantum gates can be implemented with controlled adiabatic evolutions. In this paper, we combine the advantage of single-shot implementation with controlled adiabatic evolutions to obtain controlled nonadiabatic evolutions. We also investigate the robustness to different types of errors. We find that the fidelity is close to unity for realistic decoherence rates.
Abstract Quantum gates can be implemented adiabatically and nonadiabatically. Many schemes used at least two sequentially implemented gates to obtain an arbitrary one-qubit gate. Recently, it has been shown that nonadiabatic gates can be realized by single-shot implementation. It has also been shown that quantum gates can be implemented with controlled adiabatic evolutions. In this paper, we combine the advantage of single-shot implementation with controlled adiabatic evolutions to obtain controlled nonadiabatic evolutions. We also investigate the robustness to different types of errors. We find that the fidelity is close to unity for realistic decoherence rates.
Quantum gates are the basic building blocks in the quantum circuits model. These gates can be implemented using adiabatic or non adiabatic processes. Adiabatic models can be controlled using auxiliary qubits, whereas non adiabatic models can be simplified by using one single-shot implementation. In this paper, the controlled adiabatic evolutions is combined with the single-shot implementation to obtain quantum gates with controlled non adiabatic evolutions. This is an important improvement which can speed the implementation of quantum gates and reduce the errors due to the long run in the adiabatic model. The robustness of our scheme to different types of errors is also investigated.
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors. However, all the previous schemes have to use at least two sequentially implemented gates to realize a general one-qubit gate. In this paper we put forward a scheme by which one can directly realize an arbitrary holonomic one-qubit gate with a single-shot implementation, avoiding the extra work of combining two gates into one. Based on a three-level model driven by laser pulses, we show that any single-qubit holonomic gate can be realized by varying the detuning, amplitude, and phase of lasers. Our scheme is compatible with previously proposed nonadiabatic holonomic two-qubit gates, combining with which the arbitrary holonomic one-qubit gates can play universal nonadiabatic holonomic quantum computation. We also investigate the effects of some unavoidable realistic errors on our scheme.
Nonadiabatic holonomic quantum computation in decoherence-free subspaces has attracted increasing attention recently, as it allows for high-speed implementation and combines both the robustness of holonomic gates and the coherence stabilization of decoherence-free subspaces. Since the first protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, a number of schemes for its physical implementation have been put forward. However, all previous schemes require two noncommuting gates to realize an arbitrary one-qubit gate, which doubles the exposure time of gates to error sources as well as the resource expenditure. In this paper, we propose an alternative protocol for nonadiabatic holonomic quantum computation in decoherence-free subspaces, in which an arbitrary one-qubit gate in decoherence-free subspaces is realized by a single-shot implementation. The present protocol not only maintains the merits of the original protocol but also avoids the extra work of combining two gates to implement an arbitrary one-qubit gate and thereby reduces the exposure time to various error sources.
Nonadiabatic holonomic gates provide a promising way to realize high-fidelity quantum gates because of their robustness and high-speed implementation. Compared with quantum computation that consists of many nonadiabatic holonomic one-qubit and two-qubit gates, the nonadiabatic holonomic multiqubit gate, which can reduce the number of quantum gates, is more efficient to construct simpler and faster complicated quantum computation. We propose the simplest scheme to realize nonadiabatic holonomic three-qubit controlled gates. On the one hand, the parameters we set to realize the three-qubit controlled gates are all time independent, which makes it easy to control and operate the quantum systems. On the other hand, our scheme avoids the combination of the elementary gates and realizes the three-qubit controlled gates only by one-shot implementation.
We show how one can perform arbitrary rotation of any qubit, using delayed laser pulses through nonadiabatic evolution, i.e., via transitions among the adiabatic states. We use a double-Lambda scheme and use a set of control parameters such as detuning, ratio of pulse amplitudes, time-separation of two pulses for realizing different rotations of the qubit. We also investigate the effect of different kinds of chirping, namely linear chirping and hyperbolic tangent chirping. Our work using nonadiabatic evolution adds to the flexibility in the implementation of logic gate operations and show how to achieve control of quantum systems by using different types of pulses.
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.