Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling
Abstract
Suppressing decoherence and crosstalk systematically across large networks of qubits is a pressing concern as qubit counts increase rapidly. General multi-qubit dynamical decoupling (DD) has historically been based on Hadamard matrices and orthogonal arrays, with instantaneous-pulse sequences whose circuit depth scales linearly with the number of qubits. Chromatic-Hadamard DD (CHaDD) improves upon these methods by properly coloring the hardware graph and assigning to each color a row of a Hadamard matrix, resulting in a circuit depth that scales linearly with the number of colors C, which can be as low as the chromatic number of the graph. Here, we explore the tradeoff between circuit depth and the pulse repetition rate (PRR), the average fraction of time steps in which a qubit is pulsed, i.e., a measure of pulse density. We introduce two single-axis sequences based on binary and Gray matrices, Chromatic-Binary DD (CBDD) and Chromatic-Gray DD (CGDD), which, for C>2, are special cases of non-minimum-depth CHaDD and achieve PRR <2/C and PRR =1/C, respectively, compared with a PRR above 1/4 for CHaDD, at the price of a circuit depth of 2C. In state preservation experiments on a $127$-qubit IBM processor with C=3, the less dense sequences outperform CHaDD at short times when the pulses are not robust; this advantage is largely eliminated by robust versions designed to compensate for coherent pulse errors, and among the robust sequences, CGDD uses the fewest pulses over a fixed protection time. Across non-robust C=3 and C=5 schedules, equal PRR on a fixed qubit subset is empirically associated with similar state preservation. Thus, the PRR serves as a practical figure of merit for chromatic DD whenever coherent pulse errors dominate.
Related
- Achieving Heisenberg limit under noisy conditions with quantum Zeno dynamics and dynamical decoupling
- Investigating entanglement dynamics with dynamical decoupling together with initial qubit-reservoir correlations
- Dynamical Decoupling using Universal Optimal Tracking
- Shuttling-aware dynamical decoupling for quantum charge-coupled devices
- Optimized Dynamical Decoupling for Spin Ensembles with Large Inhomogeneities
BibTeX
@misc{brown2026trading,
title = {{Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling}},
author = {Amy F. Brown and Daniel A. Lidar},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.30175},
eprint = {2609.30175},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.30175},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling
AU - Amy F. Brown
AU - Daniel A. Lidar
PY - 2026
DA - 2026/09/24
PB - arXiv
DO - 10.48550/arxiv.2609.30175
UR - https://arxiv.org/abs/2609.30175
AB - Suppressing decoherence and crosstalk systematically across large networks of qubits is a pressing concern as qubit counts increase rapidly. General multi-qubit dynamical decoupling (DD) has historically been based on Hadamard matrices and orthogonal arrays, with instantaneous-pulse sequences whose circuit depth scales linearly with the number of qubits. Chromatic-Hadamard DD (CHaDD) improves upon these methods by properly coloring the hardware graph and assigning to each color a row of a Hadamard matrix, resulting in a circuit depth that scales linearly with the number of colors C, which can be as low as the chromatic number of the graph. Here, we explore the tradeoff between circuit depth and the pulse repetition rate (PRR), the average fraction of time steps in which a qubit is pulsed, i.e., a measure of pulse density. We introduce two single-axis sequences based on binary and Gray matrices, Chromatic-Binary DD (CBDD) and Chromatic-Gray DD (CGDD), which, for C>2, are special cases of non-minimum-depth CHaDD and achieve PRR <2/C and PRR =1/C, respectively, compared with a PRR above 1/4 for CHaDD, at the price of a circuit depth of 2^C. In state preservation experiments on a $127$-qubit IBM processor with C=3, the less dense sequences outperform CHaDD at short times when the pulses are not robust; this advantage is largely eliminated by robust versions designed to compensate for coherent pulse errors, and among the robust sequences, CGDD uses the fewest pulses over a fixed protection time. Across non-robust C=3 and C=5 schedules, equal PRR on a fixed qubit subset is empirically associated with similar state preservation. Thus, the PRR serves as a practical figure of merit for chromatic DD whenever coherent pulse errors dominate.
ER -