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

Rigorous bounds for optimal dynamical decoupling

Götz Silvester Uhrig, Daniel A. Lidar

Published Jul 2, 2010• 42 citations
arXivHTMLPDF

Abstract

We present rigorous performance bounds for the optimal dynamical decoupling pulse sequence protecting a quantum bit (qubit) against pure dephasing. Our bounds apply under the assumption of instantaneous pulses and of bounded perturbing environment and qubit-environment Hamiltonians such as those realized by baths of nuclear spins in quantum dots. We show that if the total sequence time is fixed the optimal sequence can be used to make the distance between the protected and unperturbed qubit states arbitrarily small in the number of applied pulses. If, on the other hand, the minimum pulse interval is fixed and the total sequence time is allowed to scale with the number of pulses, then longer sequences need not always be advantageous. The rigorous bound may serve as a testbed for approximate treatments of optimal decoupling in bounded models of decoherence.

DOI
10.1103/physreva.82.012301

Related papers

Rigorous performance bounds for quadratic and nested dynamical decoupling

Yuhou Xia, Götz Silvester Uhrig, Daniel A. Lidar

We present rigorous performance bounds for the quadratic dynamical decoupling pulse sequence which protects a qubit from general decoherence, and for its nested generalization to an arbitrary number of qubits. Our bounds apply under the assumptions of instantaneous pulses and of bounded perturbing environment and qubit-environment Hamiltonians such as those realized by baths of nuclear spins in quantum dots. We prove that if the total sequence time is fixed then the trace-norm distance between the unperturbed and protected system states can be made arbitrarily small by increasing the number of applied pulses.

arXiv:1111.3289•Physical Review A•Dec 29, 2011•11 citations

Rigorous bounds on the performance of a hybrid dynamical-decoupling quantum-computing scheme

Kaveh Khodjasteh, Daniel A. Lidar

We study dynamical decoupling in a multiqubit setting, where it is combined with quantum logic gates. This is illustrated in terms of computation using Heisenberg interactions only, where global decoupling pulses commute with the computation. We derive a rigorous error bound on the trace distance or fidelity between the desired computational state and the actual time-evolved state, for a system subject to coupling to a bounded-strength bath. The bound is expressed in terms of the operator norm of the effective Hamiltonian generating the evolution in the presence of decoupling and logic operations. We apply the bound to the case of periodic pulse sequences and find that in order to maintain a constant trace distance or fidelity, the number of cycles---at fixed pulse interval and width---should scale in inverse proportion to the square of the number of qubits. This sets a scalability limit on the protection of quantum computation using periodic dynamical decoupling.

arXiv:0803.4320•Physical Review A•Jul 29, 2008•50 citations

Optimal pulse spacing for dynamical decoupling in the presence of a purely dephasing spin bath

Ashok Ajoy, Gonzalo A. Álvarez, Dieter Suter

Maintaining quantum coherence is a crucial requirement for quantum computation; hence protecting quantum systems against their irreversible corruption due to environmental noise is an important open problem. Dynamical decoupling (DD) is an effective method for reducing decoherence with a low control overhead. It also plays an important role in quantum metrology, where, for instance, it is employed in multiparameter estimation. While a sequence of equidistant control pulses [the Carr-Purcell-Meiboom-Gill (CPMG) sequence] has been ubiquitously used for decoupling, Uhrig recently proposed that a nonequidistant pulse sequence [the Uhrig dynamic decoupling (UDD) sequence] may enhance DD performance, especially for systems where the spectral density of the environment has a sharp frequency cutoff. On the other hand, equidistant sequences outperform UDD for soft cutoffs. The relative advantage provided by UDD for intermediate regimes is not clear. In this paper, we analyze the relative DD performance in this regime experimentally, using solid-state nuclear magnetic resonance. Our system qubits are $^{13}\mathrm{C}$ nuclear spins and the environment consists of a $^{1}\mathrm{H}$ nuclear spin bath whose spectral density is close to a normal (Gaussian) distribution. We find that in the presence of such a bath, the CPMG sequence outperforms the UDD sequence. An analogy between dynamical decoupling and interference effects in optics provides an intuitive explanation as to why the CPMG sequence performs better than any nonequidistant DD sequence in the presence of this kind of environmental noise.

arXiv:1011.6243•Physical Review A•Mar 8, 2011•116 citations

Efficient coherent control by sequences of pulses of finite duration

Götz Silvester Uhrig, Stefano Pasini

