REVIEW 2 cited by
Efficient Computations of Encodings for Quantum Error Correction
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Efficient Computations of Encodings for Quantum Error Correction
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.
Forward citations
Cited by 2 Pith papers
-
Stabilizer Codes and Quantum Error Correction
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.
-
The Delayed Stabilizer ZX-Calculus
A complete delayed stabilizer ZX-calculus with delay generator, generating-tableau semantics, and unique normal forms via generalized local complementation captures infinite translation-invariant stabilizer processes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.