Dynamical decoupling for superconducting qubits: a performance survey
Abstract
Dynamical Decoupling (DD) is perhaps the simplest and least resource-intensive error suppression strategy for improving quantum computer performance. Here we report on a large-scale survey of the performance of 60 different DD sequences from 10 families, including basic as well as advanced sequences with high order error cancellation properties and built-in robustness. The survey is performed using three different superconducting-qubit IBMQ devices, with the goal of assessing the relative performance of the different sequences in the setting of arbitrary quantum state preservation. We find that the high-order universally robust (UR) and quadratic DD (QDD) sequences generally outperform all other sequences across devices and pulse interval settings. Surprisingly, we find that DD performance for basic sequences such as CPMG and XY4 can be made to nearly match that of UR and QDD by optimizing the pulse interval, with the optimal interval being substantially larger than the minimum interval possible on each device.
Cite
@article{arxiv.2207.03670,
title = {Dynamical decoupling for superconducting qubits: a performance survey},
author = {Nic Ezzell and Bibek Pokharel and Lina Tewala and Gregory Quiroz and Daniel A. Lidar},
journal= {arXiv preprint arXiv:2207.03670},
year = {2023}
}
Comments
40 pages (15 main pages + 22 supplementary pages + 3 citation pages), 23 figures (5 main figures + 18 supplementary figures), 4 tables (2 main tables + 2 supplementary tables). Final submission (missing minor final proofing edits from published version)