Pith. sign in

REVIEW 1 cited by

Description of a quantum convolutional code

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/0304189 v2 pith:JXIMIZNV submitted 2003-04-29 quant-ph

Description of a quantum convolutional code

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

We describe a quantum error correction scheme aimed at protecting a flow of quantum information over long distance communication. It is largely inspired by the theory of classical convolutional codes which are used in similar circumstances in classical communication. The particular example shown here uses the stabilizer formalism, which provides an explicit encoding circuit. An associated error estimation algorithm is given explicitly and shown to provide the most likely error over any memoryless quantum channel, while its complexity grows only linearly with the number of encoded qubits.

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. Finite Observations, Infinite Behaviour: bicategorical semantics for stateful monoidal processes

    cs.LO 2026-07 accept novelty 7.5

    Behaviours of stateful monoidal processes are equivalence classes of compatible finite observations in discard bicategories, yielding functorial feedback semantics and a categorified compactness theorem for closed relations.