Pith. sign in

REVIEW 3 cited by

Quantum Error Correction and Orthogonal Geometry

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

arxiv quant-ph/9605005 v3 pith:CJ7ACX4K submitted 1996-05-09 quant-ph

Quantum Error Correction and Orthogonal Geometry

classification quant-ph
keywords qubitscorrectingerrorcodeserrorsquantumconstructioncorrection
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A group theoretic framework is introduced that simplifies the description of known quantum error-correcting codes and greatly facilitates the construction of new examples. Codes are given which map 3 qubits to 8 qubits correcting 1 error, 4 to 10 qubits correcting 1 error, 1 to 13 qubits correcting 2 errors, and 1 to 29 qubits correcting 5 errors.

discussion (0)

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

Forward citations

Cited by 3 Pith papers

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

  1. The Heisenberg Representation of Quantum Computers

    quant-ph 1998-07 accept novelty 8.0

    Quantum states for error correction are described by their stabilizer, a commuting group of tensor products of Pauli matrices, enabling analysis of a rich class of quantum effects short of full quantum computation.

  2. Clifford Orbits from Cayley Graph Quotients

    quant-ph 2023-06 unverdicted novelty 6.0

    Quotienting the Cayley graph of the Clifford group by a quantum state's stabilizer subgroup produces a graph of the state's Clifford orbit.

  3. A Symplectic Proof of the Quantum Singleton Bound

    quant-ph 2026-02 conditional novelty 4.0

    The quantum Singleton bound k+2(d−1)≤n for stabilizer codes is derived from erasure correctability and the cleaning lemma, and formalized in Lean4.