Pith. sign in

REVIEW 1 cited by

Graphs, Quadratic Forms, and Quantum Codes

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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/0703112 v1 pith:3PCHPSSS submitted 2007-03-13 quant-ph cs.ITmath.IT

Markus Grassl , Andreas Klappenecker , Martin Roetteler This is my paper
classification quant-phcs.ITmath.IT
keywords codequantumcodesfieldfiniteformsgraphicalquadratic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We show that any stabilizer code over a finite field is equivalent to a graphical quantum code. Furthermore we prove that a graphical quantum code over a finite field is a stabilizer code. The technique used in the proof establishes a new connection between quantum codes and quadratic forms. We provide some simple examples to illustrate our results.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Local Equivalences of Graph States

    quant-ph 2025-11 conditional novelty 8.0 of 10

    Graph states are LU-equivalent if and only if they are linked by r-local complementations for some integer r; LU-equivalence is decidable in quasi-polynomial time, and LU=LC holds on at most 19 qubits.

Pith tools