A quantum computing primer for operator theorists

David W. Kribs

A quantum computing primer for operator theorists

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 math/0404553 v2 pith:PQHIWPOQ submitted 2004-04-30 math.OA math.FAquant-ph

David W. Kribs This is my paper · ORCID

classification math.OAmath.FAquant-ph

keywords quantumcorrectionerroroperatoralgorithmsaspectsbasicbrief

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

This is an exposition of some of the aspects of quantum computation and quantum information that have connections with operator theory. After a brief introduction, we discuss quantum algorithms. We outline basic properties of quantum channels, or equivalently, completely positive trace preserving maps. The main theorems for quantum error detection and correction are presented and we conclude with a description of a particular passive method of quantum error correction.

Discussion (0). Continue with ORCID 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

Parallel repetition of expanded, and multiplayer, Quantum games: anchoring, optimal values, generalized error bounds, dependency-breaking as symmetry-breaking
quant-ph 2025-08 reject novelty 4.0 of 10

States exponential decay bounds for the anchored parallel-repeated value of multiplayer quantum games with N-dependent exponents, but leaves the N-player proof to prior work.

Pith tools