Efficient Chromatic-Number-Based Multi-Qubit Decoherence and Crosstalk Suppression
Amy F. Brown, Daniel A. Lidar

TL;DR
This paper introduces CHaDD, a novel scheduling method using Hadamard matrices that significantly reduces the circuit depth needed for dynamical decoupling in large, complex quantum systems, improving error suppression efficiency.
Contribution
The paper presents CHaDD, a scalable dynamical decoupling scheduling approach leveraging Hadamard matrices, with linear scaling in the chromatic number, outperforming previous methods especially for large, highly connected quantum devices.
Findings
CHaDD achieves linear circuit depth scaling with the chromatic number.
Experimental validation on IBM QPUs confirms CHaDD's effectiveness.
Scales independently of qubit number for constant chromatic graphs.
Abstract
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 ZZ…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
