Cited by 406Quantum Computing Algorithms and ArchitectureCoding theory and cryptographyQuantum Information and Cryptography

Quantum error-correcting codes associated with graphs

Open access
Schlingemann, D., Werner, R. F.·2001·Physical Review A

Abstract

We present a construction for quantum error correcting codes. The basic ingredients are a graph and a finite Abelian group, from which the code can explicitly be obtained. We prove necessary and sufficient conditions for the graph such that the resulting code corrects a certain number of errors. This allows a simple verification of the one-error correcting property of codes of length 5 in any dimension. As examples, we construct a large class of maximum distance separable codes, i.e. codes saturating the Singleton bound, as well as a code of length 10 detecting three errors.

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.65.012308

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

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?

  • The computational model that emerges for the QC_C makes no reference to the concept of unitary evolution.

    “However, the computational model that emerges for the QC C [7] makes no reference to the concept of unitary evolution”

    From Measurement-based quantum computation on cluster states (2003) · cites this paper as [7]

  • In [7] it has been shown that the required classical processing increases the computation time only marginally (logarithmically in the number n of logical qubits) and thus there is no exponential overhead in either classical or quantum resources.

    “In [7] it has been shown, as stated in Section III A, that the required classical processing increases the computation time only marginally (logarithmically in the number n of logical qubits) and thus there is no exponential overhead in either classical or quantum resources.”

    From Measurement-based quantum computation on cluster states (2003) · cites this paper as [7]

  • Instead of describing a quantum algorithm as a network of gates applied to a fiducial input state, a quantum algorithm may be characterized by a graph specifying the quantum resource and the structure for processing the measurement outcomes.

    “In conclusion, instead of describing a quantum algorithm as a network of gates applied to some fiducial input state, a quantum algorithm may (arguably more effectively) be characterized by a graph specifying the quantum resource and the structure [7] for the processing of the measurement outcomes.”

    From Measurement-based quantum computation on cluster states (2003) · cites this paper as [7]

  • The classical processing of measurement outcomes in a QC_C-computation increases the total time of computation only marginally.

    “Concerning the resources for the classical processing of the measurement outcomes in a QC C -computation, we point out that this processing increases the total time of computation only marginally [7].”

    From Measurement-based quantum computation on cluster states (2003) · cites this paper as [7]

  • As shown in [7], there is no difference in the way measurements of cluster qubits in I, O or M contribute to the final result of the computation.

    “As shown in [7], it turns out that there is none.”

    From Measurement-based quantum computation on cluster states (2003) · cites this paper as [7]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 1

  1. [14]Grassl, M. and Beth, T.: Quantum BCH codes Proceedings X. International Symposium on Theoretical Electrical Engineering, Magdeburg 1999

Cited by

Sorted by citations

Authors
Schlingemann, D., & Werner, R. F.
Affiliations
Technische Universität Braunschweig (DE)
Venue
Physical Review A
Published
2001-12-11
Volume
65
Issue
1
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W1503834475
Cited by
406
References
19
Citations by year
2026: 13 · 2025: 18 · 2024: 16 · 2023: 20 · 2022: 15 · 2021: 16 · 2020: 21 · 2019: 13 · 2018: 10 · 2017: 10 · 2016: 15 · 2015: 11 · 2014: 16 · 2013: 22 · 2012: 24
FWCI
8.19
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)
Funders
European Commission
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
quantum error-correcting codes, graph codes, finite abelian groups, code construction, error correction capability, MDS codes, Singleton bound

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