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

Towards robust dynamical decoupling and high fidelity adiabatic quantum computation

Gregory Quiroz

Published Dec 9, 2013• 0 citations
Publisher

Abstract

Quantum computation (QC) relies on the ability to implement high-fidelity quantum gate operations and successfully preserve quantum state coherence. One of the most challenging obstacles for reliable QC is overcoming the inevitable interaction between a quantum system and its environment. Unwanted interactions result in decoherence processes that cause quantum states to deviate from a desired evolution, consequently leading to computational errors and loss of coherence. Dynamical decoupling (DD) is one such method, which seeks to attenuate the effects of decoherence by applying strong and expeditious control pulses solely to the system. Provided the pulses are applied over a time duration sufficiently shorter than the correlation time associated with the environment dynamics, DD effectively averages out undesirable interactions and preserves quantum states with a low probability of error, or fidelity loss. In this study various aspects of this approach are studied from sequence construction to applications of DD to protecting QC. First, a comprehensive examination of the error suppression properties of a near-optimal DD approach is given to understand the relationship between error suppression capabilities and the number of required DD control pulses in the case of ideal, instantaneous pulses. While such considerations are instructive for examining DD efficiency, i.e., performance vs the number of control pulses, high-fidelity DD in realizable systems is difficult to achieve due to intrinsic pulse imperfections which further contribute to decoherence. As a second consideration, it is shown how one can overcome this hurdle and achieve robustness and recover high-fidelity DD in the presence of faulty control pulses using Genetic Algorithm optimization and sequence symmetrization. Thirdly, to illustrate the implementation of DD in conjunction with QC, the utilization of DD and quantum error correction codes (QECCs) as a protection method for adiabatic quantum computing (AQC) is discussed. A performance comparison between two deterministic DD schemes is given, where preference towards one particular method is found due to sequence structure and procedure from which higher accuracy sequences are generated.

DOI
10.25549/usctheses-c3-357095

Related papers

Dynamical Decoupling (DD) to Improve Fidelity in Quantum Computing

Muhammad Haryo Ramadhani, Maman Abdurohman, Hilal Hudan Nuha

Dynamical decoupling (DD) and Decoherence free subspace (DFS) are powerful techniques in quantum computing aimed at enhancing fidelity by mitigating the detrimental effects of noise and environmental interactions. In quantum systems, noise and decoherence can degrade the coherence of quantum states, leading to errors and reduced computational accuracy. DD employs carefully designed sequences of control pulses to periodically intervene and counteract these undesired interactions, while DFS utilizes subspace encoding techniques to protect quantum information from decoherence. To evaluate and compare the fidelity achieved by DD and DFS, this paper presents a series of experiments considering the effect of time and the number of qubits. The experiments provide valuable insights into the performance of both methods under different conditions. By systematically examining the fidelity results, the impact of time and the scaling behavior with increasing qubits can be assessed. The experimental findings showcase the effectiveness of DD in reducing the impact of noise and extending the coherence time of quantum states. By strategically manipulating the quantum system, DD minimizes error accumulation and preserves the integrity of fragile quantum information. It is observed that the decrease in fidelity with increasing t is relatively small and gradual. Despite being outperformed by DD, the DFS method exhibits robustness and maintains a high degree of fidelity even in the presence of extended time durations.

International Conference on Data Science and Its Applications (ICoDSA)•Aug 9, 2023•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

Optimized dynamical protection of nonclassical correlation in a quantum algorithm

V. S. Anjusha, T. S. Mahesh

A quantum memory interacts with its environment and loses information via decoherence as well as incoherence. A robust quantum control that prepares, preserves, and manipulates nonclassical correlations even in the presence of environmental influence is of paramount importance in quantum information processing. A well-known technique to suppress decoherence, namely Dynamical Decoupling (DD), consists of a sequence of rapid flips applied to the system in order to refocus the system-environment interactions. In this work, we integrate DD with quantum gates using optimal control techniques to realize robust quantum gates which offer protection against decoherence. To investigate the protection of non-classical correlation, we study the evolution of quantum discord in Grover's search algorithm implemented with dynamically protected gates. Using a two-qubit NMR system, we experimentally demonstrate a significant protection against decoherence and incoherence. We find better performances by phase alternating DD sequences with suitable spacings between the DD pulses. Interestingly, we also find that DD sequences based on $π/2$ pulses perform as well as or even better than those with $π$ pulses in protecting the non-classical correlation. We also support the experimental results by analyzing the robustness of various DD schemes.

