Search NASASearch

DOE OSTI · 3021104

Faster Randomized Dynamical Decoupling

Abstract

We present a randomized dynamical decoupling (DD) protocol that can substantially improve the performance of any given deterministic DD scheme for suppressing coherent noise by using no more than two additional pulses. Our construction is implemented by probabilistically applying sequences of pulses, which, when combined, effectively eliminate the error terms that scale linearly with the system-environment coupling strength. As a result, we show that a randomized protocol using a few pulses can outperform deterministic DD protocols that require considerably more pulses. Furthermore, we prove that the randomized protocol provides an improvement compared to deterministic DD sequences that aim to reduce the error in the system’s Hilbert space, such as Uhrig DD, which had been previously regarded to be optimal. To rigorously evaluate the performance, we introduce new analytical methods suitable for analyzing higher-order DD protocols that might be of independent interest. Here, we also present numerical simulations confirming the significant advantage of using randomized protocols compared to widely used deterministic protocols.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yi, Changhao [University of New Mexico, Albuquerque, NM (United States); Shanghai University (China)] (ORCID:0009000179442754), Kim, Leeseok [University of New Mexico, Albuquerque, NM (United States)] (ORCID:0000000178058219), Marvian, Milad [University of New Mexico, Albuquerque, NM (United States)] (ORCID:0000000230496516). 2026-01-02. Faster Randomized Dynamical Decoupling. https://doi.org/10.1103/fk7j-y1vl

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

Cost of emulating a small quantum annealing problem in the circuit model

Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as a sequence of quantum gates acting on a finite number of qubits. Amongst this excitement, analog quantum computation has become less prominent, with the expectation that circuit-model quantum computers will eventually be sufficient for emulating analog quantum computation and thus rendering analog quantum computation obsolete. In this work we explore the basic requirements for emulating a specific analog quantum computation in the circuit model: the preparation of a biased superposition of degenerate ground states of an Ising Hamiltonian using an adiabatic evolution. We show that the overhead of emulation is substantial even for this simple problem. This supports using analog quantum computation for solving time-dependent Hamiltonian dynamics in the short term and midterm, assuming analog errors can be made low enough and coherence times long enough to solve problems of practical interest.

Quantum algorithms & computation