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

Quadratic dynamical decoupling: Universality proof and error analysis

Wan-Jung Kuo, Daniel A. Lidar

Published Oct 17, 2011• 42 citations
arXivHTMLPDF

Abstract

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}}})$.

DOI
10.1103/physreva.84.042329

Related papers

Quadratic dynamical decoupling with nonuniform error suppression

Gregory Quiroz, Daniel A. Lidar

We analyze numerically the performance of the near-optimal quadratic dynamical decoupling (QDD) single-qubit decoherence errors suppression method [J. West et al., Phys. Rev. Lett. 104, 130501 (2010)]. The QDD sequence is formed by nesting two optimal Uhrig dynamical decoupling sequences for two orthogonal axes, comprising ${N}_{1}$ and ${N}_{2}$ pulses, respectively. Varying these numbers, we study the decoherence suppression properties of QDD directly by isolating the errors associated with each system basis operator present in the system-bath interaction Hamiltonian. Each individual error scales with the lowest order of the Dyson series, therefore immediately yielding the order of decoherence suppression. We show that the error suppression properties of QDD are dependent upon the parities of ${N}_{1}$ and ${N}_{2}$, and near-optimal performance is achieved for general single-qubit interactions when ${N}_{1}={N}_{2}$.

arXiv:1105.4303•Physical Review A•Oct 17, 2011•18 citations

Universality proof and analysis of generalized nested Uhrig dynamical decoupling

Wan-Jung Kuo, Gregory Quiroz, Gerardo A. Paz-Silva +1 more

Nested Uhrig dynamical decoupling (NUDD) is a highly efficient quantum error suppression scheme that builds on optimized single axis UDD sequences. We prove the universality of NUDD and analyze its suppression of different error types in the setting of generalized control pulses. We present an explicit lower bound for the decoupling order of each error type, which we relate to the sequence orders of the nested UDD layers. We find that the error suppression capabilities of NUDD are strongly dependent on the parities and relative magnitudes of all nested UDD sequence orders. This allows us to predict the optimal arrangement of sequence orders. We test and confirm our analysis using numerical simulations.

arXiv:1207.1665•Journal of Mathematical Physics•Dec 1, 2012•11 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•152 citations

Towards optimized dynamical error control and algorithms for quantum information processing

Wan-Jung Kuo

Two topics in the field of quantum information processing, optimized dynamical error suppression and quantum algorithms, are considered here. ? The computational errors induced by the surrounding environment is one of the main obstacles in building a quantum computer. Engineering powerful techniques to combat errors in quantum devices is highly demanding. In the first part of this thesis, I focus on one quantum error correction technique, dynamical decoupling (DD), introduced in Chapter 1. Chapter 2 is dedicated to nested UDD (NUDD), a highly efficient decoupling scheme that utilizes the decoupling characteristics of UDD by multi-layer nesting. UDD (1-layer NUDD) is an optimal DD method for eliminating single-qubit general dephasing, and QDD (2-layer NUDD) is a near-optimal DD method for eliminating one qubit general decoherence. I present a rigorous analytical proof of the performance and universality of QDD/NUDD, and obtain an explicit formula for the decoupling order of each error type, which elucidates the relationship between the error type and characteristics of NUDD. From the explicit formula, a NUDD scheme can be designed accordingly such that optimal efficiency of NUDD is achieved. Moreover, the highly efficient error cancellation mechanism is revealed by the analysis. The proof of QDD has been published in [31], and the proof of NUDD will be submitted for publication shortly. ? Chapter 3 is devoted to the Adiabatic Quantum Computation (AQC). In this work (published in [44]), a general time-optimal strategy, which in principle can optimize any quantum adiabatic algorithm for which the gap is known or can be estimated, is formulated. In addition, I present a natural differential-geometric framework for AQC.

•Jul 25, 2012•0 citations

Dynamical decoupling in common environment

Yu Pan, Hong-Ting Song, Zai-Rong Xi

Dynamical decoupling (DD) sequences were invented to eliminate the direct coupling between a qubit and its environment. We further investigate the possibility of decoupling the indirect qubit–qubit interaction induced by a common environment, and successfully find simplified solutions that preserve the bipartite quantum states to arbitrary order. Through analysing the exact dynamics of the controlled two-qubit density matrix, we have proven that applying independent Uhrig DD (UDD) on each qubit will effectively eliminate both the qubit–environment and indirect qubit–qubit couplings to the same order as in the single-qubit case, only if orders of the two UDD sequences have different parities. More specifically, UDD( n ) on one qubit with UDD( m ) on another are able to produce min ( n , m )th-order suppression while n + m is odd. Our results can be used to reduce the pulse number in relevant experiments for protecting bipartite quantum states, or dynamically manipulating the indirect interaction within a certain quantum gate and quantum bus.

arXiv:1211.4377•Journal of Physics B Atomic Molecular and Optical Physics•Sep 21, 2012•4 citations

Aperiodic dynamical decoupling sequences in the presence of pulse errors

Zhi‐Hui Wang, V. V. Dobrovitski

Dynamical decoupling (DD) is a promising tool for preserving the quantum states of qubits. However, small imperfections in the control pulses can seriously affect the fidelity of decoupling, and qualitatively change the evolution of the controlled system at long times. Using both analytical and numerical tools, we theoretically investigate the effect of the pulse errors accumulation for two aperiodic DD sequences, the Uhrig's DD UDD) protocol [G. S. Uhrig, Phys. Rev. Lett. {\bf 98}, 100504 (2007)], and the Quadratic DD (QDD) protocol [J. R. West, B. H. Fong and D. A. Lidar, Phys. Rev. Lett {\bf 104}, 130501 (2010)]. We consider the implementation of these sequences using the electron spins of phosphorus donors in silicon, where DD sequences are applied to suppress dephasing of the donor spins. The dependence of the decoupling fidelity on different initial states of the spins is the focus of our study. We investigate in detail the initial drop in the DD fidelity, and its long-term saturation. We also demonstrate that by applying the control pulses along different directions, the performance of QDD protocols can be noticeably improved, and explain the reason of such an improvement. Our results can be useful for future implementations of the aperiodic decoupling protocols, and for better understanding of the impact of errors on quantum control of spins.

