Nonadiabatic Abelian geometric quantum computation has been extensively studied, due to its fast manipulation and inherent noise resistance. However, to obtain the pure geometric phase, the quantum state is required to evolve along some special paths to eliminate the dynamical phase. This leads to increasing evolution time and weakened gate robustness. The unconventional geometric quantum computation is an effective way to solve the above problems. Here, we propose a general approach to realize the unconventional geometric computation. Then, we discuss the effect of the ratio of geometric phase to dynamic phase on the performance of quantum gates. The results show that the selection of ratio corresponds to different quantum gate robustness. Therefore, we can optimize the ratio to get higher-fidelity quantum gates. At last, we construct the ratio-optimized quantum gates in a superconducting circuit and test its robustness. The fidelities of the T-gate, Hadamard H-gate, and controlled phase gate can be obtained as 99.98%, 99.95%, and 99.85%, respectively. Therefore, our scheme provides a promising way to realize large-scale fault-tolerant quantum computation in superconducting circuits.
Nonadiabatic Abelian geometric quantum computation has been extensively studied, due to its fast manipulation and inherent noise resistance. However, to obtain the pure geometric phase, the quantum state is required to evolve along some special paths to eliminate the dynamical phase. This leads to increasing evolution time and weakened gate robustness. The unconventional geometric quantum computation is an effective way to solve the above problems. Here, we propose a general approach to realize the unconventional geometric computation. Then, we discuss the effect of the ratio of geometric phase to dynamic phase on the performance of quantum gates. The results show that the selection of ratio corresponds to different quantum gate robustness. Therefore, we can optimize the ratio to get higher-fidelity quantum gates. At last, we construct the ratio-optimized quantum gates in a superconducting circuit and test its robustness. The fidelities of the T-gate, Hadamard H-gate, and controlled phase gate can be obtained as 99.98%, 99.95%, and 99.85%, respectively. Therefore, our scheme provides a promising way to realize large-scale fault-tolerant quantum computation in superconducting circuits.
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.
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.
Ongoing advancements in geometric quantum computation, including the continuous refinement of evolution paths and the integration of optimal control techniques, have demonstrated their significant resilience against control errors resulting from imprecise operations. However, as the number of qubits increases with the scaling up of quantum systems, the emergence of residual crosstalk imposes demands on the error tolerance of geometric control. Here, we propose a crosstalk-resistant unconventional geometric quantum computation scheme in a superconducting circuit. This approach significantly broadens the error tolerance of geometric control by leveraging the additional parameter degrees of freedom available in the unconventional geometric process, along with further path optimization. Compared to conventional geometric gates and dynamical Rabi gates, our unconventional geometric gates can exhibit superior crosstalk resistance regardless of the gate type, and still maintain robustness against the main systematic error in superconducting systems. Additionally, our numerical simulations thoroughly evaluate the combined impacts of leakage errors and decoherence, validating the high-fidelity performance of our unconventional geometric gates.
Nonadiabatic geometric quantum computation is dedicated to the realization of high-fidelity and robust quantum gates, which is the necessity of fault-tolerant quantum computation. However, it is limited by cyclic and mutative evolution path, which usually requires longer gate-time and abrupt pulse control, and thus weaken the gate performance. Here, we propose a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolutions, which effectively shorten the gate duration, and universal quantum gates can be realized in one step without path mutation. Our numerical simulation shows that, comparing with the conventional dynamical gates, the constructed geometric gates have stronger resistant not only to noise but also to decoherence effect. In addition, our scheme can also be implemented on a superconducting circuit platform, with the fidelities of single-qubit and two-qubit gates higher than 99.97% and 99.84%, respectively. Therefore, our scheme provides a promising way to realize high-fidelity fault-tolerant quantum gates for scalable 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.
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.