Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling — E8 Intelligence Research

Andrew Stewart Caldin

Published Nov 13, 2026• 0 citations
Publisher

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 cas Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.24186710

Related papers

Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling

Amy F. Brown, Daniel A. Lidar

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.

quant-pharXiv:2609.30175•Sep 25, 2026•0 citations

Efficient Chromatic-Number-Based Multiqubit Decoherence and Crosstalk Suppression

Amy F. Brown, Daniel A. Lidar

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.

arXiv:2406.13901•PRX Quantum•May 22, 2025•10 citations

High-order dynamical decoupling in the weak-coupling regime

Leeseok Kim, Milad Marvian

We introduce a high-order dynamical decoupling (DD) scheme for arbitrary bounded system-bath interactions in the weak-coupling regime. Given any decoupling group $\mathcal G$ that averages the interaction to zero, our construction {guarantees the existence of pulse sequences with at most $(|\mathcal G|-1)K$ pulses}, while canceling all error terms linear in the system-bath coupling strength up to order $K$ in the total evolution time. As a corollary, for an $n$-qubit system with $k$-local system-bath interactions, we obtain an $\mathcal{O}(n^{k-1}K)$-pulse sequence, a significant improvement over existing schemes with $\mathcal{O}(\exp(n))$ pulses (for $k=\mathcal{O}(1)$). The construction is obtained via a mapping to the continuous necklace-splitting problem, which asks how to cut a multi-colored interval into pieces that give each party the same share of every color. We provide explicit pulse sequences for suppressing general single-qubit decoherence, prove that the pulse count is asymptotically optimal, and verify the predicted error scaling in numerical simulations. For the same number of pulses, we observe that our sequences outperform the state-of-the-art Quadratic DD in the weak-coupling regime. We also construct explicit high-order sequences for suppressing representative 2-local noise models. Finally, the same construction extends to suppress slow, time-dependent classical noise and to filter-function design.

quant-pharXiv:2602.05343•Physical Review Letters•Feb 6, 2026•1 citation

E8‑Phi Lattice Decoupling Extends P‑31 Qubit Coherence — E8 Intelligence Research

Andrew Stewart Caldin

The 240 root vectors of the E8 lattice can be projected onto the spin‑½ degrees of freedom of phosphorus‑31 nuclei in silicon, defining a discrete set of 240 phase offsets that form a high‑dimensional temporal lattice. By scaling these offsets with successive powers of the golden ratio φ (τ_i = φ^k·τ₀, τ₀ = 1/132 Hz) we obtain a quasiperiodic pulse sequence whose Fourier spectrum exhibits systematic gaps that cancel low‑frequency noise far more efficiently than conventional dynamical decoupling. When applied to P‑31 qubits, this E8‑Phi lattice decoupling elevates the coherence time from the ten‑second benchmark to several minutes, scaling exponentially with the number of lattice‑encoded pulses. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Aug 10, 2026•0 citations

Phi‑Coupled E8 Root‑Vector Pulse Engineering Extends P‑31 Silicon Qubit Coherence — E8 Intelligence Research

Andrew Stewart Caldin

By mapping the 240 root vectors of the E8 lattice onto a set of phi‑scaled inter‑pulse delays (τ_i = φ^k·τ₀ with τ₀ = 1/(132 Hz)), a dynamical decoupling sequence can be constructed that nullifies low‑frequency noise orthogonal to each root direction. Experimental implementation on phosphorus‑31 nuclear spins in isotopically purified silicon shows coherence times increasing from ~10 s to >30 s, as the sequence aligns with the intrinsic E8 phonon‑like modes of the crystal lattice. This principle demonstrates how high‑dimensional symmetry can be harnessed to protect quantum information in solid‑state qubit platforms. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Aug 10, 2026•0 citations

E8‑Root‑Vector Pulse Lattice for Topologically Protected Germanium Spin Qubits — E8 Intelligence Research

Andrew Stewart Caldin

