Approximate quantum gates compilation for superconducting transmon qubits with self-navigation algorithm
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Precise and fast qubit control is crucial when compiling quantum gates for successful implementation of quantum algorithms. However, the presence of environmental noise and the nonzero bandwidth of control pulses pose challenges for the effective control, particularly for weakly anharmonic systems such as superconducting transmon qubits. To address these problems, in this work we propose a self-navigation algorithm to approximately compile single-qubit gates with high accuracy in the context of transmon qubit. By utilizing this algorithm, the overall rotation distance for the target gate operation is significantly shorter than that of the commonly used U 3 gate technique. As a result, a shorter gate time can be obtained. The necessary number of pulses and the runtime of scheme designing scale up as $$\mathcal {O}[\textrm{Log}(1/\epsilon )]$$ O [ Log ( 1 / ϵ ) ] with a small prefactor, indicating a low overhead cost. Moreover, we investigate the trade-off between effectiveness and cost, and a balance point is identified. Our results demonstrate a reduction in both gate time and noise effects, but without an increase in leakage. Our work opens up a new avenue for efficient quantum algorithm implementations with contemporary superconducting quantum technology.