{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LCWLWNOHHXZHPVUTW3ZOQSQJOW","short_pith_number":"pith:LCWLWNOH","schema_version":"1.0","canonical_sha256":"58acbb35c73df277d693b6f2e84a097585db0bb9f7967c71e3d90b03ccfe8a28","source":{"kind":"arxiv","id":"2102.10030","version":3},"attestation_state":"computed","paper":{"title":"On Quantum Weight Reduction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M. B. Hastings","submitted_at":"2021-02-19T17:01:29Z","abstract_excerpt":"We give a general procedure for weight reducing quantum codes. This corrects a previous work\\cite{owr}, and introduces a new technique that we call \"coning\" to effectively induce high weight stabilizers in an LDPC code. As one application, any LDPC code (with arbitrary $O(1)$ stabilizer weights) may be turned into a code where all stabilizers have weight at most $5$ at the cost of at most a constant factor increase in number of physical qubits and constant factor reduction in distance. Also, by applying this technique to a quantum code whose $X$-stabilizers are derived from a classical log-wei"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2102.10030","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-02-19T17:01:29Z","cross_cats_sorted":[],"title_canon_sha256":"8ebd21b7235ee009b4528890a3f95ca3931ef0f94d5f25001c08bbcdddba19e6","abstract_canon_sha256":"5b93450e333aa5adf6c9b7bff2620c7987f89b678b1707d52f1dc31b375013d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:35:22.195366Z","signature_b64":"QLGUUh+9SslRDgv+FTnM9i2yKutTCXYmobQQju0mEBNy6M1PVRZIqLhs9KMrXrVtzUF7Qjl/q9OKnCXyHMEmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58acbb35c73df277d693b6f2e84a097585db0bb9f7967c71e3d90b03ccfe8a28","last_reissued_at":"2026-07-05T06:35:22.194960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:35:22.194960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Quantum Weight Reduction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M. B. Hastings","submitted_at":"2021-02-19T17:01:29Z","abstract_excerpt":"We give a general procedure for weight reducing quantum codes. This corrects a previous work\\cite{owr}, and introduces a new technique that we call \"coning\" to effectively induce high weight stabilizers in an LDPC code. As one application, any LDPC code (with arbitrary $O(1)$ stabilizer weights) may be turned into a code where all stabilizers have weight at most $5$ at the cost of at most a constant factor increase in number of physical qubits and constant factor reduction in distance. Also, by applying this technique to a quantum code whose $X$-stabilizers are derived from a classical log-wei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.10030","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.10030/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2102.10030","created_at":"2026-07-05T06:35:22.195015+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.10030v3","created_at":"2026-07-05T06:35:22.195015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10030","created_at":"2026-07-05T06:35:22.195015+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCWLWNOHHXZH","created_at":"2026-07-05T06:35:22.195015+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCWLWNOHHXZHPVUT","created_at":"2026-07-05T06:35:22.195015+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCWLWNOH","created_at":"2026-07-05T06:35:22.195015+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.02213","citing_title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2410.10194","citing_title":"Wire Codes","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2503.05003","citing_title":"Parallel Logical Measurements via Quantum Code Surgery","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11318","citing_title":"Spatial overhead reduction for 2D hypergraph product codes","ref_index":59,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LCWLWNOHHXZHPVUTW3ZOQSQJOW","json":"https://pith.science/pith/LCWLWNOHHXZHPVUTW3ZOQSQJOW.json","graph_json":"https://pith.science/api/pith-number/LCWLWNOHHXZHPVUTW3ZOQSQJOW/graph.json","events_json":"https://pith.science/api/pith-number/LCWLWNOHHXZHPVUTW3ZOQSQJOW/events.json","paper":"https://pith.science/paper/LCWLWNOH"},"agent_actions":{"view_html":"https://pith.science/pith/LCWLWNOHHXZHPVUTW3ZOQSQJOW","download_json":"https://pith.science/pith/LCWLWNOHHXZHPVUTW3ZOQSQJOW.json","view_paper":"https://pith.science/paper/LCWLWNOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.10030&json=true","fetch_graph":"https://pith.science/api/pith-number/LCWLWNOHHXZHPVUTW3ZOQSQJOW/graph.json","fetch_events":"https://pith.science/api/pith-number/LCWLWNOHHXZHPVUTW3ZOQSQJOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCWLWNOHHXZHPVUTW3ZOQSQJOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCWLWNOHHXZHPVUTW3ZOQSQJOW/action/storage_attestation","attest_author":"https://pith.science/pith/LCWLWNOHHXZHPVUTW3ZOQSQJOW/action/author_attestation","sign_citation":"https://pith.science/pith/LCWLWNOHHXZHPVUTW3ZOQSQJOW/action/citation_signature","submit_replication":"https://pith.science/pith/LCWLWNOHHXZHPVUTW3ZOQSQJOW/action/replication_record"}},"created_at":"2026-07-05T06:35:22.195015+00:00","updated_at":"2026-07-05T06:35:22.195015+00:00"}