Pith. sign in

REVIEW 1 cited by

Quantum coding theorem from privacy and distinguishability

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/0702006 v2 pith:RPHIDI6D submitted 2007-01-31 quant-ph

Michal Horodecki , Seth Lloyd , Andreas Winter This is my paper · ORCID
classification quant-ph
keywords privacyquantumcodescodewordscodingdistinguishabilitytheoremchecked
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We prove direct quantum coding theorem for random quantum codes. The problem is separated into two parts: proof of distinguishability of codewords by receiver, and that of indistinguishability of codewords by environment (privacy). For a large class of codes, only privacy has to be checked.

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

  1. Random approximate quantum information masking

    quant-ph 2025-07 conditional novelty 6.0 of 10

    Random isometries almost never approximate-mask into two subsystems, but almost always into many subsystems, with the number of physical qubits scaling linearly in the number of logical qubits.

Pith tools