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:2209.09039 · Physical Review A

Efficacy of noisy dynamical decoupling

Jiaan Qi, Xiansong Xu, Dario Poletti, Hui Khoon Ng

Published Mar 22, 2023• 5 citations
arXivHTMLPDF

Abstract

Dynamical decoupling (DD) refers to a well-established family of methods for error mitigation, comprising pulse sequences aimed at averaging away slowly evolving noise in quantum systems. Here we revisit the question of its efficacy in the presence of noisy pulses in scenarios important for quantum devices today: pulses with gate control errors, and the computational setting where DD is used to reduce noise in every computational gate. We focus on the well-known schemes of periodic (or universal) DD and its extension, concatenated DD, for scaling up its power. The qualitative conclusions from our analysis of these two schemes nevertheless apply to other DD approaches. In the presence of noisy pulses, DD does not always mitigate errors. It does so only when the added noise from the imperfect DD pulses does not outweigh the increased ability in averaging away the original background noise. We present break-even conditions that delineate when DD is useful, and further find that there is a limit in the performance of concatenated DD, specifically in how far one can concatenate the DD pulse sequences before the added noise no longer offers any further benefit in error mitigation.

DOI
10.1103/physreva.107.032615

Related papers

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

Pulse-level Noise Mitigation on Quantum Applications

Siyuan Niu, Aida Todri‐Sanial

Currently available quantum computers are prone to errors. Circuit optimization and error mitigation methods are needed to design quantum circuits to achieve better fidelity when executed on NISQ hardware. Dynamical decoupling (DD) is generally used to suppress the decoherence error and different DD strategies have been proposed. Moreover, the circuit fidelity can be improved by pulselevel optimization, such as creating hardware-native pulse-efficient gates. This paper implements all the popular DD sequences and evaluates their performances on IBM quantum chips with different characteristics for various well-known quantum applications. Also, we investigate combining DD with pulse-level optimization method and apply them to QAOA to solve Max-Cut problem. Based on the experimental results, we found that DD can be a benefit for only certain types of quantum algorithms, while the combination of DD and pulse-level optimization methods always has a positive impact. Finally, we provide several guidelines for users to learn how to use these pulse-level noise mitigation methods to build circuits for quantum applications with high fidelity.

•Apr 4, 2022•3 citations

Simulation-Based Comparative Study of Dynamical Decoupling Sequences under Structured Noise Models

Trivikramahimamshu S. Dorbala, Baladitya Suri

Abstract Dynamical decoupling (DD) is a quantum error-mitigation technique based on applying sequences of control pulses to suppress decoherence. Here we perform a numerical study to compare different DD protocols, namely Carr-Purcell-Meiboom-Gill (CPMG), Periodic Dynamical Decoupling (PDD), Concatenated Dynamical Decoupling (CDD) and Uhrig Dynamical Decoupling (UDD) applied to three commonly used noise power spectral densities: (i) white, (ii) 1/f, (iii) 1/f 2 and their hybrid combinations. By ignoring qubit relaxation, we simulate these protocols focusing purely on dephasing noise. We then consider independent multi-axial noise with uniaxial control pulses. The effective coherence times T2,eff are extracted for each case and compared with the baseline free induction decay T ∗ 2 [6]. In all these simulations, the time-domain decoherence profiles follow a stretched exponential form ∼ exp −(t/T2,eff) β with the effective coherence times dependent on the noise spectrum considered, the strength of the noise, and the DD sequence employed. An exception is observed for the UDD under specific noise conditions where it cannot be described by a simple stretched exponential decay form.

•Oct 1, 2025•0 citations

Combining dynamical decoupling with fault-tolerant quantum computation

Hui Khoon Ng, Daniel A. Lidar, John P. Preskill

We study how dynamical decoupling (DD) pulse sequences can improve the reliability of quantum computers. We prove upper bounds on the accuracy of DD-protected quantum gates and derive sufficient conditions for DD-protected gates to outperform unprotected gates. Under suitable conditions, fault-tolerant quantum circuits constructed from DD-protected gates can tolerate stronger noise and have a lower overhead cost than fault-tolerant circuits constructed from unprotected gates. Our accuracy estimates depend on the dynamics of the bath that couples to the quantum computer and can be expressed either in terms of the operator norm of the bath's Hamiltonian or in terms of the power spectrum of bath correlations; we explain in particular how the performance of recursively generated concatenated pulse sequences can be analyzed from either viewpoint. Our results apply to Hamiltonian noise models with limited spatial correlations.

arXiv:0911.3202•Physical Review A•Jul 5, 2011•113 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•0 citations

Effects of imperfect pulses on dynamical decoupling using quantum trajectory method

Lin-Ze He, Man-Chao Zhang, Chun-Wang Wu +3 more

