pith. machine review for the scientific record. sign in

arxiv: quant-ph/9607030 · v1 · submitted 1996-08-01 · 🪐 quant-ph

Recognition: unknown

Efficient Computations of Encodings for Quantum Error Correction

Richard Cleve , Daniel Gottesman
Authors on Pith no claims yet
classification 🪐 quant-ph
keywords arraycodecodewordsefficientgategeneratorsn-qubitquantum
0
0 comments X
read the original abstract

We show how, given any set of generators of the stabilizer of a quantum code, an efficient gate array that computes the codewords can be constructed. For an n-qubit code whose stabilizer has d generators, the resulting gate array consists of O(n d) operations, and converts k-qubit data (where k = n - d) into n-qubit codewords.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Stabilizer Codes and Quantum Error Correction

    quant-ph 1997-05 accept novelty 9.0

    The stabilizer code formalism is presented as a powerful group-theoretic tool for quantum error correction, enabling code construction, analysis of quantum channel capacity, bounds on codes, and fault-tolerant computation.