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 ($\mathrm{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.
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.
The challenge in building high-fidelity quantum gates lies in overcoming control errors and decoherence effects caused by the coupling between the quantum system and the external environment. Nonadiabatic holonomic quantum computation uses the topological protection of the cyclic evolution of the computational subspace to make holonomic gates highly robust to control errors. Therefore, our main goal is to accelerate this evolution. Here we propose a general reverse engineering approach to combine the unconventional geometric quantum computation with optimized holonomic quantum computation [Bao-Jie Liu et al. Phys.Rev.Lett.123,100501 (2019)]. Our approach allows us to select evolution paths that require less time. Consequently, the proposed scheme is highly flexible and promising for achieving robust quantum computation in the future.
Nonadiabatic holonomic quantum computation (NHQC) has been developed to shorten the construction times of geometric quantum gates. However, previous NHQC gates require the driving Hamiltonian to satisfy a set of rather restrictive conditions, reducing the robustness of the resulting geometric gates against control errors. Here we show that nonadiabatic geometric gates can be constructed in an extensible way, called NHQC+, for maintaining both flexibility and robustness against certain types of noises. Consequently, this approach makes it possible to incorporate most of the existing optimal control methods, such as dynamical decoupling, composite pulses, and a shortcut to adiabaticity, into the construction of single-looped geometric gates. Furthermore, this extensible approach of geometric quantum computation can be applied to various physical platforms such as superconducting qubits and nitrogen-vacancy centers. Specifically, we performed numerical simulation to show how the noise robustness in recent experimental implementations [Phys. Rev. Lett. 119, 140503 (2017)PRLTAO0031-900710.1103/PhysRevLett.119.140503; Nat. Photonics 11, 309 (2017)NPAHBY1749-488510.1038/nphoton.2017.40] can be significantly improved by our NHQC+.approach. These results cover a large class of new techniques combing the noise robustness of both geometric phase and optimal control theory.
Nonadiabatic holonomic quantum computation (NHQC) is implemented by fast evolution processes in a geometric way to withstand local noises. However, recent works of implementing NHQC are sensitive to the systematic noise and error. Here, we present a path-optimized NHQC (PONHQC) scheme based on the non-Abelian geometric phase, and find that a geometric gate can be constructed by different evolution paths, which have different responses to systematic noises. Due to the flexibility of the PONHQC scheme, we can choose an optimized path that can lead to excellent gate performance. Numerical simulation shows that our optimized scheme can greatly outperform the conventional NHQC scheme, in terms of both fidelity and robustness of the gates. In addition, we propose to implement our strategy on superconducting quantum circuits with decoherence-free subspace encoding with the experiment-friendly two-body exchange interaction. Therefore, we present a flexible NHQC scheme that is promising for the future robust 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.
Nonadiabatic holonomic quantum computation (NHQC) based on non-Abelian geometric phases can possess potential robustness advantages due to its intrinsic error-resilient features. However, rigorous geometric conditions, including cyclic evolution and parallel transport conditions, typically demand complex and error-prone control and also involve additional auxiliary resources. Moreover, the limitations of optional evolution paths in previous NHQC schemes make it difficult to avoid path segments that are heavily affected by systematic errors, thereby weakening the error resilience of holonomic gates. To address this problem, we propose a multipath NHQC scheme, which can sufficiently improve the robustness of quantum gates by flexibly correcting geometric evolution paths. Numerical simulation results show that our scheme surpasses previous NHQC schemes in suppressing systematic errors for arbitrary gate types. In addition, we provide a physical implementation based on superconducting quantum circuits, with the decoherence-free-subspace encoding and an experiment-friendly two-body exchange interaction, demonstrating the excellent compatibility of our scheme. Therefore, our scheme offers a promising alternative for future fault-tolerant quantum computation.
Nonadiabatic geometric quantum computation (NGQC) and nonadiabatic holonomic quantum computation (NHQC) have been proposed to reduce the run time of geometric quantum gates.However, in terms of robustness against experimental control errors, the existing NGQC and NHQC scenarios have no advantage over standard dynamical gates in most cases.Here, we give the reasons why nonadiabatic geometric gates are sensitive to the control errors and, further, we propose a scheme of super-robust nonadiabatic geometric quantum control, in which the super-robust condition can guarantee both high speed and robustness of the geometric gate.To illustrate the working mechanism of super-robust geometric quantum gates, we give two simple examples of SR-NGQC and SR-NHQC for two-and three-level quantum systems, respectively.Theoretical and numerical results with the experimental parameters indicate that our scheme can significantly improve the gate performance compared to the previous NGQC, NHQC, and standard dynamical schemes.Super-robust geometric quantum computation can be applied to various physical platforms such as superconducting qubits, quantum dots, and trapped ions.All of these sufficiently show that our scheme provides a promising way towards robust geometric quantum computation.