Fidelity Between Unitary Operators and the Generation of Robust Gates

Renán Cabrera, Ofer M. Shir, Re-Bing Wu +1 more

We perform a functional expansion of the fidelity between two unitary matrices in order to find necessary conditions for the robust implementation of a target gate. Comparison of these conditions with those obtained from the the Magnus expansion and Dyson series shows that they are equivalent in the first order. By exploiting techniques from robust design optimization , we account for issues of experimental feasibility by introducing an additional criterion to the search for control pulses. This search is accomplished by exploring the competition between the multiple objectives in the implementation of the NOT gate by means of evolutionary multi-objective optimization.

Yujin Cho, Kristin M. Beck, Alessandro R. Castelli +4 more

Advanced simulations and calculations on quantum computers require high-fidelity implementations of quantum operations. The universal gateset approach builds complex unitaries from a small set of primitive gates, often resulting in a long gate sequence, which is typically a leading factor in the total accumulated error. Compiling a complex unitary for processors with higher-dimensional logical elements, such as qutrits, exacerbates the accumulated error per unitary, since an even longer gate sequence is required. Optimal control methods promise time- and resource-efficient compact gate sequences and, therefore, higher fidelity. These methods generate pulses that can directly implement any complex unitary on a quantum device. In this work, we demonstrate that any arbitrary qubit and qutrit gate can be realized with high fidelity, which can significantly reduce the length of a gate sequence. We generate and test pulses for a large set of randomly selected arbitrary unitaries on several quantum processing units (QPUs): the Lawrence Livermore National Laboratory Quantum Device and Integration Testbed's (QuDIT's) standard QPU and three of Rigetti's QPUs: Ankaa-2, Ankaa-9Q-1, and Aspen-M-3. On the QuDIT platform's standard QPU, the average fidelity of random qutrit gates is $97.9\ifmmode\pm\else\textpm\fi{}0.5\mathrm{%}$ measured with conventional QPT and $98.8\ifmmode\pm\else\textpm\fi{}0.6\mathrm{%}$ from QPT with gate folding. Rigetti's Ankaa-2 achieves random qubit gates with an average fidelity of $98.4\ifmmode\pm\else\textpm\fi{}0.5\mathrm{%}$ (conventional QPT) and $99.7\ifmmode\pm\else\textpm\fi{}0.1\mathrm{%}$ (QPT with gate folding). On Ankaa-9Q-1 and Aspen-M-3, the average fidelities with conventional qubit QPT measurements were higher than 99% (see Appendix). We show that optimal control gates are robust to drift for at least 3 h and that the same calibration parameters can be used for all implemented gates. Our work promises that the calibration overheads for optimal control gates can be made small enough to enable efficient quantum circuits based on this technique.

Tsubasa Ichikawa, Masamitsu Bando, Yasushi Kondo +1 more

We propose a simple formalism to design unitary gates robust against given systematic errors. This formalism generalizes our previous observation [Y. Kondo and M. Bando, J. Phys. Soc. Jpn. 80, 054002 (2011)] that vanishing dynamical phase in some composite gates is essential to suppress pulse-length errors. By employing our formalism, we derive a composite unitary gate which can be seen as a concatenation of two known composite unitary operations. The obtained unitary gate has high fidelity over a wider range of error strengths compared to existing composite gates.