REVIEW 3 cited by
Subsystem Codes
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
read the original abstract
We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem codes using a counting argument similar to the quantum Gilbert-Varshamov bound. We derive linear programming bounds and other upper bounds. We answer the question whether or not there exist [[n,n-2d+2,r>0,d]]<sub>q</sub> subsystem codes. Finally, we compare stabilizer and subsystem codes with respect to the required number of syndrome qudits.
Forward citations
Cited by 3 Pith papers
-
Quantum Error Correction in Adversarial Regimes
The paper gives a generalized Knill-Laflamme condition for quantum list-decodable codes and a pseudorandom-unitary protocol for unambiguous list decoding that is claimed to be secure against polynomial-time quantum ad...
-
VideoEraser: Concept Erasure in Text-to-Video Diffusion Models
A training-free, two-stage erasure method (prompt embedding adjustment plus adversarial noise guidance) is claimed to cut unwanted text-to-video output by 46%, but the submitted full text is an unrelated quantum-coding paper.
-
Design Automation in Quantum Error Correction
A comprehensive review of automated tools and methods for designing quantum error-corrected circuits, with case studies on T-gate optimization, surface-code layout, ML decoders, and verification.
Discussion (0). Sign in to comment.