Pith Number

pith:FNC34D6K

pith:1997:FNC34D6K36FTVE7I2VR7OZAFEF

not attested not anchored not stored refs resolved

Stabilizer Codes and Quantum Error Correction

Daniel Gottesman

Stabilizer codes provide a group-theoretic framework that simplifies construction and analysis of quantum error-correcting codes.

arxiv:quant-ph/9705052 v1 · 1997-05-28 · quant-ph

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{FNC34D6K36FTVE7I2VR7OZAFEF}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes.

C2weakest assumption

That the group-theoretical structure of stabilizer codes applies broadly to quantum error correction without limitations from specific error models or hardware constraints.

C3one line summary

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.

References

65 extracted · 65 resolved · 1 Pith anchors

[1] An unsolvable problem of elementary number t heory 1936

[2] Simulating physics with computers 1982

[3] Algorithms for quantum computation: discrete logarithms and factoring 1994

[4] A fast quantum mechanical algorithm for da tabase search 1996

[5] Strengths and weaknesses of quantum computing 1997

Formal links

2 machine-checked theorem links

Cited by

100 papers in Pith

Universal purification dynamics of monitored Clifford circuits

Routing Techniques for Error-Corrected Silicon Spin Qubit Quantum Architectures

Efficient Pauli-decomposition and multistage state-refinement for tensor network based differential equation solver

Parallel QEC Decoding Applied to Distributed Quantum Computing

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks

Receipt and verification

First computed	2026-07-04T14:47:07.239168Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

2b45be0fcadf8b3a93e8d563f7640521770752e061dfa644a65030df1d49e5b8

Aliases

arxiv: quant-ph/9705052 · arxiv_version: quant-ph/9705052v1 · doi: 10.48550/arxiv.quant-ph/9705052 · pith_short_12: FNC34D6K36FT · pith_short_16: FNC34D6K36FTVE7I · pith_short_8: FNC34D6K

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/FNC34D6K36FTVE7I2VR7OZAFEF \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 2b45be0fcadf8b3a93e8d563f7640521770752e061dfa644a65030df1d49e5b8

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "0277cb022cdad6a5023c379717187cc684b41d732da41ebbcd71f3c4b00ef537",
    "cross_cats_sorted": [],
    "license": "",
    "primary_cat": "quant-ph",
    "submitted_at": "1997-05-28T23:51:29Z",
    "title_canon_sha256": "2209b6c323d04b23962ee0e23c396eb6e7db03d43c06e8bf93106631c5ca53f5"
  },
  "schema_version": "1.0",
  "source": {
    "id": "quant-ph/9705052",
    "kind": "arxiv",
    "version": 1
  }
}