arXiv:2609.30175
Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling
Amy F. Brown, Daniel A. Lidar
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 $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.
AI Summary
The paper asks whether graph-colored dynamical decoupling (DD) can trade longer cycles for fewer pulses per qubit, reducing errors from imperfect control. It studies single-axis schedules with the same first-order cancellation: all one- and two-body Hamiltonian terms except $X$ and $XX$ terms on a properly $C$-colored interaction graph. Chromatic-Binary DD (CBDD) and Chromatic-Gray DD (CGDD) use binary-counting and Gray-code sign matrices. Both have depth $N=2^C$, versus $C<N\leq2C$ for minimum-depth Chromatic-Hadamard DD (CHaDD). Their pulse repetition rates—the average fraction of occupied color-time slots—are $(2^{C+1}-2)/(C2^C)<2/C$ and $1/C$, respectively. Row-optimized CHaDD at fixed column order has PRR at least $1/4+1/(2C)$. Cancellation follows from balanced, pairwise-orthogonal sign rows; Gray ordering minimizes pulse count among traversals visiting every element of the full control group once. State-preservation experiments on a 127-qubit IBM processor compare schedules on an embedded $C=3$ subsystem. Sparser non-robust schedules perform better at short times. UR4-inspired phase alternation largely removes these differences; synchronous UR4 also performs similarly, indicating that targeted next-nearest-neighbor crosstalk is not resolved in this comparison. Selected non-robust $C=3$ and $C=5$ schedules with equal pulse density on the measured subset show similar preservation. The analysis assumes instantaneous, perfect pulses and first-order averaging; exponentially longer cycles tighten its validity condition. Robust chromatic variants lack a formal robustness proof, and neighboring-qubit pulses cause residual degradation consistent with finite-pulse crosstalk. Multi-axis, higher-order, larger-$C$, and other-device tests remain outside scope.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 16 pages, 9 figures