arXiv:1101.0292•Journal of Physics B Atomic Molecular and Optical Physics•Jul 25, 2011•15 citations
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​).
We analyze numerically the performance of the near-optimal quadratic dynamical decoupling (QDD) single-qubit decoherence errors suppression method [J. West et al., Phys. Rev. Lett. 104, 130501 (2010)]. The QDD sequence is formed by nesting two optimal Uhrig dynamical decoupling sequences for two orthogonal axes, comprising N1{N}_{1}N1​ and N2{N}_{2}N2​ pulses, respectively. Varying these numbers, we study the decoherence suppression properties of QDD directly by isolating the errors associated with each system basis operator present in the system-bath interaction Hamiltonian. Each individual error scales with the lowest order of the Dyson series, therefore immediately yielding the order of decoherence suppression. We show that the error suppression properties of QDD are dependent upon the parities of N1{N}_{1}N1​ and N2{N}_{2}N2​, and near-optimal performance is achieved for general single-qubit interactions when N1=N2{N}_{1}={N}_{2}N1​=N2​.
Nested Uhrig dynamical decoupling (NUDD) is a highly efficient quantum error suppression scheme that builds on optimized single axis UDD sequences. We prove the universality of NUDD and analyze its suppression of different error types in the setting of generalized control pulses. We present an explicit lower bound for the decoupling order of each error type, which we relate to the sequence orders of the nested UDD layers. We find that the error suppression capabilities of NUDD are strongly dependent on the parities and relative magnitudes of all nested UDD sequence orders. This allows us to predict the optimal arrangement of sequence orders. We test and confirm our analysis using numerical simulations.
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.
Two topics in the field of quantum information processing, optimized dynamical error suppression and quantum algorithms, are considered here. ? The computational errors induced by the surrounding environment is one of the main obstacles in building a quantum computer. Engineering powerful techniques to combat errors in quantum devices is highly demanding. In the first part of this thesis, I focus on one quantum error correction technique, dynamical decoupling (DD), introduced in Chapter 1. Chapter 2 is dedicated to nested UDD (NUDD), a highly efficient decoupling scheme that utilizes the decoupling characteristics of UDD by multi-layer nesting. UDD (1-layer NUDD) is an optimal DD method for eliminating single-qubit general dephasing, and QDD (2-layer NUDD) is a near-optimal DD method for eliminating one qubit general decoherence. I present a rigorous analytical proof of the performance and universality of QDD/NUDD, and obtain an explicit formula for the decoupling order of each error type, which elucidates the relationship between the error type and characteristics of NUDD. From the explicit formula, a NUDD scheme can be designed accordingly such that optimal efficiency of NUDD is achieved. Moreover, the highly efficient error cancellation mechanism is revealed by the analysis. The proof of QDD has been published in [31], and the proof of NUDD will be submitted for publication shortly. ? Chapter 3 is devoted to the Adiabatic Quantum Computation (AQC). In this work (published in [44]), a general time-optimal strategy, which in principle can optimize any quantum adiabatic algorithm for which the gap is known or can be estimated, is formulated. In addition, I present a natural differential-geometric framework for AQC.
Dynamical decoupling (DD) sequences were invented to eliminate the direct coupling between a qubit and its environment. We further investigate the possibility of decoupling the indirect qubit–qubit interaction induced by a common environment, and successfully find simplified solutions that preserve the bipartite quantum states to arbitrary order. Through analysing the exact dynamics of the controlled two-qubit density matrix, we have proven that applying independent Uhrig DD (UDD) on each qubit will effectively eliminate both the qubit–environment and indirect qubit–qubit couplings to the same order as in the single-qubit case, only if orders of the two UDD sequences have different parities. More specifically, UDD( n ) on one qubit with UDD( m ) on another are able to produce min ( n , m )th-order suppression while n + m is odd. Our results can be used to reduce the pulse number in relevant experiments for protecting bipartite quantum states, or dynamically manipulating the indirect interaction within a certain quantum gate and quantum bus.
Dynamical decoupling (DD) is a promising tool for preserving the quantum states of qubits. However, small imperfections in the control pulses can seriously affect the fidelity of decoupling, and qualitatively change the evolution of the controlled system at long times. Using both analytical and numerical tools, we theoretically investigate the effect of the pulse errors accumulation for two aperiodic DD sequences, the Uhrig's DD UDD) protocol [G. S. Uhrig, Phys. Rev. Lett. {\bf 98}, 100504 (2007)], and the Quadratic DD (QDD) protocol [J. R. West, B. H. Fong and D. A. Lidar, Phys. Rev. Lett {\bf 104}, 130501 (2010)]. We consider the implementation of these sequences using the electron spins of phosphorus donors in silicon, where DD sequences are applied to suppress dephasing of the donor spins. The dependence of the decoupling fidelity on different initial states of the spins is the focus of our study. We investigate in detail the initial drop in the DD fidelity, and its long-term saturation. We also demonstrate that by applying the control pulses along different directions, the performance of QDD protocols can be noticeably improved, and explain the reason of such an improvement. Our results can be useful for future implementations of the aperiodic decoupling protocols, and for better understanding of the impact of errors on quantum control of spins.