Approximate quantum gates compiling with self-navigation algorithm

Abstract

The compiling of quantum gates is crucial for the successful quantum algorithm implementations. The environmental noise as well as the bandwidth of control pulses pose a challenge to precise and fast qubit control, especially in a weakly anharmonic system. In this work, we propose an algorithm to approximately compile single-qubit gates with arbitrary accuracy. Evaluation results show that the overall rotation distance generated by our algorithm is significantly shorter than the commonly used U 3 gate, then the gate time can be effectively shortened. The requisite number of pulses and the runtime of scheme design scale up as O[Log(1/ǫ)] with very small prefactors, indicating low overhead costs. Moreover, we explore the trade-off between effectiveness and cost, and find a balance point. In short, our work opens a new avenue for efficient quantum algorithm implementations with contemporary quantum technology.

Modularized and scalable compilation for double quantum dot quantum computing

“…Any high-level algorithm for quantum computation needs to be translated into low-level instructions that can be executed step by step on specific quantum hardware [17,18]. While the S-T 0 qubit is one of the most promising modalities for constructing a scalable quantum computer from the fabrication perspective, the tight restrictions on the control limits the applications of many existing optimization methods and make it challenging to manipulate this quantum system for computational tasks [19,20].…”