arXiv:1802.02792•Feb 8, 2018•1 citation

Dynamical protection of nonclassical correlation in a quantum algorithm

V. S. Anjusha, T. S. Mahesh

A quantum memory interacts with its environment and loses information via decoherence as well as incoherence. A robust quantum control that prepares, preserves, and manipulates nonclassical correlations even in the presence of environmental influence is of paramount importance in quantum information processing. A well-known technique to suppress decoherence, namely Dynamical Decoupling (DD), consists of a sequence of rapid flips applied to the system in order to refocus the system-environment interactions. In this work, we integrate DD with quantum gates using optimal control techniques to realize robust quantum gates which offer protection against decoherence. To investigate the protection of non-classical correlation, we study the evolution of quantum discord in Grover's search algorithm implemented with dynamically protected gates. Using a two-qubit NMR system, we experimentally demonstrate a significant protection against decoherence and incoherence. We find better performances by phase alternating DD sequences with suitable spacings between the DD pulses. Interestingly, we also find that DD sequences based on $\pi/2$ pulses perform as well as or even better than those with $\pi$ pulses in protecting the non-classical correlation. We also support the experimental results by analyzing the robustness of various DD schemes.

•Feb 8, 2018•0 citations

Robust dynamical decoupling

Alexandre M. Souza, Gonzalo A. Álvarez, Dieter Suter

Quantum computers, which process information encoded in quantum mechanical systems, hold the potential to solve some of the hardest computational problems. A substantial obstacle for the further development of quantum computers is the fact that the lifetime of quantum information is usually too short to allow practical computation. A promising method for increasing the lifetime, known as dynamical decoupling (DD), consists of applying a periodic series of inversion pulses to the quantum bits. In the present review, we give an overview of this technique and compare different pulse sequences proposed earlier. We show that pulse imperfections, which are always present in experimental implementations, limit the performance of DD. The loss of coherence due to the accumulation of pulse errors can even exceed the perturbation from the environment. This effect can be largely eliminated by a judicious design of pulses and sequences. The corresponding sequences are largely immune to pulse imperfections and provide an increase of the coherence time of the system by several orders of magnitude.

arXiv:1110.6334•Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Sep 3, 2012•231 citations

Effects of Dynamical Decoupling and Pulse-Level Optimizations on IBM Quantum Computers

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 pulse-level 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 noise mitigation methods to build circuits for quantum applications with high fidelity on IBM quantum computers.

