{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:OC3NAFI2MSPFVDOONIWCIEJAKP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3255a1bac59907e2a78904be37acf0107a3f81f105e59bb067c8ba286bb6008b","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"quant-ph","submitted_at":"2006-10-18T21:19:17Z","title_canon_sha256":"8bdc0a4f042932897625b98bc6d3aad48b3f43d9e7388f0f0f5eb3fde509d133"},"schema_version":"1.0","source":{"id":"quant-ph/0610153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0610153","created_at":"2026-07-04T15:02:56Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0610153v1","created_at":"2026-07-04T15:02:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0610153","created_at":"2026-07-04T15:02:56Z"},{"alias_kind":"pith_short_12","alias_value":"OC3NAFI2MSPF","created_at":"2026-07-04T15:02:56Z"},{"alias_kind":"pith_short_16","alias_value":"OC3NAFI2MSPFVDOO","created_at":"2026-07-04T15:02:56Z"},{"alias_kind":"pith_short_8","alias_value":"OC3NAFI2","created_at":"2026-07-04T15:02:56Z"}],"graph_snapshots":[{"event_id":"sha256:eec778d3d84ce81dd87401ad1313266e43ab6ff833e811e3090c0d5e7c1c7e49","target":"graph","created_at":"2026-07-04T15:02:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0610153/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"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.","authors_text":"Andreas Klappenecker, Pradeep Kiran Sarvepalli, Salah A. Aly","cross_cats":["cs.IT","math.IT"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2006-10-18T21:19:17Z","title":"Subsystem Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0610153","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bd0b04edfb586b3c3eb0b641926ca209c04ee0dca49f98f85f6c6be5fa4e84f7","target":"record","created_at":"2026-07-04T15:02:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3255a1bac59907e2a78904be37acf0107a3f81f105e59bb067c8ba286bb6008b","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"quant-ph","submitted_at":"2006-10-18T21:19:17Z","title_canon_sha256":"8bdc0a4f042932897625b98bc6d3aad48b3f43d9e7388f0f0f5eb3fde509d133"},"schema_version":"1.0","source":{"id":"quant-ph/0610153","kind":"arxiv","version":1}},"canonical_sha256":"70b6d0151a649e5a8dce6a2c24112053f133c25f3bb725430b357c24cab470ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70b6d0151a649e5a8dce6a2c24112053f133c25f3bb725430b357c24cab470ff","first_computed_at":"2026-07-04T15:02:56.832706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:02:56.832706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dzk8h57Q1f2LbHcKVBSyA7KdHF74vBB2EbJI5QfhCRDars67d2pGx9U4FT+3CaUZG+6VwC/CEEb0G8LAWmipDA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:02:56.833098Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0610153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd0b04edfb586b3c3eb0b641926ca209c04ee0dca49f98f85f6c6be5fa4e84f7","sha256:eec778d3d84ce81dd87401ad1313266e43ab6ff833e811e3090c0d5e7c1c7e49"],"state_sha256":"f643d57e2767b1fbb60b82a3bc55e3772ac0a19737b04a34b6340c8131155855"}