The performance of quantum computers is hindered by decoherence and crosstalk, which cause errors and limit the ability to perform long computations. Dynamical decoupling is a technique that alleviates these issues by applying carefully timed pulses to individual qubits, effectively suppressing unwanted interactions. However, as quantum devices grow in size, it becomes increasingly important to minimize the time required to implement dynamical decoupling across the entire system. Here, we present “chromatic Hadamard dynamical decoupling” (CHaDD), an approach that efficiently schedules dynamical decoupling pulses for quantum devices with arbitrary qubit connectivity. By leveraging Hadamard matrices, CHaDD achieves a circuit depth that scales linearly with the chromatic number of the connectivity graph for general two-qubit interactions, assuming instantaneous pulses. This includes Z Z crosstalk, which is prevalent in superconducting quantum processing units (QPUs). The scaling of CHaDD represents an exponential improvement over all previous multiqubit decoupling schemes for devices with connectivity graphs the chromatic number of which grows at most polylogarithmically with the number of qubits. For graphs with a constant chromatic number, the scaling of CHaDD is independent of the number of qubits. We report on experiments we have conducted using IBM QPUs that confirm the advantage conferred by CHaDD. Our results suggest that CHaDD can become a useful tool for enhancing the performance and scalability of quantum computers by efficiently suppressing decoherence and crosstalk across large qubit arrays.
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.
As superconducting quantum processors continue to scale, high-performance quantum control becomes increasingly critical. In densely integrated architectures, unwanted interactions between nearby qubits give rise to crosstalk errors that limit operational performance. In particular, direct exchange-type ( XY ) interactions are typically minimized by designing large frequency detunings between neighboring qubits at the hardware level. However, frequency crowding in large-scale systems ultimately restricts the achievable frequency separation. While such XY coupling facilitates entangling gate operations, its residual presence poses a key challenge during single-qubit controls. Here, we propose a scalable pulse-level control framework, incorporating frequency modulation and dynamical decoupling to suppress XY crosstalk errors. This framework operates independently of coupling strengths, reducing calibration overhead and naturally supporting multiqubit connectivity. Numerical simulations show orders-of-magnitude reductions in infidelity for both idle and single-qubit gates in a two-qubit system. We further illustrate scalability in a five-qubit layout, where crosstalk between a central qubit and four neighbors is simultaneously suppressed. Our crosstalk suppression framework provides a practical route toward high-fidelity operation in dense superconducting architectures.
As superconducting quantum processors continue to scale, high-performance quantum control becomes increasingly critical. In densely integrated architectures, unwanted interactions between nearby qubits give rise to crosstalk errors that limit operational performance. In particular, direct exchange-type (XY) interactions are typically minimized by designing large frequency detunings between neighboring qubits at the hardware level. However, frequency crowding in large-scale systems ultimately restricts the achievable frequency separation. While such XY coupling facilitates entangling gate operations, its residual presence poses a key challenge during single-qubit controls. Here, we propose a scalable pulse-level control framework, incorporating frequency modulation (FM) and dynamical decoupling (DD), to suppress XY crosstalk errors. This framework operates independently of coupling strengths, reducing calibration overhead and naturally supporting multi-qubit connectivity. Numerical simulations show orders-of-magnitude reductions in infidelity for both idle and single-qubit gates in a two-qubit system. We further validate scalability in a five-qubit layout, where crosstalk between a central qubit and four neighbors is simultaneously suppressed. Our crosstalk suppression framework provides a practical route toward high-fidelity operation in dense superconducting architectures.
Crosstalk suppression is a key requirement for scalable implementations of fault-tolerant quantum computing, in particular using superconducting devices. This study demonstrates a simple, effective, and easily scalable scheme for dynamical decoupling to slash crosstalk. The scheme uses existing logic gates and does not require any additional calibrations or complexity. Apart from showing significant improvements in quantum memory experiments with multiqubit commercial processors, this approach also boosts the performance of single- and two-qubit gates. This method is suitable for immediate incorporation into both near-term NISQ and longer-term fault-tolerant systems.
Theoretically understanding and experimentally characterizing and modifying the underlying Hamiltonian of a quantum system is of utmost importance in achieving high-fidelity quantum gates for quantum computing. In this work, we explore the use of dynamical decoupling (DD) in characterizing and suppressing undesired two-qubit couplings as well as the underlying single-qubit decoherence, both significant hurdles to achieving precise quantum control and realizing quantum computing on many hardware prototypes. Through discrete search of DD sequences, we identify sequences that protect against decoherence and selectively target unwanted two-qubit interactions of general form. On a transmon-qubit-based superconducting quantum device, we identify separate white and
1/f noise components underlying the single-qubit decoherence and a static ZZ coupling between pairs of qubits. A family of syncopated DD sequences is found and their efficiency is demonstrated in two-qubit benchmarking experiments. The syncopated decoupling technique significantly boosts performance in a realistic algorithmic quantum circuit.
We introduce a protocol that modifies dynamical decoupling (DD) sequences to be robust to static
ZZ crosstalk when implemented with bounded control on two-colorable qubit topologies. The protocol, which relies on modifications to the pulse timing, can be applied to any sequence with equidistant
π-pulses. We motivate the method theoretically via suppression conditions identified through time-dependent perturbation theory. Theoretical findings are supported by demonstrations of widely studied sequences on several superconducting qubit devices offered by the IBM Quantum Platform. Using up to 20 qubits on fixed-coupler devices, we observe at least a
3× improvement in the fidelity decay rate via our approach when compared to non-robust DD variants. In addition, we leverage our approach to assess the impact of
ZZ errors on tunable-coupler devices. We find that
ZZ-robust sequences perform nearly equivalent to non-robust DD, affirming the reduced impact of such errors in a tunable-coupler architecture. Nevertheless, our demonstrations indicate that fixed-coupler devices, when subject to DD-protection, can outperform tunable-coupler devices. Our method broadens the scope of practical DD protocols: with modest overhead and a reasonable constraint on the qubit topology, the method attains significant performance improvements on modern quantum computing devices.