Papers
Topics
Authors
Recent
Search
2000 character limit reached

Crosstalk-Robust Dynamical Decoupling for Bipartite-Topology Quantum Processors

Published 22 Jun 2025 in quant-ph | (2506.18010v1)

Abstract: 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 $\pi$-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\times$ 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.