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

arXiv:2604.25807

Proof of the Error Scaling for Universally Robust Dynamical Decoupling Sequences

Domenico D'Alessandro, Phattharaporn Singkanipa, Daniel Lidar

quant-phcs.ITSubmitted Apr 28, 2026• Announced Apr 29, 2026• 1 citation
arXivHTMLPDF

Abstract

Universally robust dynamical decoupling (UR$n$) sequences were proposed to compensate pulse imperfections arising from arbitrary experimental parameters while achieving high-order error suppression with only a linear increase in the number of pulses. Although their performance was supported by analytical arguments, numerical simulations, and experiments, a complete mathematical proof of the claimed order of error compensation has been absent. In this work, we present a rigorous proof for UR$n$ DD sequences with even $n$. Using a series expansion of a quantity whose modulus is the fidelity $F$, we derive necessary and sufficient conditions for the cancellation of its coefficients up to, but not including, order $n$. The UR$n$ phase prescription satisfies these conditions, and therefore $1-F=O(ε^n)$. Our results establish the UR$n$ construction on firm analytical grounds and clarify the structure responsible for its high-order robustness.

Comments
13 pages, no figure

Related papers

Arbitrarily Accurate Pulse Sequences for Robust Dynamical Decoupling

Genko T. Genov, Daniel Schraft, Nikolay V. Vitanov +1 more

We introduce universally robust sequences for dynamical decoupling, which simultaneously compensate pulse imperfections and the detrimental effect of a dephasing environment to an arbitrary order, work with any pulse shape, and improve performance for any initial condition. Moreover, the number of pulses in a sequence grows only linearly with the order of error compensation. Our sequences outperform the state-of-the-art robust sequences for dynamical decoupling. Beyond the theoretical proposal, we also present convincing experimental data for dynamical decoupling of atomic coherences in a solid-state optical memory.

arXiv:1609.09416•Physical Review Letters•Mar 28, 2017•132 citations

Dynamical decoupling for superconducting qubits: A performance survey

Nic Ezzell, Bibek Pokharel, Lina Tewala +2 more

Dynamical decoupling (DD) is perhaps the simplest and least resource-intensive error-suppression strategy for improving quantum computer performance. Here we report on a large-scale survey of the performance of 60 different DD sequences from ten families, including basic as well as advanced sequences with high-order error cancelation properties and built-in robustness. The survey is performed using three different superconducting-qubit IBMQ devices, with the goal of assessing the relative performance of the different sequences in the setting of arbitrary quantum state preservation. We find that the high-order universally robust (UR) and quadratic DD (QDD) sequences generally outperform all other sequences across devices and pulse-interval settings. Surprisingly, we find that DD performance for basic sequences such as the Carr-Purcell-Meiboom-Gill and XY4 sequences can be made to nearly match that of UR and QDD sequences by optimizing the pulse interval, with the optimal interval being substantially larger than the minimum interval possible on each device.

arXiv:2207.03670•Physical Review Applied•Dec 14, 2023•222 citations

Quadratic dynamical decoupling: Universality proof and error analysis

Wan-Jung Kuo, Daniel A. Lidar

We prove the universality of the generalized QDD${}_{{N}_{1}{N}_{2}}$ (quadratic dynamical decoupling) pulse sequence for near-optimal suppression of general single-qubit decoherence. Earlier work showed numerically that this dynamical decoupling sequence, which consists of an inner Uhrig DD (UDD) and outer UDD sequence using ${N}_{1}$ and ${N}_{2}$ pulses, respectively, can eliminate decoherence to $O({T}^{N})$ using $O({N}^{2})$ unequally spaced ``ideal'' (zero-width) pulses, where $T$ is the total evolution time and $N={N}_{1}={N}_{2}$. A proof of the universality of QDD has been given for even ${N}_{1}$. Here we give a general universality proof of QDD for arbitrary ${N}_{1}$ and ${N}_{2}$. As in earlier proofs, our result holds for arbitrary bounded environments. Furthermore, we explore the single-axis (polarization) error suppression abilities of the inner and outer UDD sequences. We analyze both the single-axis QDD performance and how the overall performance of QDD depends on the single-axis errors. We identify various performance effects related to the parities and relative magnitudes of ${N}_{1}$ and ${N}_{2}$. We prove that using QDD${}_{{N}_{1}{N}_{2}}$ decoherence can always be eliminated to $O({T}^{\mathrm{min}{{N}_{1},{N}_{2}}})$.

