In this paper, we demonstrate the efficacy of the universally robust dynamical decoupling (URDD) sequence to preserve multipartite maximally entangled quantum states on a cloud-based quantum computer via the IBM platform. URDD is a technique that can compensate for experimental errors and simultaneously protect the state against environmental noise. To further improve the performance of the URDD sequence, phase randomization (PR) as well as correlated PR (CPR) techniques are added to the basic URDD sequence. The performance of the URDD sequence is quantified by measuring the entanglement in several noisy entangled states (two-qubit triplet state, three-qubit Greenberger–Horne–Zeilinger (GHZ) state, four-qubit GHZ state and four-qubit cluster state) at several time points. Our experimental results demonstrate that the URDD sequence is successfully able to protect noisy multipartite entangled states and its performance is modestly improved by adding the PR and CPR sequences.
In this paper, we demonstrate the efficacy of the universally robust dynamical decoupling (URDD) sequence to preserve multipartite maximally entangled quantum states on a cloud-based quantum computer via the IBM platform. URDD is a technique that can compensate for experimental errors and simultaneously protect the state against environmental noise. To further improve the performance of the URDD sequence, phase randomization (PR) as well as correlated PR (CPR) techniques are added to the basic URDD sequence. The performance of the URDD sequence is quantified by measuring the entanglement in several noisy entangled states (two-qubit triplet state, three-qubit Greenberger–Horne–Zeilinger (GHZ) state, four-qubit GHZ state and four-qubit cluster state) at several time points. Our experimental results demonstrate that the URDD sequence is successfully able to protect noisy multipartite entangled states and its performance is modestly improved by adding the PR and CPR sequences.
We generate different orders of quantum coherence in a three-qubit NMR system and study their dynamics in the presence of inherent noise. Robust dynamical decoupling (DD) sequences are applied to preserve the different coherence orders. Initially, DD sequences are implemented simultaneously on all three spins, which effectively protects third-order coherence; however, other coherence orders decay rapidly instead of being preserved. The robust DD sequences were suitably modified in order to preserve other coherence orders. These sequences are applied to the two participating qubits that generate each zero- and second-order coherence, ensuring their effective preservation. In contrast, first-order coherence is preserved more efficiently when DD sequences are applied exclusively on the qubit responsible for generating it. Instead of performing full quantum state tomography, coherence orders are measured directly using single pulses. The robust DD protection schemes are applied to successfully protect two-qubit entanglement in three-qubit star states.
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.
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.
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.
As quantum technology advances and the size of quantum computers grow, it becomes increasingly important to understand the extent of quality in the devices. As large-scale entanglement is a quantum resource crucial for achieving quantum advantage, the challenge in its generation makes it a valuable benchmark for measuring the performance of universal quantum devices. In this paper, we study entanglement in Greenberger-Horne-Zeilinger (GHZ) and graph states prepared on the range of IBM Quantum devices. We generate GHZ states and investigate their coherence times with respect to state size and dynamical decoupling techniques. A GHZ fidelity of 0.519 ± 0.014 is measured on a 32-qubit GHZ state, certifying its genuine multipartite entanglement (GME). We show a substantial improvement in GHZ decoherence rates for a seven-qubit GHZ state after implementing dynamical decoupling, and observe a linear trend in the decoherence rate of α = ( 7.13 N + 5.54 ) × 10 − 3 µ s − 1 for up to N = 15 qubits, confirming the absence of superdecoherence. Additionally, we prepare and characterize fully bipartite entangled native-graph states on 22 superconducting quantum devices with qubit counts as high as 414 qubits, all active qubits of the 433-qubit IBM Osprey device. Analysis of the decay of two-qubit entanglement within the prepared states shows suppression of coherent noise signals with the implementation of dynamical decoupling techniques. Additionally, we observe that the entanglement in some qubit pairs oscillates over time, which is likely caused by residual ZZ-interactions. Characterizing entanglement in native-graph states, along with detecting entanglement oscillations, can be an effective approach to low-level device benchmarking that encapsulates two-qubit error rates along with additional sources of noise, with possible applications to quantum circuit compilation. We develop several tools to automate the preparation and entanglement characterization of GHZ and graph states. In particular, a method to characterize graph state bipartite entanglement using just 36 circuits, constant with respect to the number of qubits. Published by the American Physical Society 2024
We embarked upon the task of experimental protection of different classes of tripartite entangled states, namely, the maximally entangled Greenberger-Horne-Zeilinger (GHZ) and W states and the tripartite entangled state called the WW state, using dynamical decoupling. The states were created on a three-qubit NMR quantum information processor and allowed to evolve in the naturally noisy NMR environment. Tripartite entanglement was monitored at each time instant during state evolution, using negativity as an entanglement measure. It was found that the W state is most robust while the GHZ-type states are most fragile against the natural decoherence present in the NMR system. The WW state, which is in the GHZ class yet stores entanglement in a manner akin to the W state, surprisingly turned out to be more robust than the GHZ state. The experimental data were best modeled by considering the main noise channel to be an uncorrelated phase damping channel acting independently on each qubit, along with a generalized amplitude damping channel. Using dynamical decoupling, we were able to achieve a significant protection of entanglement for GHZ states. There was a marginal improvement in the state fidelity for the W state (which is already robust against natural system decoherence), while the WW state showed a significant improvement in fidelity and protection against decoherence.