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

Symmetry

Protectability of IBMQ Qubits by Dynamical Decoupling Technique

Arturo Mena, Lian-Ao Wu

Published Dec 26, 2022• 13 citations
Publisher

Abstract

We study the current effectiveness of the dynamical decoupling technique on a publicly accessible IBM quantum computer (IBMQ). This technique, also known as bang-bang decoupling or dynamical symmetrization, consists of applying sequences of pulses for protecting a qubit from decoherence by symmetrizing the qubit–environment interactions. Works in the field have studied sequences with different symmetries and carried out tests on IBMQ devices typically considering single-qubit states. We show that the simplest universal sequences can be interesting for preserving two-qubit states on the IBMQ device. For this, we considered a collection of single-qubit and two-qubit states. The results indicate that a simple dynamical decoupling approach using available IBMQ pulses is not enough for protecting a general single-qubit state without further care. Nevertheless, the technique is beneficial for the Bell states. This encouraged us to study logical qubit encodings such as |0⟩L≡|01⟩,|1⟩L≡|10⟩, where a quantum state has the form |ψab⟩=a|0⟩L+b|1⟩L. Thus, we explored the effectiveness of dynamical decoupling with a large set of two-qubit |ψab⟩ states, where a and b are real amplitudes. With this, we also determined that the |ψab⟩ states most benefiting from this dynamical decoupling approach and slowed down the decay of their survival probability.

DOI
10.3390/sym15010062

Related papers

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

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

Demonstration of Fidelity Improvement Using Dynamical Decoupling with Superconducting Qubits

Bibek Pokharel, Namit Anand, Benjamin Fortman +1 more

Quantum computers must be able to function in the presence of decoherence. The simplest strategy for decoherence reduction is dynamical decoupling (DD), which requires no encoding overhead and works by converting quantum gates into decoupling pulses. Here, using the IBM and Rigetti platforms, we demonstrate that the DD method is suitable for implementation in today's relatively noisy and small-scale cloud-based quantum computers. Using DD, we achieve substantial fidelity gains relative to unprotected, free evolution of individual superconducting transmon qubits. To a lesser degree, DD is also capable of protecting entangled two-qubit states. We show that dephasing and spontaneous emission errors are dominant in these systems, and that different DD sequences are capable of mitigating both effects. Unlike previous work demonstrating the use of quantum error correcting codes on the same platforms, we make no use of postselection and hence report unconditional fidelity improvements against natural decoherence.

arXiv:1807.08768•Physical Review Letters•Nov 29, 2018•208 citations

Concatenating dynamical decoupling with decoherence-free subspaces for quantum computation

Yong Zhang, Zheng-Wei Zhou, Bo Hao Yu +1 more

A scheme to implement a quantum computer subjected to decoherence and governed by an untunable qubit-qubit interaction is presented. By concatenating dynamical decoupling through bang-bang (BB) pulse with decoherence-free subspaces (DFSs) encoding, we protect the quantum computer from environment-induced decoherence that results in quantum information dissipating into the environment. For the inherent qubit-qubit interaction that is untunable in the quantum system, BB control plus DFSs encoding will eliminate its undesired effect which spoils quantum information in qubits. We show how this quantum system can be used to implement universal quantum computation.

arXiv:quant-ph/0311067•Physical Review A•Apr 20, 2004•14 citations

Optimized dynamical decoupling sequences in protecting two-qubit states

Yu Pan, Zai-Rong Xi, Jiangbin Gong

Aperiodic dynamical decoupling (DD) sequences of π pulses are of great interest to decoherence control and have been recently extended from single-qubit to two-qubit systems. If the environmental noise power spectrum is made available, then one may further optimize aperiodic DD sequences to reach higher efficiency of decoherence suppression than known universal schemes. This possibility is investigated in this work for the protection of two-qubit states, using an exactly solvable pure dephasing model including both local and nonlocal noise. The performance of optimized DD sequences in protecting two-qubit states is compared with that achieved by nested Uhrig's DD (nested-UDD) sequences, for several different types of noise spectrum. Except for the cases with noise spectrum decaying slowly in the high-frequency regime, optimized DD sequences with tens of control pulses can perform orders of magnitude better than that of nested-UDD. A two-qubit system with highly unbalanced local noise is also examined to shed more light on a recent experiment. Possible experiments that may be motivated by this work are discussed.