arXiv:2204.01471•IEEE Transactions on Quantum Engineering•Jan 1, 2022•49 citations
Quantum computation (QC) relies on the ability to implement high-fidelity quantum gate operations and successfully preserve quantum state coherence. One of the most challenging obstacles for reliable QC is overcoming the inevitable interaction between a quantum system and its environment. Unwanted interactions result in decoherence processes that cause quantum states to deviate from a desired evolution, consequently leading to computational errors and loss of coherence. Dynamical decoupling (DD) is one such method, which seeks to attenuate the effects of decoherence by applying strong and expeditious control pulses solely to the system. Provided the pulses are applied over a time duration sufficiently shorter than the correlation time associated with the environment dynamics, DD effectively averages out undesirable interactions and preserves quantum states with a low probability of error, or fidelity loss. In this study various aspects of this approach are studied from sequence construction to applications of DD to protecting QC. First, a comprehensive examination of the error suppression properties of a near-optimal DD approach is given to understand the relationship between error suppression capabilities and the number of required DD control pulses in the case of ideal, instantaneous pulses. While such considerations are instructive for examining DD efficiency, i.e., performance vs the number of control pulses, high-fidelity DD in realizable systems is difficult to achieve due to intrinsic pulse imperfections which further contribute to decoherence. As a second consideration, it is shown how one can overcome this hurdle and achieve robustness and recover high-fidelity DD in the presence of faulty control pulses using Genetic Algorithm optimization and sequence symmetrization. Thirdly, to illustrate the implementation of DD in conjunction with QC, the utilization of DD and quantum error correction codes (QECCs) as a protection method for adiabatic quantum computing (AQC) is discussed. A performance comparison between two deterministic DD schemes is given, where preference towards one particular method is found due to sequence structure and procedure from which higher accuracy sequences are generated.
Dynamical decoupling (DD) and Decoherence free subspace (DFS) are powerful techniques in quantum computing aimed at enhancing fidelity by mitigating the detrimental effects of noise and environmental interactions. In quantum systems, noise and decoherence can degrade the coherence of quantum states, leading to errors and reduced computational accuracy. DD employs carefully designed sequences of control pulses to periodically intervene and counteract these undesired interactions, while DFS utilizes subspace encoding techniques to protect quantum information from decoherence. To evaluate and compare the fidelity achieved by DD and DFS, this paper presents a series of experiments considering the effect of time and the number of qubits. The experiments provide valuable insights into the performance of both methods under different conditions. By systematically examining the fidelity results, the impact of time and the scaling behavior with increasing qubits can be assessed. The experimental findings showcase the effectiveness of DD in reducing the impact of noise and extending the coherence time of quantum states. By strategically manipulating the quantum system, DD minimizes error accumulation and preserves the integrity of fragile quantum information. It is observed that the decrease in fidelity with increasing t is relatively small and gradual. Despite being outperformed by DD, the DFS method exhibits robustness and maintains a high degree of fidelity even in the presence of extended time durations.
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.
A quantum memory interacts with its environment and loses information via decoherence as well as incoherence. A robust quantum control that prepares, preserves, and manipulates nonclassical correlations even in the presence of environmental influence is of paramount importance in quantum information processing. A well-known technique to suppress decoherence, namely Dynamical Decoupling (DD), consists of a sequence of rapid flips applied to the system in order to refocus the system-environment interactions. In this work, we integrate DD with quantum gates using optimal control techniques to realize robust quantum gates which offer protection against decoherence. To investigate the protection of non-classical correlation, we study the evolution of quantum discord in Grover's search algorithm implemented with dynamically protected gates. Using a two-qubit NMR system, we experimentally demonstrate a significant protection against decoherence and incoherence. We find better performances by phase alternating DD sequences with suitable spacings between the DD pulses. Interestingly, we also find that DD sequences based on π/2π/2π/2 pulses perform as well as or even better than those with πππ pulses in protecting the non-classical correlation. We also support the experimental results by analyzing the robustness of various DD schemes.
A quantum memory interacts with its environment and loses information via decoherence as well as incoherence. A robust quantum control that prepares, preserves, and manipulates nonclassical correlations even in the presence of environmental influence is of paramount importance in quantum information processing. A well-known technique to suppress decoherence, namely Dynamical Decoupling (DD), consists of a sequence of rapid flips applied to the system in order to refocus the system-environment interactions. In this work, we integrate DD with quantum gates using optimal control techniques to realize robust quantum gates which offer protection against decoherence. To investigate the protection of non-classical correlation, we study the evolution of quantum discord in Grover's search algorithm implemented with dynamically protected gates. Using a two-qubit NMR system, we experimentally demonstrate a significant protection against decoherence and incoherence. We find better performances by phase alternating DD sequences with suitable spacings between the DD pulses. Interestingly, we also find that DD sequences based on π/2\pi/2π/2 pulses perform as well as or even better than those with π\piπ pulses in protecting the non-classical correlation. We also support the experimental results by analyzing the robustness of various DD schemes.
Quantum computers, which process information encoded in quantum mechanical systems, hold the potential to solve some of the hardest computational problems. A substantial obstacle for the further development of quantum computers is the fact that the lifetime of quantum information is usually too short to allow practical computation. A promising method for increasing the lifetime, known as dynamical decoupling (DD), consists of applying a periodic series of inversion pulses to the quantum bits. In the present review, we give an overview of this technique and compare different pulse sequences proposed earlier. We show that pulse imperfections, which are always present in experimental implementations, limit the performance of DD. The loss of coherence due to the accumulation of pulse errors can even exceed the perturbation from the environment. This effect can be largely eliminated by a judicious design of pulses and sequences. The corresponding sequences are largely immune to pulse imperfections and provide an increase of the coherence time of the system by several orders of magnitude.
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 pulse-level 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 noise mitigation methods to build circuits for quantum applications with high fidelity on IBM quantum computers.