One of the key features required to realize fault-tolerant quantum computation is the robustness of quantum gates against errors. Since geometric quantum gate is naturally insensitivity to noise, it appears to be a promising routine to achieve high-fidelity, robust quantum gates. The implementation of geometric quantum gate however faces some troubles such as its complex interaction among multiple energy levels. Moreover, traditional geometric schemes usually take more time than equivalent dynamical ones. Here, we experimentally demonstrate a geometric gate scheme with the time-optimal control (TOC) technique in a superconducting quantum circuit. With a transmon qubit and operations restricted to two computational levels, we implement a set of geometric gates which exhibit better robustness features against control errors than the dynamical counterparts. The measured fidelities of TOC X gate and X/2 gate are 99.81% and 99.79% respectively. Our work shows a promising routine toward scalable fault-tolerant quantum computation.
One of the key features required to realize fault-tolerant quantum computation is the robustness of quantum gates against errors. Since geometric quantum gate is naturally insensitivity to noise, it appears to be a promising routine to achieve high-fidelity, robust quantum gates. The implementation of geometric quantum gate however faces some troubles such as its complex interaction among multiple energy levels. Moreover, traditional geometric schemes usually take more time than equivalent dynamical ones. Here, we experimentally demonstrate a geometric gate scheme with the time-optimal control (TOC) technique in a superconducting quantum circuit. With a transmon qubit and operations restricted to two computational levels, we implement a set of geometric gates which exhibit better robustness features against control errors than the dynamical counterparts. The measured fidelities of TOC X gate and X/2 gate are 99.81% and 99.79% respectively. Our work shows a promising routine toward 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.
Quantum gates, which are the essential building blocks of quantum computers, are very fragile. Thus, to realize robust quantum gates with high fidelity is the ultimate goal of quantum manipulation. Here, we propose a nonadiabatic geometric quantum computation scheme on superconducting circuits to engineer arbitrary quantum gates, which share both the robust merit of geometric phases and the capacity to combine with optimal control technique to further enhance the gate robustness. Specifically, in our proposal, arbitrary geometric single-qubit gates can be realized on a transmon qubit, by a resonant microwave field driving, with both the amplitude and phase of the driving being time-dependent. Meanwhile, nontrivial two-qubit geometric gates can be implemented by two capacitively coupled transmon qubits, with one of the transmon qubits’ frequency being modulated to obtain effective resonant coupling between them. Therefore, our scheme provides a promising step towards fault-tolerant solid-state quantum computation.
Recently, nonadiabatic geometric quantum computation has received much attention due to its fast manipulation and intrinsic error-resilience characteristics. However, to obtain universal geometric quantum control, only limited and special evolution paths have been proposed, which usually require longer gate-time and more operational steps, and thus lead to lower quality of the implemented quantum gates. Here, we present an effective scheme to find the shortest geometric path under conventional conditions of geometric quantum computation, where high-fidelity and robust geometric gates can be realized by only single-loop evolution, and the gate performances are better than the corresponding dynamical ones. Furthermore, we can optimize the pulse shapes in our scheme to further shorten the gate-time, which is determined by how fast the path is traveled. In addition, we also present its physical implementation on superconducting circuits, consisting of capacitively coupled transmon qubits, where fidelities of geometric single- and two-qubit gates can be higher than 99.95% and 99.80% within the current state-of-the-art experimental technologies, respectively. These results indicate that our scheme is promising for large-scale fault-tolerant 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.
Quantum gates based on geometric phases possess intrinsic noise-resilience features and therefore 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 a set of noncyclic and nonadiabatic geometric quantum gates in a superconducting circuit, which greatly shortens the gate time. And also, we experimentally verify that our universal single-qubit geometric gates are more robust to both the Rabi frequency error and qubit frequency shift-induced error, compared to the conventional dynamical gates, by using the randomized benchmarking method. Moreover, this scheme can be utilized to construct two-qubit geometric operations, while the generation of the 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.
High-fidelity and robust quantum manipulation is the key for scalable quantum computation. Therefore, due to its intrinsic operational robustness, quantum manipulation induced by geometric phases is one of the promising strategies. However, the longer gate time for geometric operations and more physical difficulties with regard to implementation hinder its practical and wide application. Here, we propose a simplified implementation of universal holonomic quantum gates on superconducting circuits with experimentally demonstrated techniques, which can remove these two main challenges by introducing time-optimal control into the construction of quantum gates. Notably, our scheme is also based on a decoherence-free subspace encoding and requires minimal physical-qubit resources, which can be partially immune to error caused by qubit-frequency drift, one of the main sources of error for large-scale superconducting circuits. Meanwhile, gate error caused by unwanted leakage can also be eliminated by our deliberate design of quantum evolution paths. Finally, our scheme is numerically shown to be more robust than the conventional ones and thus provides a promising strategy for scalable solid-state fault-tolerant quantum computation.