Dynamical decoupling for superconducting qubits: a performance survey

  1. Nic Ezzell,
  2. Bibek Pokharel,
  3. Lina Tewala,
  4. Gregory Quiroz,
  5. and Daniel A. Lidar
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.

Predicting non-Markovian superconducting qubit dynamics from tomographic reconstruction

  1. Haimeng Zhang,
  2. Bibek Pokharel,
  3. E.M. Levenson-Falk,
  4. and Daniel Lidar
Non-Markovian noise presents a particularly relevant challenge in understanding and combating decoherence in quantum computers, yet is challenging to capture in terms of simple models.
Here we show that a simple phenomenological dynamical model known as the post-Markovian master equation (PMME) accurately captures and predicts non-Markovian noise in a superconducting qubit system. The PMME is constructed using experimentally measured state dynamics of an IBM Quantum Experience cloud-based quantum processor, and the model thus constructed successfully predicts the non-Markovian dynamics observed in later experiments. The model also allows the extraction of information about cross-talk and measures of non-Markovianity. We demonstrate definitively that the PMME model predicts subsequent dynamics of the processor better than the standard Markovian master equation.

Demonstration of fidelity improvement using dynamical decoupling with superconducting qubits

  1. Bibek Pokharel,
  2. Namit Anand,
  3. Benjamin Fortman,
  4. and Daniel Lidar
Quantum computers must be able to function in the presence of decoherence. The simplest strategy for decoherence reduction is dynamical decoupling (DD), which requires no encoding overhead
and works by converting quantum gates into decoupling pulses. Here, using the IBM and Rigetti platforms, we demonstrate that the DD method is suitable for implementation in today’s relatively noisy and small-scale cloud based quantum computers. Using DD, we achieve substantial fidelity gains relative to unprotected, free evolution of individual superconducting transmon qubits. To a lesser degree, DD is also capable of protecting entangled two-qubit states. We show that dephasing and spontaneous emission errors are dominant in these systems, and that different DD sequences are capable of mitigating both effects. Unlike previous work demonstrating the use of quantum error correcting codes on the same platforms, we make no use of post-selection and hence report unconditional fidelity improvements against natural decoherence.