Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research presents a novel high-order dynamical decoupling scheme that significantly reduces the number of control pulses required to suppress decoherence in quantum systems compared to existing exponential-scaling methods. By mapping the problem to continuous necklace-splitting, the authors achieve asymptotically optimal pulse counts for arbitrary bounded interactions in the weak-coupling regime, offering a practical pathway toward more robust quantum error mitigation.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

High-order dynamical decoupling in the weak-coupling regime

arXiv2 min read

arXiv:2602.05343v2 Announce Type: replace Abstract: 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.

Abstract: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.

arXiv:2602.05343 [quant-ph]

(or arXiv:2602.05343v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2602.05343 Focus to learn more arXiv-issued DOI via DataCite

https://doi.org/10.1103/bvkl-8pq2 Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 295 words

Related coverage