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

The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.

Stabilizing quantum information

Open access
Zanardi, Paolo·2000·Physical Review A

Abstract

The dynamical-algebraic structure underlying all the schemes for quantum information stabilization is argued to be fully contained in the reducibility of the operator algebra describing the interaction with the environment of the coding quantum system. This property amounts to the existence of a nontrivial group of symmetries for the global dynamics. We provide a unified framework that allows us to build systematically additional classes of error correcting codes and noiseless subsystems. It is shown that by using symmetrization strategies one can artificially produce noiseless subsystems supporting universal quantum computation.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreva.63.012301

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Flagged first, then by citations

Show all 28 references

Research works printed but not linked: 1

  1. J.F. Cornwell, 1984, Group Theory in Physics

Cited by

Sorted by citations

Items 201–207 of 207

Metadata

Authors
Zanardi, P.
Venue
Physical Review A
Published
2000-12-05
Volume
63
Issue
1
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2032617180
Cited by
207
References
28
Citations by year
2026: 2 · 2025: 8 · 2024: 6 · 2023: 3 · 2022: 5 · 2021: 4 · 2020: 10 · 2019: 7 · 2018: 3 · 2017: 3 · 2016: 14 · 2015: 4 · 2014: 5 · 2013: 7 · 2012: 6
FWCI
16.25
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
quantum error correction, environmental interaction, symmetry groups, noiseless subsystems, symmetrization, universal quantum computation

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