Geometric phases accompanying adiabatic quantum evolutions can be used to construct robust quantum control for quantum information processing due to their noise-resilient feature. A significant development along this line is to construct geometric gates using nonadiabatic quantum evolutions to reduce errors due to decoherence. However, it has been shown that nonadiabatic geometric gates are not necessarily more robust than dynamical ones, in contrast to an intuitive expectation. Here we experimentally investigate this issue for the case of nonadiabatic holonomic quantum computation (NHQC) and show that conventional NHQC schemes cannot guarantee the expected robustness due to a cross-coupling to the states outside the computational space. We implement a different set of constraints for gate construction in order to suppress such cross-coupling to achieve an enhanced robustness. Using a superconducting quantum circuit, we demonstrate high-fidelity holonomic gates whose infidelity against quasistatic transverse errors can be suppressed up to the fourth order, instead of the second order in conventional NHQC and dynamical gates. In addition, we explicitly measure the accumulated dynamical phase due to the abovementioned cross-coupling and verify that it is indeed much reduced in our NHQC scheme. We further demonstrate a protocol for constructing two-qubit NHQC gates also with an enhanced robustness.
Geometric phases accompanying adiabatic quantum evolutions can be used to construct robust quantum control for quantum information processing due to their noise-resilient feature. A significant development along this line is to construct geometric gates using nonadiabatic quantum evolutions to reduce errors due to decoherence. However, it has been shown that nonadiabatic geometric gates are not necessarily more robust than dynamical ones, in contrast to an intuitive expectation. Here we experimentally investigate this issue for the case of nonadiabatic holonomic quantum computation (NHQC) and show that conventional NHQC schemes cannot guarantee the expected robustness due to a cross-coupling to the states outside the computational space. We implement a different set of constraints for gate construction in order to suppress such cross-coupling to achieve an enhanced robustness. Using a superconducting quantum circuit, we demonstrate high-fidelity holonomic gates whose infidelity against quasistatic transverse errors can be suppressed up to the fourth order, instead of the second order in conventional NHQC and dynamical gates. In addition, we explicitly measure the accumulated dynamical phase due to the abovementioned cross-coupling and verify that it is indeed much reduced in our NHQC scheme. We further demonstrate a protocol for constructing two-qubit NHQC gates also with an enhanced robustness.
Geometric phases accompanying adiabatic quantum evolutions can be used to construct robust quantum control for quantum information processing due to their noise-resilient feature. A significant development along this line is to construct geometric gates using nonadiabatic quantum evolutions to reduce errors due to decoherence. However, it has been shown that nonadiabatic geometric gates are not necessarily more robust than dynamical ones, in contrast to an intuitive expectation. Here we experimentally investigate this issue for the case of nonadiabatic holonomic quantum computation~(NHQC) and show that conventional NHQC schemes cannot guarantee the expected robustness due to a cross coupling to the states outside the computational space. We implement a new set of constraints for gate construction in order to suppress such cross coupling to achieve an enhanced robustness. Using a superconducting quantum circuit, we demonstrate high-fidelity holonomic gates whose infidelity against quasi-static transverse errors can be suppressed up to the fourth order, instead of the second order in conventional NHQC and dynamical gates. In addition, we explicitly measure the accumulated dynamical phase due to the above mentioned cross coupling and verify that it is indeed much reduced in our NHQC scheme. We further demonstrate a protocol for constructing two-qubit NHQC gates also with an enhanced robustness.
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.
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.
Nonadiabatic holonomic quantum computation (NHQC) provides an essential way to construct robust and high-fidelity quantum gates due to its geometric features. However, NHQC is more sensitive to decay and dephasing errors than a conventional dynamical gate since it requires an ancillary intermediate state. Here, we utilize the Hamiltonian reverse engineering technique to study the influence of intermediate-state decoherence on NHQC gate fidelity, and propose schemes to construct an arbitrary single-qubit holonomic gate and nontrivial two-qubit holonomic gate with high fidelity and robustness to the decoherence. Although the proposed method is generic and can be applied to many experimental platforms, such as superconducting qubits, trapped ions, and quantum dots, here we take a nitrogen-vacancy center as an example to show that the gate fidelity can be significantly enhanced from 89% to 99.6% in contrast to recent experimental NHQC schemes [Phys. Rev. Lett. 119, 140503 (2017); Nat. Photonics 11, 309 (2017); Opt. Lett. 43, 2380 (2018)], and the robustness against decoherence can also be significantly improved. All in all, our scheme provides a promising way for fault-tolerant geometric quantum computation.