ADAPT: Mitigating Idling Errors in Qubits via Adaptive Dynamical Decoupling

• URL: http://arxiv.org/abs/2109.05309v1
• Date: Sat, 11 Sep 2021 16:15:24 GMT
• Title: ADAPT: Mitigating Idling Errors in Qubits via Adaptive Dynamical Decoupling
• Authors: Poulami Das, Swamit Tannu, Siddharth Dangwal, Moinuddin Qureshi
• Abstract summary: A qubit is susceptible to idling errors, which occur when the qubit is idle and not actively undergoing any operations. Existing Dynamical Decoupling protocols have been primarily studied for individual qubits. We propose Adaptive Dynamical Decoupling (ADAPT), a software framework that estimates the efficacy of DD for each qubit combination.
• Score: 3.2505361717998227
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The fidelity of applications on near-term quantum computers is limited by hardware errors. In addition to errors that occur during gate and measurement operations, a qubit is susceptible to idling errors, which occur when the qubit is idle and not actively undergoing any operations. To mitigate idling errors, prior works in the quantum devices community have proposed Dynamical Decoupling (DD), that reduces stray noise on idle qubits by continuously executing a specific sequence of single-qubit operations that effectively behave as an identity gate. Unfortunately, existing DD protocols have been primarily studied for individual qubits and their efficacy at the application-level is not yet fully understood. Our experiments show that naively enabling DD for every idle qubit does not necessarily improve fidelity. While DD reduces the idling error-rates for some qubits, it increases the overall error-rate for others due to the additional operations of the DD protocol. Furthermore, idling errors are program-specific and the set of qubits that benefit from DD changes with each program. To enable robust use of DD, we propose Adaptive Dynamical Decoupling (ADAPT), a software framework that estimates the efficacy of DD for each qubit combination and judiciously applies DD only to the subset of qubits that provide the most benefit. ADAPT employs a Decoy Circuit, which is structurally similar to the original program but with a known solution, to identify the DD sequence that maximizes the fidelity. To avoid the exponential search of all possible DD combinations, ADAPT employs a localized algorithm that has linear complexity in the number of qubits. Our experiments on IBM quantum machines (with 16-27 qubits) show that ADAPT improves the application fidelity by 1.86x on average and up-to 5.73x compared to no DD and by 1.2x compared to DD on all qubits.

Related papers

• Efficient Approximate Degenerate Ordered Statistics Decoding for Quantum Codes via Reliable Subset Reduction [5.625796693054094]
  We introduce the concept of approximate degenerate decoding and integrate it with ordered statistics decoding (OSD) We present an ADOSD algorithm that significantly improves OSD efficiency in the code capacity noise model.
  arXiv  Detail & Related papers  (2024-12-30T17:45:08Z)
• Qudit Dynamical Decoupling on a Superconducting Quantum Processor [0.0]
  We develop protocols for dynamical decoupling of qudit systems based on the Heisenberg-Weyl group. We demonstrate single-qudit DD sequences to decouple qutrits and ququarts from system-bath-induced decoherence. We also introduce two-qudit DD sequences designed to suppress the detrimental cross-Kerr couplings between coupled qudits.
  arXiv  Detail & Related papers  (2024-07-05T23:37:29Z)
• Multi-qubit Dynamical Decoupling for Enhanced Crosstalk Suppression [0.3351644102216694]
  Static crosstalk exists in various hardware platforms, including superconductor and semiconductor qubits. driven crosstalk may occur as an unwanted drive term due to leakage from driven gates on other qubits. We develop two experimental setups -- an "idle-idle" experiment in which two pairs of qubits undergo free evolution simultaneously and a "driven-idle" experiment in which one pair is continuously driven.
  arXiv  Detail & Related papers  (2024-03-08T15:36:15Z)
• Empirical learning of dynamical decoupling on quantum processors [0.276240219662896]
  We show how empirical learning schemes can be used to tailor DD strategies to the quantum device and task at hand. In each scenario, the GADD strategies significantly outperform canonical DD sequences. The relative improvement of empirically learned DD strategies over canonical DD sequences is shown to increase with increasing problem size and circuit sophistication.
  arXiv  Detail & Related papers  (2024-03-04T18:26:37Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Model-based Optimization of Superconducting Qubit Readout [59.992881941624965]
  We demonstrate model-based readout optimization for superconducting qubits. We observe 1.5% error per qubit with a 500ns end-to-end duration and minimal excess reset error from residual resonator photons. This technique can scale to hundreds of qubits and be used to enhance the performance of error-correcting codes and near-term applications.
  arXiv  Detail & Related papers  (2023-08-03T23:30:56Z)
• Conditional Adapters: Parameter-efficient Transfer Learning with Fast Inference [53.65845680932835]
  Conditional Adapter (CoDA) is a parameter-efficient transfer learning method that also improves inference efficiency. Across a variety of language, vision, and speech tasks, CoDA achieves a 2x to 8x inference speed-up.
  arXiv  Detail & Related papers  (2023-04-11T03:17:37Z)
• Efficacy of noisy dynamical decoupling [0.0]
  Dynamical decoupling (DD) refers to a well-established family of methods for error mitigation in quantum systems. In the presence of noisy pulses, DD does not always mitigate errors. It does so only when the added noise from the DD pulses do not outweigh the increased ability in averaging away the original background noise.
  arXiv  Detail & Related papers  (2022-09-19T14:19:11Z)
• DR-DSGD: A Distributionally Robust Decentralized Learning Algorithm over Graphs [54.08445874064361]
  We propose to solve a regularized distributionally robust learning problem in the decentralized setting. By adding a Kullback-Liebler regularization function to the robust min-max optimization problem, the learning problem can be reduced to a modified robust problem. We show that our proposed algorithm can improve the worst distribution test accuracy by up to $10%$.
  arXiv  Detail & Related papers  (2022-08-29T18:01:42Z)
• Analyzing Strategies for Dynamical Decoupling Insertion on IBM Quantum Computer [0.0]
  Near-term quantum devices are subject to errors and decoherence error is one of the non-negligible sources. Dynamical decoupling is a technique to protect idle qubits from decoherence error. We identify different conditions that lead to idle qubits and evaluate strategies for DD insertion under these specific conditions.
  arXiv  Detail & Related papers  (2022-04-29T17:28:35Z)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)
• AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
  We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation. Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
  arXiv  Detail & Related papers  (2020-07-14T09:07:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.