Path-optimized nonadiabatic geometric quantum computation on superconducting qubits

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 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 geometric quantum computation, making it more promising in the application of large-scale fault-tolerant quantum computation.

Nonadiabatic geometric quantum computation with shortened path on superconducting circuits

“…Besides, the adiabatic geometric phase has been generalized to the nonadiabatic case 11 , which is more suitable in the application for constructing quantum gates. Therefore, GQC using the nonadiabatic geometric phase has been received extensive theoretical explorations [12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29] and experimental demonstrations [30][31][32] .…”

“…But, for the cyclic case 27,28 , the shortened path still has mutation and/or the gate robustness is weak or untested. Besides, there are other methods for non-adiabatic GQC with optimal control 21 , dynamical decoupling 22 , shortcuts to adiabaticity 23 , and path optimization 29 to improve gate-robustness, but they need either longer gate-time and/or sudden mutative pulse control. In addition, there is no comprehensive study of the shortest allowed path under certain conventional conditions.…”