Quantum Error Correction and Dynamical Decoupling: Better Together or Apart?
Victor Kasatkin, Mario Morford-Oberst, Arian Vezvaee, Daniel A. Lidar

TL;DR
This paper analyzes the combination of quantum error correction and dynamical decoupling, deriving formulas and conditions under which their hybrid use outperforms individual methods in protecting quantum information.
Contribution
It provides a theoretical framework with closed-form fidelity expressions for hybrid quantum memory protocols, highlighting conditions for their advantage and guiding co-design of codes and decoupling groups.
Findings
LDD+QEC outperforms QEC-only if uncorrectable errors are more prevalent in the unsuppressed sector.
A sufficient condition for hybrid advantage is LDD suppressing at least one minimum-weight uncorrectable error.
Numerical results for Steane and 13-qubit codes demonstrate parameter regimes where hybrid protocols are beneficial.
Abstract
Quantum error correction/detection (QEC/QED) and dynamical decoupling (DD) are tools for protecting quantum information. A natural goal is to combine them to outperform either approach alone. Such a benefit is not automatic: physical DD can conflict with encoded subspace, and QEC performance is governed by the errors that survive decoding, not just those DD suppresses. We analyze a hybrid memory cycle where DD is implemented logically (LDD) using normalizer elements of an stabilizer code, followed by a round of syndrome measurement and recovery (or, in the detection setting, postselection on a trivial syndrome). In an effective Pauli model with physical error probability , LDD suppression factor , and recovery imperfection rate (or ), we derive closed-form entanglement-fidelity expressions for QEC-only, QED-only, LDD-only, physical DD, and the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