arXiv:1110.5101•Journal of Physics B Atomic Molecular and Optical Physics•Aug 9, 2011•22 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
We study the current effectiveness of the dynamical decoupling technique on a publicly accessible IBM quantum computer (IBMQ). This technique, also known as bang-bang decoupling or dynamical symmetrization, consists of applying sequences of pulses for protecting a qubit from decoherence by symmetrizing the qubit–environment interactions. Works in the field have studied sequences with different symmetries and carried out tests on IBMQ devices typically considering single-qubit states. We show that the simplest universal sequences can be interesting for preserving two-qubit states on the IBMQ device. For this, we considered a collection of single-qubit and two-qubit states. The results indicate that a simple dynamical decoupling approach using available IBMQ pulses is not enough for protecting a general single-qubit state without further care. Nevertheless, the technique is beneficial for the Bell states. This encouraged us to study logical qubit encodings such as |0⟩L≡|01⟩,|1⟩L≡|10⟩, where a quantum state has the form |ψab⟩=a|0⟩L+b|1⟩L. Thus, we explored the effectiveness of dynamical decoupling with a large set of two-qubit |ψab⟩ states, where a and b are real amplitudes. With this, we also determined that the |ψab⟩ states most benefiting from this dynamical decoupling approach and slowed down the decay of their survival probability.
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.
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.
Quantum computers must be able to function in the presence of decoherence. The simplest strategy for decoherence reduction is dynamical decoupling (DD), which requires no encoding overhead and works by converting quantum gates into decoupling pulses. Here, using the IBM and Rigetti platforms, we demonstrate that the DD method is suitable for implementation in today's relatively noisy and small-scale cloud-based quantum computers. Using DD, we achieve substantial fidelity gains relative to unprotected, free evolution of individual superconducting transmon qubits. To a lesser degree, DD is also capable of protecting entangled two-qubit states. We show that dephasing and spontaneous emission errors are dominant in these systems, and that different DD sequences are capable of mitigating both effects. Unlike previous work demonstrating the use of quantum error correcting codes on the same platforms, we make no use of postselection and hence report unconditional fidelity improvements against natural decoherence.
A scheme to implement a quantum computer subjected to decoherence and governed by an untunable qubit-qubit interaction is presented. By concatenating dynamical decoupling through bang-bang (BB) pulse with decoherence-free subspaces (DFSs) encoding, we protect the quantum computer from environment-induced decoherence that results in quantum information dissipating into the environment. For the inherent qubit-qubit interaction that is untunable in the quantum system, BB control plus DFSs encoding will eliminate its undesired effect which spoils quantum information in qubits. We show how this quantum system can be used to implement universal quantum computation.
Aperiodic dynamical decoupling (DD) sequences of π pulses are of great interest to decoherence control and have been recently extended from single-qubit to two-qubit systems. If the environmental noise power spectrum is made available, then one may further optimize aperiodic DD sequences to reach higher efficiency of decoherence suppression than known universal schemes. This possibility is investigated in this work for the protection of two-qubit states, using an exactly solvable pure dephasing model including both local and nonlocal noise. The performance of optimized DD sequences in protecting two-qubit states is compared with that achieved by nested Uhrig's DD (nested-UDD) sequences, for several different types of noise spectrum. Except for the cases with noise spectrum decaying slowly in the high-frequency regime, optimized DD sequences with tens of control pulses can perform orders of magnitude better than that of nested-UDD. A two-qubit system with highly unbalanced local noise is also examined to shed more light on a recent experiment. Possible experiments that may be motivated by this work are discussed.
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.