{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MHJSWUHTQAUIISFL4JC5KY5YAT","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":"79893360edd5b105a9204ff03b6408703f24b2326e9e983cf3294c0dee558577","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-30T07:24:00Z","title_canon_sha256":"ff12444139c9bf34684c6baf7710396ea66472c4560fc7a765e127fb1cd7a98f"},"schema_version":"1.0","source":{"id":"1312.7646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7646","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7646v1","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7646","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"pith_short_12","alias_value":"MHJSWUHTQAUI","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MHJSWUHTQAUIISFL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MHJSWUHT","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:1c137985ccfc4bacbe25b93717734e5a7a7951ba60432e3c014ebd3ba66c97f3","target":"graph","created_at":"2026-05-18T03:03:34Z","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"},"paper":{"abstract_excerpt":"We study the encoding complexity for quantum error correcting codes with large rate and distance. We prove that random Clifford circuits with $O(n \\log^2 n)$ gates can be used to encode $k$ qubits in $n$ qubits with a distance $d$ provided $\\frac{k}{n} < 1 - \\frac{d}{n} \\log_2 3 - h(\\frac{d}{n})$. In addition, we prove that such circuits typically have a depth of $O( \\log^3 n)$.","authors_text":"Omar Fawzi, Winton Brown","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-30T07:24:00Z","title":"Short random circuits define good quantum error correcting codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7646","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:2881c05e870ad62a61351e176445fa387335942c48e0e2ed3a7715fdc5e12619","target":"record","created_at":"2026-05-18T03:03:34Z","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":"79893360edd5b105a9204ff03b6408703f24b2326e9e983cf3294c0dee558577","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-30T07:24:00Z","title_canon_sha256":"ff12444139c9bf34684c6baf7710396ea66472c4560fc7a765e127fb1cd7a98f"},"schema_version":"1.0","source":{"id":"1312.7646","kind":"arxiv","version":1}},"canonical_sha256":"61d32b50f380288448abe245d563b804e5ce6b5e2df010d511dcdae17e395bcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61d32b50f380288448abe245d563b804e5ce6b5e2df010d511dcdae17e395bcb","first_computed_at":"2026-05-18T03:03:34.104932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:34.104932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E5L7llAwDQUo5QYGY1H1JdGsmM56tPEoHMms6Xswdm1OYBRw6eER7us9BLIsoSU7RtCBPhoeRlKx43DaoSOaAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:34.105644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2881c05e870ad62a61351e176445fa387335942c48e0e2ed3a7715fdc5e12619","sha256:1c137985ccfc4bacbe25b93717734e5a7a7951ba60432e3c014ebd3ba66c97f3"],"state_sha256":"f6de9d36b051d87a5b33e82e7aca26eed3efc2d015ef7931c6fce85772644d0e"}