Reliable long-time storage of arbitrary quantum states is a key element of quantum information processing. In order to dynamically decouple a spin or quantum bit from a dephasing environment by non-instantaneous pulses, we introduce an optimized sequence of N control π pulses that are realistic in the sense that they have a finite duration and a finite amplitude. We show that optimized dynamical decoupling is still applicable and that higher-order decoupling can be reached if shaped pulses are implemented. The sequence suppresses decoherence up to the order , with T being the total duration of the sequence and τ mx the maximum length of the pulses. The exponent depends on the shape of the pulse. Based on existing experiments, a concrete setup for the verification of the properties of the advocated sequence is proposed.

arXiv:0906.3605•New Journal of Physics•Apr 1, 2010•40 citations

Towards optimized suppression of dephasing in systems subject to pulse timing constraints

Thomas E. Hodgson, Lorenza Viola, Irene D’Amico

We investigate the effectiveness of different dynamical decoupling protocols for storage of a single qubit in the presence of a purely dephasing bosonic bath, with emphasis on comparing quantum coherence preservation under uniform versus nonuniform delay times between pulses. In the limit of instantaneous bit-flip pulses, this is accomplished by establishing a different representation of the controlled qubit evolution, where the decoherence behavior after an arbitrary number of pulses is directly expressed in terms of the uncontrolled decoherence function. In particular, analytical expressions are obtained for approximation of the long- and short-term coherence behavior for both Ohmic and supra-Ohmic environments. By focusing on the realistic case of pure dephasing in an excitonic qubit, we quantitatively assess the impact of physical constraints on achievable pulse separations, and show that little advantage of high-level decoupling schemes based on concatenated or optimal design may be expected if pulses cannot be applied sufficiently fast. In such constrained scenarios, we demonstrate how simple modifications of repeated periodic-echo protocols can offer significantly improved coherence preservation in realistic parameter regimes. We expect similar conclusions to be relevant to other constrained qubit devices exposed to quantum or classical phase noise.

arXiv:0912.2035•Physical Review A•Jun 16, 2010•37 citations

Group-Theoretic Reinforcement Learning of Dynamical Decoupling Sequences

Charles Marrder, Shuo Sun, Murray J. Holland

Dynamical decoupling seeks to mitigate phase decoherence in qubits by applying a carefully designed sequence of effectively instantaneous electromagnetic pulses. Although analytic solutions exist for pulse timings that are optimal under specific noise regimes, identifying the optimal timings for a realistic noise spectrum remains challenging. We propose a reinforcement learning (RL)-based method for designing pulse sequences on qubits. Our novel action set enables the RL agent to efficiently navigate this inherently non-convex optimization landscape. The action set, derived from Thompson's group $F$, is applicable to a broad class of sequential decision problems whose states can be represented as bounded sequences. We demonstrate that our RL agent can learn pulse sequences that minimize dephasing without requiring explicit knowledge of the underlying noise spectrum. This work opens the possibility for real-time learning of optimal dynamical decoupling sequences on qubits which are dephasing-limited. The model-free nature of our algorithm suggests that the agent may ultimately learn optimal pulse sequences even in the presence of unmodeled physical effects, such as pulse errors or non-Gaussian noise.