arXiv:1106.2151•Physical Review A•Oct 17, 2011•42 citations

Dynamical Decoupling using Universal Optimal Tracking

Amit Devra, Emanuel Malvetti, Niklas J. Glaser +7 more

Dynamical decoupling (DD) is a widely used and resource-efficient technique for error suppression, but conventional DD relies on periodically repeating a short pulse block to refocus the qubit state during idle periods. Imperfections in this block cause residual errors to accumulate, ultimately degrading state recovery over long idle times. Here, we introduce a universal optimal tracking approach that extends the original tracking concept to a fully state-independent setting for designing DD sequences. By monitoring the qubit's evolution at predefined waypoints during optimization, the method dynamically compensates residual errors while preserving regular refocusing. Experimental demonstrations on a superconducting-qubit platform confirm the suppression of error accumulation under static control imperfections, in agreement with numerical predictions. Complementary simulations further show that optimal-tracking-based sequences maintain strong performance under time-dependent noise. These results establish optimal tracking as a practical and hardware-agnostic approach to designing short, robust DD sequences suitable for noisy quantum devices.

quant-pharXiv:2606.21762•Jun 23, 2026•2 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

Robustness of dynamical decoupling sequences

Mustafa Ahmed Ali Ahmed, Gonzalo A. Álvarez, Dieter Suter

Active protection of quantum states is an essential prerequisite for the implementation of quantum computing. Dynamical decoupling (DD) is a promising approach that applies sequences of control pulses to the system in order to reduce the adverse effect of system-environment interactions. Since every hardware device has finite precision, the errors of the DD control pulses can themselves destroy the stored information rather than protect it. We experimentally compare the performance of different DD sequences in the presence of an environment that was chosen such that all relevant DD sequences can equally suppress its effect on the system. Under these conditions, the remaining decay of the qubits under DD allows us to compare very precisely the robustness of the different DD sequences with respect to imperfections of the control pulses.