The dynamical decoupling (DD) method is widely adopted to preserve coherence in different quantum systems. In the case of ideal pulses, its effects on the suppression of noise can be analytically described by the mathematical form of filter function. However, in practical experiments, the unavoidable pulse errors limit the efficiency of DD. In this paper, we study the effects of imperfect pulses on DD efficiency based on quantum trajectories. By directly generating a pseudo noise sequence correlated in time, we can explore the performance of DD with different pulse errors in the typical noise environment. It shows that, for the typical 1/ f noise environment, the phase error of operational pulses severely affects the performance of noise suppression, while the detuning and intensity errors have less influence. Also, we get the thresholds of these errors for efficient DD under the given experimental conditions. Our method can be widely applied to guide practical DD experimental implementation.

Chinese Physics B•Dec 1, 2018•4 citations
Dynamical decoupling (DD) refers to a well-established family of methods for error mitigation, comprising pulse sequences aimed at averaging away slowly evolving noise in quantum systems. Here we revisit the question of its efficacy in the presence of noisy pulses in scenarios important for quantum devices today: pulses with gate control errors, and the computational setting where DD is used to reduce noise in every computational gate. We focus on the well-known schemes of periodic (or universal) DD and its extension, concatenated DD, for scaling up its power. The qualitative conclusions from our analysis of these two schemes nevertheless apply to other DD approaches. In the presence of noisy pulses, DD does not always mitigate errors. It does so only when the added noise from the imperfect DD pulses does not outweigh the increased ability in averaging away the original background noise. We present break-even conditions that delineate when DD is useful, and further find that there is a limit in the performance of concatenated DD, specifically in how far one can concatenate the DD pulse sequences before the added noise no longer offers any further benefit in error mitigation.
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.
Currently available quantum computers are prone to errors. Circuit optimization and error mitigation methods are needed to design quantum circuits to achieve better fidelity when executed on NISQ hardware. Dynamical decoupling (DD) is generally used to suppress the decoherence error and different DD strategies have been proposed. Moreover, the circuit fidelity can be improved by pulselevel optimization, such as creating hardware-native pulse-efficient gates. This paper implements all the popular DD sequences and evaluates their performances on IBM quantum chips with different characteristics for various well-known quantum applications. Also, we investigate combining DD with pulse-level optimization method and apply them to QAOA to solve Max-Cut problem. Based on the experimental results, we found that DD can be a benefit for only certain types of quantum algorithms, while the combination of DD and pulse-level optimization methods always has a positive impact. Finally, we provide several guidelines for users to learn how to use these pulse-level noise mitigation methods to build circuits for quantum applications with high fidelity.
Abstract Dynamical decoupling (DD) is a quantum error-mitigation technique based on applying sequences of control pulses to suppress decoherence. Here we perform a numerical study to compare different DD protocols, namely Carr-Purcell-Meiboom-Gill (CPMG), Periodic Dynamical Decoupling (PDD), Concatenated Dynamical Decoupling (CDD) and Uhrig Dynamical Decoupling (UDD) applied to three commonly used noise power spectral densities: (i) white, (ii) 1/f, (iii) 1/f 2 and their hybrid combinations. By ignoring qubit relaxation, we simulate these protocols focusing purely on dephasing noise. We then consider independent multi-axial noise with uniaxial control pulses. The effective coherence times T2,eff are extracted for each case and compared with the baseline free induction decay T ∗ 2 [6]. In all these simulations, the time-domain decoherence profiles follow a stretched exponential form ∼ exp −(t/T2,eff) β with the effective coherence times dependent on the noise spectrum considered, the strength of the noise, and the DD sequence employed. An exception is observed for the UDD under specific noise conditions where it cannot be described by a simple stretched exponential decay form.
We study how dynamical decoupling (DD) pulse sequences can improve the reliability of quantum computers. We prove upper bounds on the accuracy of DD-protected quantum gates and derive sufficient conditions for DD-protected gates to outperform unprotected gates. Under suitable conditions, fault-tolerant quantum circuits constructed from DD-protected gates can tolerate stronger noise and have a lower overhead cost than fault-tolerant circuits constructed from unprotected gates. Our accuracy estimates depend on the dynamics of the bath that couples to the quantum computer and can be expressed either in terms of the operator norm of the bath's Hamiltonian or in terms of the power spectrum of bath correlations; we explain in particular how the performance of recursively generated concatenated pulse sequences can be analyzed from either viewpoint. Our results apply to Hamiltonian noise models with limited spatial correlations.
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.
The dynamical decoupling (DD) method is widely adopted to preserve coherence in different quantum systems. In the case of ideal pulses, its effects on the suppression of noise can be analytically described by the mathematical form of filter function. However, in practical experiments, the unavoidable pulse errors limit the efficiency of DD. In this paper, we study the effects of imperfect pulses on DD efficiency based on quantum trajectories. By directly generating a pseudo noise sequence correlated in time, we can explore the performance of DD with different pulse errors in the typical noise environment. It shows that, for the typical 1/ f noise environment, the phase error of operational pulses severely affects the performance of noise suppression, while the detuning and intensity errors have less influence. Also, we get the thresholds of these errors for efficient DD under the given experimental conditions. Our method can be widely applied to guide practical DD experimental implementation.