Path-optimized nonadiabatic geometric quantum computation on superconducting qubits

TL;DR

This paper introduces a path-optimized nonadiabatic geometric quantum computation scheme for superconducting qubits, achieving high-fidelity, robust gates that outperform dynamical counterparts and are suitable for large-scale fault-tolerant quantum computing.

Contribution

It proposes a novel path-optimized approach for geometric quantum gates on superconducting qubits, enhancing fidelity and robustness over traditional methods.

Findings

Single-qubit gate fidelities exceed 99.9%

Two-qubit control-phase gate fidelity reaches 99.87%

Optimized paths improve robustness against local errors

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, $\pi/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.