quant-pharXiv:2512.13890•Dec 17, 2025•0 citations
We present rigorous performance bounds for the optimal dynamical decoupling pulse sequence protecting a quantum bit (qubit) against pure dephasing. Our bounds apply under the assumption of instantaneous pulses and of bounded perturbing environment and qubit-environment Hamiltonians such as those realized by baths of nuclear spins in quantum dots. We show that if the total sequence time is fixed the optimal sequence can be used to make the distance between the protected and unperturbed qubit states arbitrarily small in the number of applied pulses. If, on the other hand, the minimum pulse interval is fixed and the total sequence time is allowed to scale with the number of pulses, then longer sequences need not always be advantageous. The rigorous bound may serve as a testbed for approximate treatments of optimal decoupling in bounded models of decoherence.
We present rigorous performance bounds for the quadratic dynamical decoupling pulse sequence which protects a qubit from general decoherence, and for its nested generalization to an arbitrary number of qubits. Our bounds apply under the assumptions of instantaneous pulses and of bounded perturbing environment and qubit-environment Hamiltonians such as those realized by baths of nuclear spins in quantum dots. We prove that if the total sequence time is fixed then the trace-norm distance between the unperturbed and protected system states can be made arbitrarily small by increasing the number of applied pulses.
We study dynamical decoupling in a multiqubit setting, where it is combined with quantum logic gates. This is illustrated in terms of computation using Heisenberg interactions only, where global decoupling pulses commute with the computation. We derive a rigorous error bound on the trace distance or fidelity between the desired computational state and the actual time-evolved state, for a system subject to coupling to a bounded-strength bath. The bound is expressed in terms of the operator norm of the effective Hamiltonian generating the evolution in the presence of decoupling and logic operations. We apply the bound to the case of periodic pulse sequences and find that in order to maintain a constant trace distance or fidelity, the number of cycles---at fixed pulse interval and width---should scale in inverse proportion to the square of the number of qubits. This sets a scalability limit on the protection of quantum computation using periodic dynamical decoupling.
Maintaining quantum coherence is a crucial requirement for quantum computation; hence protecting quantum systems against their irreversible corruption due to environmental noise is an important open problem. Dynamical decoupling (DD) is an effective method for reducing decoherence with a low control overhead. It also plays an important role in quantum metrology, where, for instance, it is employed in multiparameter estimation. While a sequence of equidistant control pulses [the Carr-Purcell-Meiboom-Gill (CPMG) sequence] has been ubiquitously used for decoupling, Uhrig recently proposed that a nonequidistant pulse sequence [the Uhrig dynamic decoupling (UDD) sequence] may enhance DD performance, especially for systems where the spectral density of the environment has a sharp frequency cutoff. On the other hand, equidistant sequences outperform UDD for soft cutoffs. The relative advantage provided by UDD for intermediate regimes is not clear. In this paper, we analyze the relative DD performance in this regime experimentally, using solid-state nuclear magnetic resonance. Our system qubits are 13C^{13}\mathrm{C}13C nuclear spins and the environment consists of a 1H^{1}\mathrm{H}1H nuclear spin bath whose spectral density is close to a normal (Gaussian) distribution. We find that in the presence of such a bath, the CPMG sequence outperforms the UDD sequence. An analogy between dynamical decoupling and interference effects in optics provides an intuitive explanation as to why the CPMG sequence performs better than any nonequidistant DD sequence in the presence of this kind of environmental noise.
Reliable long-time storage of arbitrary quantum states is a key element of quantum information processing. In order to dynamically decouple a spin or quantum bit from a dephasing environment by non-instantaneous pulses, we introduce an optimized sequence of N control π pulses that are realistic in the sense that they have a finite duration and a finite amplitude. We show that optimized dynamical decoupling is still applicable and that higher-order decoupling can be reached if shaped pulses are implemented. The sequence suppresses decoherence up to the order , with T being the total duration of the sequence and τ mx the maximum length of the pulses. The exponent depends on the shape of the pulse. Based on existing experiments, a concrete setup for the verification of the properties of the advocated sequence is proposed.
We investigate the effectiveness of different dynamical decoupling protocols for storage of a single qubit in the presence of a purely dephasing bosonic bath, with emphasis on comparing quantum coherence preservation under uniform versus nonuniform delay times between pulses. In the limit of instantaneous bit-flip pulses, this is accomplished by establishing a different representation of the controlled qubit evolution, where the decoherence behavior after an arbitrary number of pulses is directly expressed in terms of the uncontrolled decoherence function. In particular, analytical expressions are obtained for approximation of the long- and short-term coherence behavior for both Ohmic and supra-Ohmic environments. By focusing on the realistic case of pure dephasing in an excitonic qubit, we quantitatively assess the impact of physical constraints on achievable pulse separations, and show that little advantage of high-level decoupling schemes based on concatenated or optimal design may be expected if pulses cannot be applied sufficiently fast. In such constrained scenarios, we demonstrate how simple modifications of repeated periodic-echo protocols can offer significantly improved coherence preservation in realistic parameter regimes. We expect similar conclusions to be relevant to other constrained qubit devices exposed to quantum or classical phase noise.
Dynamical decoupling seeks to mitigate phase decoherence in qubits by applying a carefully designed sequence of effectively instantaneous electromagnetic pulses. Although analytic solutions exist for pulse timings that are optimal under specific noise regimes, identifying the optimal timings for a realistic noise spectrum remains challenging. We propose a reinforcement learning (RL)-based method for designing pulse sequences on qubits. Our novel action set enables the RL agent to efficiently navigate this inherently non-convex optimization landscape. The action set, derived from Thompson's group FFF, is applicable to a broad class of sequential decision problems whose states can be represented as bounded sequences. We demonstrate that our RL agent can learn pulse sequences that minimize dephasing without requiring explicit knowledge of the underlying noise spectrum. This work opens the possibility for real-time learning of optimal dynamical decoupling sequences on qubits which are dephasing-limited. The model-free nature of our algorithm suggests that the agent may ultimately learn optimal pulse sequences even in the presence of unmodeled physical effects, such as pulse errors or non-Gaussian noise.