Cited by 209Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Demonstration of Fidelity Improvement Using Dynamical Decoupling with Superconducting Qubits

Open access
Pokharel, Bibek, Anand, Namit, Fortman, Benjamin, Lidar, Daniel A.·2018·Physical Review Letters

Abstract

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.

Integrity signals

Registry

Crossref · 10.1103/physrevlett.121.220502

Cites

55 of 55 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Dynamical decoupling experiments on the 16-qubit IBMQX5, 5-qubit IBMQX4, and 19-qubit Rigetti Acorn chips demonstrated gain in substantial gate fidelity relative to unprotected free evolution of individual transmon qubits.

    “Recently, DD experiments were performed on the 16-qubit IBMQX5, 5-qubit IBMQX4, and the 19-qubit Rigetti Acorn chips (Pokharel et al. , 2018), where the gain in substantial gate fidelity relative to unprotected, free evolution of individual transmon qubits was demonstrated.”

    From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Pokharel et al., 2018

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Pokharel, B., Anand, N., Fortman, B., & Lidar, D. A.
Affiliations
University of Southern California (US)
Venue
Physical Review Letters
Published
2018-11-29
Volume
121
Issue
22
Pages
220502-220502
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2884173913
Cited by
209
References
55
Citations by year
2026: 13 · 2025: 41 · 2024: 38 · 2023: 32 · 2022: 32 · 2021: 17 · 2020: 21 · 2019: 15
FWCI
7.42
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
  • Bulletin of the American Physical Society
Funders
  • Oracle
  • Lockheed Martin
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
dynamical decoupling, superconducting qubits, transmon qubits, decoherence suppression, gate fidelity, dephasing, spontaneous emission, entanglement protection, two-qubit gates, IBM Quantum

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review