The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Robust dynamical decoupling
Open accessAbstract
Quantum computers, which process information encoded in quantum mechanical systems, hold the potential to solve some of the hardest computational problems. A substantial obstacle for the further development of quantum computers is the fact that the lifetime of quantum information is usually too short to allow practical computation. A promising method for increasing the lifetime, known as dynamical decoupling (DD), consists of applying a periodic series of inversion pulses to the quantum bits. In the present review, we give an overview of this technique and compare different pulse sequences proposed earlier. We show that pulse imperfections, which are always present in experimental implementations, limit the performance of DD. The loss of coherence due to the accumulation of pulse errors can even exceed the perturbation from the environment. This effect can be largely eliminated by a judicious design of pulses and sequences. The corresponding sequences are largely immune to pulse imperfections and provide an increase of the coherence time of the system by several orders of magnitude.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Absence of Diffusion in Certain Random Lattices
Anderson, P. W. (1958) · Physical Review · doi:10.1103/physrev.109.1492 · Cited by 12,468
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Decoherence, einselection, and the quantum origins of the classical
Zurek, W. H. (2003) · Reviews of Modern Physics · doi:10.1103/revmodphys.75.715 · Cited by 4,295
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
Quantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263
DiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Preskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994
Cited by
K S, U. (2025) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.18067974 · Cited by 733
Colloquium: Protecting quantum information against environmental noise
Suter, D., & Álvarez, G. A. (2016) · Reviews of Modern Physics · doi:10.1103/revmodphys.88.041001 · Cited by 354
Self-citationControlling open quantum systems: tools, achievements, and limitations
Koch, C. P. (2016) · Journal of Physics: Condensed Matter · doi:10.1088/0953-8984/28/21/213001 · Cited by 272
Demonstration of Fidelity Improvement Using Dynamical Decoupling with Superconducting Qubits
Pokharel, B., Anand, N., Fortman, B., & Lidar, D. A. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.220502 · Cited by 209
Dispersive optical systems for scalable Raman driving of hyperfine qubits
Levine, H., Bluvstein, D., Keesling, A., Wang, T. T., Ebadi, S., Semeghini, G., Omran, A., Greiner, M., Vuletić, V., & Lukin, M. D. (2022) · Physical Review A · doi:10.1103/physreva.105.032618 · Cited by 66
Metadata
- Authors
- Souza, A. M., Álvarez, G. A., & Suter, D.
- Venue
- Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Publisher
- The Royal Society
- Published
- 2012-10-13
- Volume
- 370
- Issue
- 1976
- Pages
- 4748-4769
- ISSN
- 1364-503X (ISSN-L)
- 1471-2962
- OpenAlex
- W2134322375
- Cited by
- 230
- References
- 13
- FWCI
- 10.13
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robust dynamical decoupling. https://app.cochat.ai/papers/10.1098/rsta.2011.0355
- The paper
- Souza, A. M., Álvarez, G. A., & Suter, D. (2012). Robust dynamical decoupling. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences. https://doi.org/10.1098/rsta.2011.0355
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.