Empirical learning of dynamical decoupling on quantum processors

Abstract

Dynamical decoupling (DD) is a low-overhead method for quantum error suppression. Despite extensive work in DD design, finding pulse sequences that optimally decouple computational qubits on noisy quantum hardware is not well understood. In this work, we describe how learning algorithms can empirically tailor DD strategies for any quantum circuit and device. We use a genetic algorithm-inspired search to optimize DD (GADD) strategies for IBM's superconducting-qubit based quantum processors. In all observed experimental settings, we find that empirically learned DD strategies significantly improve error suppression relative to canonical sequences, with relative improvement increasing with problem size and circuit sophistication. We leverage this to study mirror randomized benchmarking on 100 qubits, GHZ state preparation on 50 qubits, and the Bernstein-Vazirani algorithm on 27 qubits. We further demonstrate that our empirical learning method finds strategies, in time constant with increasing circuit width and depth, that provide stable performance over long periods of time without retraining and generalize to larger circuits when trained on small sub-circuit structures.

References in corpus (27)

• Suppressing quantum errors by scaling a surface code logical qubit
• Universal dynamical decoupling of a single solid-state spin from a spin bath
• Robust randomized benchmarking of quantum processes
• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
• Scalable error mitigation for noisy quantum circuits produces competitive expectation values
• Model-free readout-error mitigation for quantum expectation values
• Suppression of crosstalk in superconducting qubits using dynamical decoupling
• Dynamical decoupling for superconducting qubits: a performance survey
• Application-Oriented Performance Benchmarks for Quantum Computing
• Arbitrarily Accurate Pulse Sequences for Robust Dynamical Decoupling
• Comparison of dynamical decoupling protocols for a nitrogen-vacancy center in diamond
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Enhanced Convergence and Robust Performance of Randomized Dynamical Decoupling
• Quantum Crosstalk Robust Quantum Control
• Demonstration of algorithmic quantum speedup
• Rigorous Bounds for Optimal Dynamical Decoupling
• Experimental benchmarking of an automated deterministic error suppression workflow for quantum algorithms
• Predicting non-Markovian superconducting qubit dynamics from tomographic reconstruction
• Efficient quantum readout-error mitigation for sparse measurement outcomes of near-term quantum devices
• All-photonic architectural roadmap for scalable quantum computing using Greenberger-Horne-Zeilinger states
• Pulse variational quantum eigensolver on cross-resonance based hardware
• Realizing the Nishimori transition across the error threshold for constant-depth quantum circuits
• High photon-loss threshold quantum computing using GHZ-state measurements
• Dissipative Dynamics of Graph-State Stabilizers with Superconducting Qubits
• Demonstrating scalable randomized benchmarking of universal gate sets
• Learning How to Dynamically Decouple
• Dynamically Generated Decoherence-Free Subspaces and Subsystems on Superconducting Qubits

Cited by in corpus (2)

• Readout Error Mitigation for Mid-Circuit Measurements and Feedforward
• Color it, Code it, Cancel it: k-local dynamical decoupling from classical additive codes