Metraipolis › archive › dc_ad0248ea4f33
Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling — arXiv:2609.30175
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30175
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T07:37:10.502Z
- SHA-256 of the archived text
33c85c40e3c071a2ea83d4fc87c031255ac04446188aa8e1bbe1869ca5c4569b- Stable URL of this page
https://metraipolis.com/documento/dc_ad0248ea4f33
How to cite
Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling — arXiv:2609.30175 — arXiv (en), https://arxiv.org/abs/2609.30175 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ad0248ea4f33 (Metraipolis archive dc_ad0248ea4f33, sha256 33c85c40e3c071a2ea83d4fc87c031255ac04446188aa8e1bbe1869ca5c4569b)
BibTeX
@misc{dcad0248ea4f33,
title = {Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling — arXiv:2609.30175},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30175},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ad0248ea4f33; sha256 33c85c40e3c071a2ea83d4fc87c031255ac04446188aa8e1bbe1869ca5c4569b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30175. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-25 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.30175 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T06:49:21.279Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).