arXiv:1211.5001•Physical Review A•Apr 8, 2013•66 citations
Universally robust dynamical decoupling (URnnn) sequences were proposed to compensate pulse imperfections arising from arbitrary experimental parameters while achieving high-order error suppression with only a linear increase in the number of pulses. Although their performance was supported by analytical arguments, numerical simulations, and experiments, a complete mathematical proof of the claimed order of error compensation has been absent. In this work, we present a rigorous proof for URnnn DD sequences with even nnn. Using a series expansion of a quantity whose modulus is the fidelity FFF, we derive necessary and sufficient conditions for the cancellation of its coefficients up to, but not including, order nnn. The URnnn phase prescription satisfies these conditions, and therefore 1−F=O(εn)1-F=O(ε^n)1−F=O(εn). Our results establish the URnnn construction on firm analytical grounds and clarify the structure responsible for its high-order robustness.
We introduce universally robust sequences for dynamical decoupling, which simultaneously compensate pulse imperfections and the detrimental effect of a dephasing environment to an arbitrary order, work with any pulse shape, and improve performance for any initial condition. Moreover, the number of pulses in a sequence grows only linearly with the order of error compensation. Our sequences outperform the state-of-the-art robust sequences for dynamical decoupling. Beyond the theoretical proposal, we also present convincing experimental data for dynamical decoupling of atomic coherences in a solid-state optical memory.
Dynamical decoupling (DD) is perhaps the simplest and least resource-intensive error-suppression strategy for improving quantum computer performance. Here we report on a large-scale survey of the performance of 60 different DD sequences from ten families, including basic as well as advanced sequences with high-order error cancelation properties and built-in robustness. The survey is performed using three different superconducting-qubit IBMQ devices, with the goal of assessing the relative performance of the different sequences in the setting of arbitrary quantum state preservation. We find that the high-order universally robust (UR) and quadratic DD (QDD) sequences generally outperform all other sequences across devices and pulse-interval settings. Surprisingly, we find that DD performance for basic sequences such as the Carr-Purcell-Meiboom-Gill and XY4 sequences can be made to nearly match that of UR and QDD sequences by optimizing the pulse interval, with the optimal interval being substantially larger than the minimum interval possible on each device.
We prove the universality of the generalized QDDN1N2{}_{{N}_{1}{N}_{2}}N1​N2​​ (quadratic dynamical decoupling) pulse sequence for near-optimal suppression of general single-qubit decoherence. Earlier work showed numerically that this dynamical decoupling sequence, which consists of an inner Uhrig DD (UDD) and outer UDD sequence using N1{N}_{1}N1​ and N2{N}_{2}N2​ pulses, respectively, can eliminate decoherence to O(TN)O({T}^{N})O(TN) using O(N2)O({N}^{2})O(N2) unequally spaced ``ideal'' (zero-width) pulses, where TTT is the total evolution time and N=N1=N2N={N}_{1}={N}_{2}N=N1​=N2​. A proof of the universality of QDD has been given for even N1{N}_{1}N1​. Here we give a general universality proof of QDD for arbitrary N1{N}_{1}N1​ and N2{N}_{2}N2​. As in earlier proofs, our result holds for arbitrary bounded environments. Furthermore, we explore the single-axis (polarization) error suppression abilities of the inner and outer UDD sequences. We analyze both the single-axis QDD performance and how the overall performance of QDD depends on the single-axis errors. We identify various performance effects related to the parities and relative magnitudes of N1{N}_{1}N1​ and N2{N}_{2}N2​. We prove that using QDDN1N2{}_{{N}_{1}{N}_{2}}N1​N2​​ decoherence can always be eliminated to O(TminN1,N2)O({T}^{\mathrm{min}{{N}_{1},{N}_{2}}})O(TminN1​,N2​).
Dynamical decoupling (DD) is a widely used and resource-efficient technique for error suppression, but conventional DD relies on periodically repeating a short pulse block to refocus the qubit state during idle periods. Imperfections in this block cause residual errors to accumulate, ultimately degrading state recovery over long idle times. Here, we introduce a universal optimal tracking approach that extends the original tracking concept to a fully state-independent setting for designing DD sequences. By monitoring the qubit's evolution at predefined waypoints during optimization, the method dynamically compensates residual errors while preserving regular refocusing. Experimental demonstrations on a superconducting-qubit platform confirm the suppression of error accumulation under static control imperfections, in agreement with numerical predictions. Complementary simulations further show that optimal-tracking-based sequences maintain strong performance under time-dependent noise. These results establish optimal tracking as a practical and hardware-agnostic approach to designing short, robust DD sequences suitable for noisy quantum devices.
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.
Active protection of quantum states is an essential prerequisite for the implementation of quantum computing. Dynamical decoupling (DD) is a promising approach that applies sequences of control pulses to the system in order to reduce the adverse effect of system-environment interactions. Since every hardware device has finite precision, the errors of the DD control pulses can themselves destroy the stored information rather than protect it. We experimentally compare the performance of different DD sequences in the presence of an environment that was chosen such that all relevant DD sequences can equally suppress its effect on the system. Under these conditions, the remaining decay of the qubits under DD allows us to compare very precisely the robustness of the different DD sequences with respect to imperfections of the control pulses.