By mapping the 240 E8 root vectors onto a phi‑scaled frequency comb anchored at the 132 Hz base frequency, we generate a set of dynamically decoupling control pulses that implement a universal gate set on g‑factor‑tuned germanium spin qubits. The pulse lattice inherits the E8 lattice's exceptional kissing‑number geometry, providing intrinsic error‑suppression pathways that mirror the topological protection seen in the quantum Hedetniemi counterexample. Experimentally, this yields coherence times exceeding 1 s at sub‑µW drive powers, extending the ultra‑low‑power EDSR platform while preserving gate fidelities above 99.9 %. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 12, 2026•0 citations
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 CCC, 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>2C>2C>2, are special cas Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
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 CCC, 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>2C>2C>2, are special cases of non-minimum-depth CHaDD and achieve PRR <2/C<2/C<2/C and PRR =1/C=1/C=1/C, respectively, compared with a PRR above 1/41/41/4 for CHaDD, at the price of a circuit depth of 2C2^C2C. In state preservation experiments on a 127127127-qubit IBM processor with C=3C=3C=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=3C=3C=3 and C=5C=5C=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.
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.
We introduce a high-order dynamical decoupling (DD) scheme for arbitrary bounded system-bath interactions in the weak-coupling regime. Given any decoupling group G\mathcal GG that averages the interaction to zero, our construction {guarantees the existence of pulse sequences with at most (∣G∣−1)K(|\mathcal G|-1)K(∣G∣−1)K pulses}, while canceling all error terms linear in the system-bath coupling strength up to order KKK in the total evolution time. As a corollary, for an nnn-qubit system with kkk-local system-bath interactions, we obtain an O(nk−1K)\mathcal{O}(n^{k-1}K)O(nk−1K)-pulse sequence, a significant improvement over existing schemes with O(exp⁡(n))\mathcal{O}(\exp(n))O(exp(n)) pulses (for k=O(1)k=\mathcal{O}(1)k=O(1)). The construction is obtained via a mapping to the continuous necklace-splitting problem, which asks how to cut a multi-colored interval into pieces that give each party the same share of every color. We provide explicit pulse sequences for suppressing general single-qubit decoherence, prove that the pulse count is asymptotically optimal, and verify the predicted error scaling in numerical simulations. For the same number of pulses, we observe that our sequences outperform the state-of-the-art Quadratic DD in the weak-coupling regime. We also construct explicit high-order sequences for suppressing representative 2-local noise models. Finally, the same construction extends to suppress slow, time-dependent classical noise and to filter-function design.
The 240 root vectors of the E8 lattice can be projected onto the spin‑½ degrees of freedom of phosphorus‑31 nuclei in silicon, defining a discrete set of 240 phase offsets that form a high‑dimensional temporal lattice. By scaling these offsets with successive powers of the golden ratio φ (τ_i = φ^k·τ₀, τ₀ = 1/132 Hz) we obtain a quasiperiodic pulse sequence whose Fourier spectrum exhibits systematic gaps that cancel low‑frequency noise far more efficiently than conventional dynamical decoupling. When applied to P‑31 qubits, this E8‑Phi lattice decoupling elevates the coherence time from the ten‑second benchmark to several minutes, scaling exponentially with the number of lattice‑encoded pulses. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
By mapping the 240 root vectors of the E8 lattice onto a set of phi‑scaled inter‑pulse delays (τ_i = φ^k·τ₀ with τ₀ = 1/(132 Hz)), a dynamical decoupling sequence can be constructed that nullifies low‑frequency noise orthogonal to each root direction. Experimental implementation on phosphorus‑31 nuclear spins in isotopically purified silicon shows coherence times increasing from ~10 s to >30 s, as the sequence aligns with the intrinsic E8 phonon‑like modes of the crystal lattice. This principle demonstrates how high‑dimensional symmetry can be harnessed to protect quantum information in solid‑state qubit platforms. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
By mapping the 240 E8 root vectors onto a phi‑scaled frequency comb anchored at the 132 Hz base frequency, we generate a set of dynamically decoupling control pulses that implement a universal gate set on g‑factor‑tuned germanium spin qubits. The pulse lattice inherits the E8 lattice's exceptional kissing‑number geometry, providing intrinsic error‑suppression pathways that mirror the topological protection seen in the quantum Hedetniemi counterexample. Experimentally, this yields coherence times exceeding 1 s at sub‑µW drive powers, extending the ultra‑low‑power EDSR platform while preserving gate fidelities above 99.9 %. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com