The realistic application of geometric quantum computation is crucially dependent on an unproved robustness conjecture, claiming that geometric quantum gates are more resilient against random noise than dynamic gates. We propose a suitable model that allows a direct and fair comparison between geometrical and dynamical operations. In the presence of stochastic control errors we find that the maximum of gate fidelity corresponds to quantum gates with a vanishing dynamical phase. This is a clear evidence for the robustness of nonadiabatic geometric quantum computation. The predictions here presented can be experimentally tested in almost all of the already existing quantum computer candidates.
The realistic application of geometric quantum computation is crucially dependent on an unproved robustness conjecture, claiming that geometric quantum gates are more resilient against random noise than dynamic gates. We propose a suitable model that allows a direct and fair comparison between geometrical and dynamical operations. In the presence of stochastic control errors we find that the maximum of gate fidelity corresponds to quantum gates with a vanishing dynamical phase. This is a clear evidence for the robustness of nonadiabatic geometric quantum computation. The predictions here presented can be experimentally tested in almost all of the already existing quantum computer candidates.
Geometric quantum gates are conjectured to be more resilient than dynamical gates against certain types of error, which makes them ideal for robust quantum computing. However, there are conflicting claims within the literature about the validity of that robustness conjecture. Here we use dynamical invariant theory in conjunction with filter functions in order to analytically characterize the noise sensitivity of an arbitrary quantum gate. Under certain conditions, we find that there exists a transformation of the Hamiltonian that leaves invariant the final gate and noise sensitivity (as characterized by the filter function) while changing the phase from geometric to dynamical. Our result holds for a Hilbert space of arbitrary dimensions, but we illustrate our result by examining experimentally relevant single-qubit scenarios and providing explicit constructions of such a transformation.
The geometric phase stands as a foundational concept in quantum physics, revealing deep connections between geometric structures and quantum dynamical evolution. Unlike dynamical phases, geometric phases exhibit intrinsic resilience to certain types of perturbation, making them particularly valuable for quantum information processing, where maintaining coherent quantum operations is essential. This article provides a review of geometric phases in the context of universal quantum gate construction, i.e., the geometric quantum computation (GQC), with special attention to recent progress in nonadiabatic implementations that enhance gate fidelity and/or operational robustness. We first review a unified theoretical framework that can encompass all existing nonadiabatic GQC approaches, then systematically examine the design principles of nonadiabatic geometric gates with a particular focus on how optimal control techniques can be leveraged to improve the accuracy and noise resistance. In addition, we conducted detailed numerical comparisons of various nonadiabatic GQC protocols, offering a quantitative assessment of their respective performance characteristics and practical limitations. Through this focused investigation, our aim is to provide researchers with both fundamental insights and practical guidance for advancing geometric approaches in quantum computing.
Besides the intrinsic noise resilience property, nonadiabatic geometric phases are of the fast evolution nature, and thus can naturally be used in constructing quantum gates with excellent performance, i.e., the so-called nonadiabatic geometric quantum computation (NGQC). However, previous single-loop NGQC schemes are sensitive to the operational control error, i.e., the X error, due to the limitations of the implementation. Here, we propose a robust scheme for NGQC combining with the dynamical correction technique, which still uses only simplified pulses, and thus being experimental friendly. We numerically show that our scheme can greatly improve the gate robustness in previous protocols, retaining the intrinsic merit of geometric phases. Furthermore, to fight against the dephasing noise, due to the Z error, we can incorporate the decoherence-free subspace encoding strategy. In this way, our scheme can be robust against both types of errors. Finally, we also propose how to implement the scheme with encoding on superconducting quantum circuits with experimentally demonstrated technology. Therefore, due to the intrinsic robustness, our scheme provides a promising alternation for the future scalable fault-tolerant quantum computation.
Geometric phase is a promising element to induce high-fidelity and robust quantum operations due to its built-in noise-resilience feature. Unfortunately, its practical applications are usually circumscribed by requiring complex interactions among multiple levels or qubits and a longer gate time than the corresponding dynamical ones. Here, we propose a general framework of geometric quantum computation with the integration of the time-optimal control technique, where the shortest smooth geometric path is found to realize accelerated geometric quantum gates and thus greatly decreases the gate errors induced by both the decoherence effect and operational imperfections. Meanwhile, we faithfully implement our idea on a scalable platform of a two-dimensional superconducting transmon-qubit lattice, with simple and experimentally accessible interactions. In addition, numerical simulations show that our implemented geometric gates possess higher fidelities and stronger robustness, which outperform the best performance of the corresponding dynamical ones. Therefore, our scheme provides a promising alternative route toward scalable fault-tolerant solid-state quantum computation.
Using geometric phases to realize noise-resilient quantum computing is an important method to enhance the control fidelity. In this work, we experimentally realize a universal nonadiabatic geometric quantum gate set in a superconducting qubit chain. We characterize the realized single- and two-qubit geometric gates with both quantum process tomography and randomized benchmarking methods. The measured average fidelities for the single-qubit rotation gates and two-qubit controlled-Z gate are 0.9977(1) and 0.977(9), respectively. Besides, we also experimentally demonstrate the noise-resilient feature of the realized single-qubit geometric gates by comparing their performance with the conventional dynamical gates with different types of errors in the control field. Thus, our experiment proves a way to achieve high-fidelity geometric quantum gates for robust quantum computation.
Quantum gates based on geometric phases possess intrinsic noise-resilience features and attract much attention. However, the implementations of previous geometric quantum computation typically require a long pulse time of gates. As a result, their experimental control inevitably suffers from the cumulative disturbances of systematic errors due to excessive time consumption. Here, we experimentally implement noncyclic and nonadiabatic geometric quantum gates in a superconducting circuit, significantly shortening the gate time. Moreover, we experimentally verify that our universal single-qubit geometric gates are more robust to both the Rabi frequency and the qubit frequency shift-induced error, compared with the conventional dynamical gates, using the randomized benchmarking method. This scheme can also be utilized to construct two-qubit geometric operations while the generation of maximally entangled Bell states is demonstrated. Therefore, our results provide a promising routine to achieve fast, high-fidelity, and error-resilient quantum gates in superconducting quantum circuits.